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.

6 page, 6 figures

References in corpus (28)

• Surface codes: Towards practical large-scale quantum computation
• Suppressing quantum errors by scaling a surface code logical qubit
• Logical quantum processor based on reconfigurable atom arrays
• Multi-party entanglement in graph states
• Quantum error correction below the surface code threshold
• High-fidelity parallel entangling gates on a neutral atom quantum computer
• Multipartite entanglement, quantum-error-correcting codes, and entangling power of quantum evolutions
• Maximally multipartite entangled states
• Fault-tolerant conversion between the Steane and Reed-Muller quantum codes
• Multi-Qubit Systems: Highly Entangled States and Entanglement Distribution
• Genuinely multipartite entangled states and orthogonal arrays
• Four-qubit entanglement from string theory
• A magic state's fidelity can be superior to the operations that created it
• Exploring pure quantum states with maximally mixed reductions
• On the Black-Hole/Qubit Correspondence
• $k$-Uniform states and quantum information masking
• Constructions of k-uniform and absolutely maximally entangled states beyond maximum distance codes
• Entangling four logical qubits beyond break-even in a nonlocal code
• Approximate Bacon-Shor Code and Holography
• Pauli channels can be estimated from syndrome measurements in quantum error correction
• Stochastic Local Operations with Classical Communication of Absolutely Maximally Entangled States
• Holographic Codes from Hyperinvariant Tensor Networks
• Entanglement accelerates quantum simulation
• Thermodynamic analysis of quantum error correcting engines
• Modifying method of constructing quantum codes from highly entangled states
• Quantum combinatorial designs and $k$-uniform states
• Near-Term Spin-Qubit Architecture Design via Multipartite Maximally-Entangled States
• Far from Perfect: Quantum Error Correction with (Hyperinvariant) Evenbly Codes