Related papers: Fault-Tolerant Implementation of the Deutsch-Jozsa…
Many current quantum error-correcting codes that achieve full fault tolerance suffer from having low ratios of logical to physical qubits and significant overhead. This makes them difficult to implement on current noisy intermediate-scale…
Low-depth random circuit codes possess many desirable properties for quantum error correction but have so far only been analyzed in the code capacity setting where it is assumed that encoding gates and syndrome measurements are noiseless.…
A quantum computer -- i.e., a computer capable of manipulating data in quantum superposition -- would find applications including factoring, quantum simulation and tests of basic quantum theory. Since quantum superpositions are fragile, the…
For a practical quantum computer to operate, it will be essential to properly manage decoherence. One important technique for doing this is the use of "decoherence-free subspaces" (DFSs), which have recently been demonstrated. Here we…
We propose a physical scheme for implementing the Deutsch-Jozsa algorithm using atomic ensembles and optical devices. The scheme has inherent fault tolerance to the realistic noise and efficient scaling with the number of ensembles for some…
The original Deutsch-Jozsa (oDJ) problem is for an oracle (realized here as a database) of size N, where, according to their claim, the deterministic solution of the problem on a classical Turing computer requires O(N) computational…
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…
This paper proves the threshold result, which asserts that quantum computation can be made robust against errors and inaccuracies, when the error rate, $\eta$, is smaller than a constant threshold, $\eta_c$. The result holds for a very…
Fault tolerant quantum computing methods which work with efficient quantum error correcting codes are discussed. Several new techniques are introduced to restrict accumulation of errors before or during the recovery. Classes of eligible…
Existing lower bounds on redundancy in fault-tolerant quantum circuits are applicable when both the input and the intended output are quantum states. These bounds may not necessarily hold, however, when the input and the intended output are…
Quantum computing implementations under consideration today typically deal with systems with microscopic degrees of freedom such as photons, ions, cold atoms, and superconducting circuits. The quantum information is stored typically in…
We describe the first experimental realization of the Deutsch-Jozsa quantum algorithm to evaluate the properties of a 2-bit boolean function in the framework of one-way quantum computation. For this purpose a novel two-photon six-qubit…
Usual scenarios of fault-tolerant computation are concerned with the fault-tolerant realization of quantum algorithms that compute classical functions, such as Shor's algorithm for factoring. In particular, this means that input and output…
Quantum error correction protects fragile quantum information by encoding it into a larger quantum system. These extra degrees of freedom enable the detection and correction of errors, but also increase the operational complexity of the…
Quantum error correction is necessary to perform large-scale quantum computations in the presence of noise and decoherence. As a result, several aspects of quantum error correction have already been explored. These have been primarily…
The goal of this paper is to review the theoretical basis for achieving a faithful quantum information transmission and processing in the presence of noise. Initially encoding and decoding, implementing gates and quantum error correction…
Noise remains a fundamental challenge in quantum computing, significantly affecting pulse fidelity and overall circuit performance. This paper introduces an adaptive algorithm for pulse-level quantum error mitigation, designed to enhance…
Noise rates in quantum computing experiments have dropped dramatically, but reliable qubits remain precious. Fault-tolerance schemes with minimal qubit overhead are therefore essential. We introduce fault-tolerant error-correction…
Recently Shor showed how to perform fault tolerant quantum computation when the error probability is logarithmically small. We improve this bound and describe fault tolerant quantum computation when the error probability is smaller than…
Quantum algorithms must be scaled up to tackle real-world applications. Doing so requires overcoming the noise present on today's hardware. The quantum approximate optimization algorithm (QAOA) is a promising candidate for scaling up, due…