Efficient fault-tolerant implementations of non-Clifford gates with reconfigurable atom arrays
arXiv:2312.09111 · doi:10.1038/s41534-024-00945-3
Abstract
To achieve scalable universal quantum computing, we need to implement a universal set of logical gates fault-tolerantly, for which the main difficulty lies with non-Clifford gates. We demonstrate that several characteristic features of the reconfigurable atom array platform are inherently well-suited for addressing this key challenge, potentially leading to significant advantages in fidelity and efficiency. Specifically, we consider a series of different strategies including magic state distillation, concatenated code array, and fault-tolerant logical multi-controlled- gates, leveraging key platform features such as non-local connectivity, parallel gate action, collective mobility, and native multi-controlled- gates. Our analysis provides valuable insights into the efficient experimental realization of logical gates, serving as a guide for the full-cycle demonstration of fault-tolerant quantum computation with reconfigurable atom arrays.
References in corpus (32)
- Surface codes: Towards practical large-scale quantum computation
- Topological quantum memory
- Universal Quantum Computation with ideal Clifford gates and noisy ancillas
- Logical quantum processor based on reconfigurable atom arrays
- An atom-by-atom assembler of defect-free arbitrary 2d atomic arrays
- Parallel implementation of high-fidelity multi-qubit gates with neutral atoms
- Surface code quantum computing by lattice surgery
- Demonstration of multi-qubit entanglement and algorithms on a programmable neutral atom quantum computer
- High-fidelity parallel entangling gates on a neutral atom quantum computer
- Restrictions on Transversal Encoded Quantum Gate Sets
- Magic state distillation with low overhead
- Universal fault-tolerant quantum computation with only transversal gates and error correction
- Quantum error correction with only two extra qubits
- Erasure conversion for fault-tolerant quantum computing in alkaline earth Rydberg atom arrays
- Quantum Hypergraph States
- Fault-tolerant conversion between the Steane and Reed-Muller quantum codes
- Classification of topologically protected gates for local stabilizer codes
- Unfolding the color code
- Fault-tolerant quantum computation with few qubits
- Fault-tolerant logical gates in quantum error-correcting codes
- Using concatenated quantum codes for universal fault-tolerant quantum gates
- The cost of universality: A comparative study of the overhead of state distillation and code switching with color codes
- Three-dimensional surface codes: Transversal gates and fault-tolerant architectures
- A fault-tolerant non-Clifford gate for the surface code in two dimensions
- Magic State Distillation with Low Space Overhead and Optimal Asymptotic Input Count
- Distillation with sublogarithmic overhead
- Codimension-2 defects and higher symmetries in (3+1)D topological phases
- Overhead analysis of universal concatenated quantum codes
- Higher cup products on hypercubic lattices: application to lattice models of topological phases
- Fault-Tolerant Code Switching Protocols for Near-Term Quantum Processors
- A four-dimensional toric code with non-Clifford transversal gates
- Constant-Overhead Fault-Tolerant Quantum Computation with Reconfigurable Atom Arrays