Scalable and fault-tolerant preparation of encoded k-uniform states

Abstract

$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.

arXiv comment6 page, 6 figures

References in corpus (48)

• Surface codes: Towards practical large-scale quantum computation
• Topological quantum memory
• Improved Simulation of Stabilizer Circuits
• Universal Quantum Computation with ideal Clifford gates and noisy ancillas
• Multiple Particle Interference and Quantum Error Correction
• Suppressing quantum errors by scaling a surface code logical qubit
• Logical quantum processor based on reconfigurable atom arrays
• Multi-party entanglement in graph states
• The foundations of statistical mechanics from entanglement: Individual states vs. averages
• Holographic quantum error-correcting codes: Toy models for the bulk/boundary correspondence
• Quantum error correction below the surface code threshold
• Quantum Entanglement Growth Under Random Unitary Dynamics
• High-fidelity parallel entangling gates on a neutral atom quantum computer
• Codes for the Quantum Erasure Channel
• Multipartite entanglement, quantum-error-correcting codes, and entangling power of quantum evolutions
• Absolute Maximal Entanglement and Quantum Secret Sharing
• Maximally multipartite entangled states
• Fault-tolerant conversion between the Steane and Reed-Muller quantum codes
• Multi-Qubit Systems: Highly Entangled States and Entanglement Distribution
• Absolutely Maximally Entangled states, combinatorial designs and multi-unitary matrices
• Genuinely multipartite entangled states and orthogonal arrays
• Absolutely maximally entangled states of seven qubits do not exist
• Unfolding the color code
• Four-qubit entanglement from string theory
• A magic state's fidelity can be superior to the operations that created it
• Entanglement and quantum combinatorial designs
• Bounds on absolutely maximally entangled states from shadow inequalities, and the quantum MacWilliams identity
• Exploring pure quantum states with maximally mixed reductions
• Efficient Quantum Polar Coding
• On the Black-Hole/Qubit Correspondence
• Constructing optimal quantum error correcting codes from absolute maximally entangled states
• $k$-Uniform states and quantum information masking
• Classical Statistical Mechanics Approach to Multipartite Entanglement
• Constructions of k-uniform and absolutely maximally entangled states beyond maximum distance codes
• Entangling four logical qubits beyond break-even in a nonlocal code
• Pauli channels can be estimated from syndrome measurements in quantum error correction
• Approximate Bacon-Shor Code and Holography
• Stochastic Local Operations with Classical Communication of Absolutely Maximally Entangled States
• Entanglement accelerates quantum simulation
• Holographic Codes from Hyperinvariant Tensor Networks
• Absolutely maximally entangled states, quantum maximum distance separable codes, and quantum repeaters
• Thermodynamic analysis of quantum error correcting engines
• Quantum combinatorial designs and $k$-uniform states
• Modifying method of constructing quantum codes from highly entangled states
• Near-Term Spin-Qubit Architecture Design via Multipartite Maximally-Entangled States
• Far from Perfect: Quantum Error Correction with (Hyperinvariant) Evenbly Codes
• Feynman graphs and the large dimensional limit of multipartite entanglement
• A unification of the coding theory and OAQEC perspective on hybrid codes