Related papers: Improving threshold for fault-tolerant color code …
We compute the error threshold of color codes, a class of topological quantum codes that allow a direct implementation of quantum Clifford gates, when both qubit and measurement errors are present. By mapping the problem onto a…
Qudits can be described by a state vector in a $q$-dimensional Hilbert space, enabling a more extensive encoding and manipulation of information compared to qubits. This implies that conducting fault-tolerant quantum computations using…
Encoding quantum information in a quantum error correction (QEC) code enhances protection against errors. Imperfection of quantum devices due to decoherence effects will limit the fidelity of quantum gate operations. In particular, neutral…
Flag qubits have recently been proposed in syndrome extraction circuits to detect high-weight errors arising from fewer faults. The use of flag qubits allows the construction of fault-tolerant protocols with the fewest number of ancillas…
Quantum error correcting codes protect quantum information, allowing for large quantum computations provided that physical error rates are sufficiently low. We combine post-selection with surface code error correction through the use of a…
Quantum error correction codes (QECC) are a key component for realizing the potential of quantum computing. QECC, as its classical counterpart (ECC), enables the reduction of error rates, by distributing quantum logical information across…
Fault-tolerant (FT) computation by using quantum error correction (QEC) is essential for realizing large-scale quantum algorithms. Devices are expected to have enough qubits to demonstrate aspects of fault tolerance in the near future.…
Mapping quantum error correcting codes to classical disordered statistical mechanics models and studying the phase diagram of the latter has proven a powerful tool to study the fundamental error robustness and associated critical error…
Quantum computers face significant challenges from quantum deviations or coherent noise, particularly during gate operations, which pose a complex threat to the efficacy of quantum error correction (QEC) protocols. In this study, we…
Fault-tolerant quantum computation (FTQC) is expected to address a wide range of computational problems. To realize large-scale FTQC, it is essential to encode logical qubits using quantum error-correcting codes. High-rate concatenated…
The overhead of quantum error correction (QEC) poses a major bottleneck for realizing fault-tolerant computation. To reduce this overhead, we exploit the idea of erasure qubits, relying on an efficient conversion of the dominant noise into…
With gate error rates in multiple technologies now below the threshold required for fault-tolerant quantum computation, the major remaining obstacle to useful quantum computation is scaling, a challenge greatly amplified by the huge…
Recent work on fault-tolerant quantum computation making use of topological error correction shows great potential, with the 2d surface code possessing a threshold error rate approaching 1% (NJoP 9:199, 2007), (arXiv:0905.0531). However,…
Quantum computers promise to solve problems that are intractable for classical computers, but qubits are vulnerable to many sources of error, limiting the depth of the circuits that can be reliably executed on today's quantum hardware.…
A major challenge in practical quantum computation is the ineludible errors caused by the interaction of quantum systems with their environment. Fault-tolerant schemes, in which logical qubits are encoded by several physical qubits, enable…
Characterizing the error sources of quantum devices is essential for building reliable large-scale quantum architectures and tailoring error correction codes to the noise profile of the devices. Tomography techniques can provide detailed…
We demonstrate that the performance of quantum error correction can be improved with noise-aware decoders that are calibrated to the likelihood of physical error configurations in a device. We show that noise-aware decoding increases the…
We present a two-step decoder for the parity code and evaluate its performance in code-capacity and faulty-measurement settings. For noiseless measurements, we find that the decoding problem can be reduced to a series of repetition codes…
Lookup table decoding is fast and distance-preserving, making it attractive for near-term quantum computer architectures with small-distance quantum error-correcting codes. In this work, we develop several optimization tools that can…
Quantum error correction provides a path to reach practical quantum computing by combining multiple physical qubits into a logical qubit, where the logical error rate is suppressed exponentially as more qubits are added. However, this…