Topological code Autotune
TL;DR: Autotune is designed to facilitate the precise study of real hardware running TQEC with every quantum gate having a realistic, physics-based error model, and is described a tool Autotune capable of performing this optimization automatically.
read more
Abstract: Many quantum systems are being investigated in the hope of building a large-scale quantum computer. All of these systems suffer from decoherence, resulting in errors during the execution of quantum gates. Quantum error correction enables reliable quantum computation given unreliable hardware. Unoptimized topological quantum error correction (TQEC), while still effective, performs very suboptimally, especially at low error rates. Hand optimizing the classical processing associated with a TQEC scheme for a specific system to achieve better error tolerance can be extremely laborious. We describe a tool Autotune capable of performing this optimization automatically, and give two highly distinct examples of its use and extreme outperformance of unoptimized TQEC. Autotune is designed to facilitate the precise study of real hardware running TQEC with every quantum gate having a realistic, physics-based error model.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Quantum error correction for quantum memories
TL;DR: In this article, the relation between error correction and the concept of two-dimensional topological order in many-body physics is reviewed. And the authors show that certain multiqubit entangled states are well protected from common forms of decoherence as the quantum information is hidden in inherently nonlocal degrees of freedom.
Surface code implementation of block code state distillation.
TL;DR: It is found that, using the best available techniques, for parameters of practical interest, block code state distillation does not always lead to lower overhead, and, when it does, the overhead reduction is typically less than a factor of three.
Efficient classical simulation of noisy random quantum circuits in one dimension
TL;DR: In this article, the authors studied the computational power of 1D noisy RCS and showed that the maximum achievable MPO entanglement entropy is bounded by a constant that depends only on the gate error rate, not on the system size.
High-threshold and low-overhead fault-tolerant quantum memory
TL;DR: An end-to-end quantum error correction protocol that implements fault-tolerant memory based on a family of LDPC codes with a high encoding rate that achieves an error threshold of $0.8\%$ for the standard circuit-based noise model is presented.
Fault-tolerant weighted union-find decoding on the toric code
TL;DR: This work benchmarked a weighted variant of the union-find decoder on the toric code under circuit-level depolarizing noise, which preserves the almost-linear time complexity of the original while significantly increasing the performance in the fault-tolerance setting.
References
Algorithms for quantum computation: discrete logarithms and factoring
Peter W. Shor
- 20 Nov 1994
TL;DR: Las Vegas algorithms for finding discrete logarithms and factoring integers on a quantum computer that take a number of steps which is polynomial in the input size, e.g., the number of digits of the integer to be factored are given.
9.1K
A fast quantum mechanical algorithm for database search
Lov K. Grover
- 01 Jul 1996
TL;DR: In this paper, it was shown that a quantum mechanical computer can solve integer factorization problem in a finite power of O(log n) time, where n is the number of elements in a given integer.
8.1K
Scheme for reducing decoherence in quantum computer memory
TL;DR: In the mid-1990s, theorists devised methods to preserve the integrity of quantum bits\char22{}techniques that may become the key to practical quantum computing on a large scale.
4.9K
A one-way quantum computer.
TL;DR: A scheme of quantum computation that consists entirely of one-qubit measurements on a particular class of entangled states, the cluster states, which are thus one-way quantum computers and the measurements form the program.
4.6K
Universal Quantum Simulators
TL;DR: Feynman's 1982 conjecture, that quantum computers can be programmed to simulate any local quantum system, is shown to be correct.
3.5K
Related Papers (5)
Peter Bernard Brooks
- 01 Jan 2013