Fault-tolerant quantum computing will require accurate estimates of the resource overhead, but standard metrics such as gate fidelity and diamond distance have been shown to be poor predictors of logical performance. We present a scalable experimental approach based on Pauli error reconstruction to predict the performance of concatenated codes. Numerical evidence demonstrates that our method significantly outperforms predictions based on standard error metrics for various error models, even with limited data. We illustrate how this method assists in the selection of error correction schemes.Comment: 5 pages + 11 page appendix, 6 figure
Continuous quantum error correction has been found to have certain advantages over discrete quantum ...
Vast numbers of qubits will be needed for large-scale quantum computing due to the overheads associa...
Quantum error correcting (QEC) stabilizer codes enable protection of quantum information against err...
The hope of the quantum computing field is that quantum architectures are able to scale up and reali...
The performance of quantum error correction can be significantly improved if detailed information ab...
Quantum computers have the potential to solve several interesting problems in polynomial time for w...
We have previously [11] shown that for quantum memories and quantum communication, a state can be tr...
We present a post-compilation quantum circuit optimization technique that takes into account the var...
The demonstration of quantum error correction (QEC) is one of the most important milestones in the r...
Remarkable experimental advances in quantum computing are exemplified by recent announcements of imp...
Quantum computers are actively competing to surpass classical supercomputers, but quantum errors rem...
We investigate a family of fault-tolerant quantum error correction schemes based on the concatenatio...
A universal, scalable quantum computer will require the use of quantum error correction in order to ...
Practical quantum computing will require error rates that are well below what is achievable with phy...
The inevitable accumulation of errors in near-future quantum devices represents a key obstacle in de...
Continuous quantum error correction has been found to have certain advantages over discrete quantum ...
Vast numbers of qubits will be needed for large-scale quantum computing due to the overheads associa...
Quantum error correcting (QEC) stabilizer codes enable protection of quantum information against err...
The hope of the quantum computing field is that quantum architectures are able to scale up and reali...
The performance of quantum error correction can be significantly improved if detailed information ab...
Quantum computers have the potential to solve several interesting problems in polynomial time for w...
We have previously [11] shown that for quantum memories and quantum communication, a state can be tr...
We present a post-compilation quantum circuit optimization technique that takes into account the var...
The demonstration of quantum error correction (QEC) is one of the most important milestones in the r...
Remarkable experimental advances in quantum computing are exemplified by recent announcements of imp...
Quantum computers are actively competing to surpass classical supercomputers, but quantum errors rem...
We investigate a family of fault-tolerant quantum error correction schemes based on the concatenatio...
A universal, scalable quantum computer will require the use of quantum error correction in order to ...
Practical quantum computing will require error rates that are well below what is achievable with phy...
The inevitable accumulation of errors in near-future quantum devices represents a key obstacle in de...
Continuous quantum error correction has been found to have certain advantages over discrete quantum ...
Vast numbers of qubits will be needed for large-scale quantum computing due to the overheads associa...
Quantum error correcting (QEC) stabilizer codes enable protection of quantum information against err...