Related papers: Efficient diagnostics for quantum error correction
We examine the efficiency of pure, nondegenerate quantum-error correction-codes for Pauli channels. Specifically, we investigate if correction of multiple errors in a block is more efficient than using a code that only corrects one error…
Quantum computers are inhibited by physical errors that occur during computation. For this reason, the development of increasingly sophisticated error characterization and error suppression techniques is central to the progress of quantum…
The large overhead imposed by quantum error correction is a critical challenge to the realization of quantum computers, and motivates searching for alternative error correcting codes and fault-tolerant circuit constructions. Postselection…
We estimate the success probability of quantum protocols composed of Clifford operations in the presence of Pauli errors. Our method is derived from the fault-point formalism previously used to determine the success rate of low-distance…
The main ideas of quantum error correction are introduced. These are encoding, extraction of syndromes, error operators, and code construction. It is shown that general noise and relaxation of a set of 2-state quantum systems can always be…
Fault-tolerant schemes can use error correction to make a quantum computation arbitrarily ac- curate, provided that errors per physical component are smaller than a certain threshold and in- dependent of the computer size. However in…
We consider realistic, multi-parameter error models and investigate the performance of the surface code for three possible fault-tolerant superconducting quantum computer architectures. We map amplitude and phase damping to a diagonal Pauli…
Large-scale quantum computation will only be achieved if experimentally implementable quantum error correction procedures are devised that can tolerate experimentally achievable error rates. We describe a quantum error correction procedure…
Pauli-based computation (PBC) provides a universal framework for executing fault-tolerant quantum algorithms using Pauli measurements and magic states. In monolithic architectures, the serialized nature of PBC directly ties runtime to a…
It has been known that quantum error correction via concatenated codes can be done with exponentially small failure rate if the error rate for physical qubits is below a certain accuracy threshold. Other, unconcatenated codes with their own…
We calculate the fidelity with which an arbitrary state can be encoded into a [7,1,3] CSS quantum error correction code in a non-equiprobable Pauli operator error environment with the goal of determining whether this encoding can be used…
The discovery of quantum error correction has greatly improved the long-term prospects for quantum computing technology. Encoded quantum information can be protected from errors that arise due to uncontrolled interactions with the…
In this paper we extend both standard fault tolerance theory and Kitaev's model for quantum computation, combining them so as to yield quantitative results that reveal the interplay between the two. Our analysis establishes a methodology…
The purpose of this little survey is to give a simple description of the main approaches to quantum error correction and quantum fault-tolerance. Our goal is to convey the necessary intuitions both for the problems and their solutions in…
Various benchmarking metrics have been developed to quantify the performance of quantum computing hardware and help evaluate development. However, it is not always necessary to know the metric values precisely. This is especially true for…
Quantum error correction (QEC) is essential for scalable quantum computing. However, it requires classical decoders that are fast and accurate enough to keep pace with quantum hardware. While quantum low-density parity-check codes have…
The error correcting capabilities of the Calderbank-Shor-Steane [[7,1,3]] quantum code, together with a fault-tolerant syndrome extraction by means of several ancilla states, have been numerically studied. A simple probability expression to…
Simulating dynamics of physical systems is a key application of quantum computing, with potential impact in fields such as condensed matter physics and quantum chemistry. However, current quantum algorithms for Hamiltonian simulation yield…
The standard method for benchmarking quantum error-correction is randomized fault-injection testing. The state-of-the-art tool stim is efficient for error correction implementations with distances of up to 10, but scales poorly to larger…
Scaling up quantum computers to attain substantial speedups over classical computing requires fault tolerance. Conventionally, protocols for fault-tolerant quantum computation demand excessive space overheads by using many physical qubits…