Symmetry boosts quantum computer performance
arXiv:1601.07497 · doi:10.1103/PhysRevA.97.052311
Abstract
Frequently, subroutines in quantum computers have the structure , where is some unitary transform and is performing a quantum computation. In this paper we suggest that if, in analogy to spin echoes, and can be implemented symmetrically such that and have the same hardware errors, a symmetry boost in the fidelity of the combined quantum operation results. Running the complete gate--by--gate implemented Shor algorithm, we show that the fidelity boost can be as large as a factor 10. Corroborating and extending our numerical results, we present analytical scaling calculations that show that a symmetry boost persists in the practically interesting case of a large number of qubits. Our analytical calculations predict a minimum boost factor of about 3, valid for all qubit numbers, which includes the boost factor 10 observed in our low-qubit-number simulations. While we find and document this symmetry boost here in the case of Shor's algorithm, we suggest that other quantum algorithms might profit from similar symmetry-based performance boosts whenever sub-units of the corresponding quantum algorithm can be identified.
References in corpus (17)
- Good Quantum Error-Correcting Codes Exist
- Quantum Error Correction for Quantum Memories
- A Theory of Fault-Tolerant Quantum Computation
- Quantum Error Correction for Beginners
- Single-Ion Atomic Clock with Systematic Uncertainty
- Noise tailoring for scalable quantum computation via randomized compiling
- The Ion Trap Quantum Information Processor
- Efficient fault-tolerant quantum computing
- Asymptotically optimal approximation of single qubit unitaries by Clifford and T circuits using a constant number of ancillary qubits
- Experimental quantum coding against photon loss error
- Factoring in a Dissipative Quantum Computer
- Quantum computation with phase drift errors
- Serialized Quantum Error Correction Protocol for High-Bandwidth Quantum Repeaters
- Scaling laws for Shor's algorithm with a banded quantum Fourier transform
- Correlated errors can lead to better performance of quantum codes
- Shor's factorization algorithm with a single control qubit and imperfections
- Effects of dynamical phases in Shor's factoring algorithm with operational delays