Scalable and fault-tolerant preparation of encoded k-uniform states
Fuente:
arXiv
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866909838608433152 |
|---|---|
| author | Majidy, Shayan Hangleiter, Dominik Gullans, Michael J. |
| author_facet | Majidy, Shayan Hangleiter, Dominik Gullans, Michael J. |
| contents | $k$-uniform states are valuable resources in quantum information, enabling tasks such as teleportation, error correction, and accelerated quantum simulations. The practical realization of $k$-uniform states, at scale, faces major obstacles: verifying $k$-uniformity is as difficult as measuring code distances, and devising fault-tolerant preparation protocols further adds to the complexity. To address these challenges, we present a scalable, fault-tolerant method for preparing encoded $k$-uniform states, and we illustrate our approach using surface and color codes. We first present a technique to determine $k$-uniformity of stabilizer states directly from their stabilizer tableau. We then identify a family of Clifford circuits that ensures both fault tolerance and scalability in preparing these states. Building on the encoded $k$-uniform states, we introduce a hybrid physical-logical strategy that retains some of the error-protection benefits of logical qubits while lowering the overhead for implementing arbitrary gates compared to fully logical algorithms. We show that this hybrid approach can outperform fully physical implementations for resource-state preparation, as demonstrated by explicit constructions of $k$-uniform states. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2503_14506 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Scalable and fault-tolerant preparation of encoded k-uniform states Majidy, Shayan Hangleiter, Dominik Gullans, Michael J. Quantum Physics $k$-uniform states are valuable resources in quantum information, enabling tasks such as teleportation, error correction, and accelerated quantum simulations. The practical realization of $k$-uniform states, at scale, faces major obstacles: verifying $k$-uniformity is as difficult as measuring code distances, and devising fault-tolerant preparation protocols further adds to the complexity. To address these challenges, we present a scalable, fault-tolerant method for preparing encoded $k$-uniform states, and we illustrate our approach using surface and color codes. We first present a technique to determine $k$-uniformity of stabilizer states directly from their stabilizer tableau. We then identify a family of Clifford circuits that ensures both fault tolerance and scalability in preparing these states. Building on the encoded $k$-uniform states, we introduce a hybrid physical-logical strategy that retains some of the error-protection benefits of logical qubits while lowering the overhead for implementing arbitrary gates compared to fully logical algorithms. We show that this hybrid approach can outperform fully physical implementations for resource-state preparation, as demonstrated by explicit constructions of $k$-uniform states. |
| title | Scalable and fault-tolerant preparation of encoded k-uniform states |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2503.14506 |