Errors in quantum computers are of two kinds: sudden perturbations to isolated qubits, and slow random drifts of all the qubits. The latter may be reduced, but not eliminated, by means of symmetrization, namely by using many replicas of the computer, and forcing their joint quantum state to be completely symmetric. On the other hand, isolated errors can be corrected by quantum codewords that represent a logical qubit in a redundant way, by several physical qubits. If one of the physical qubits is perturbed, for example if it gets entangled with an unknown environment, there still is enough information encoded in the other physical qubits to restore the logical qubit, and disentangle it from the environment. The recovery procedure may consist of unitary operations, without the need of actually identifying the error.
Large quantum computers promise to solve some critical problems not solvable otherwise. However, modern quantum technologies suffer various imperfections such as control errors and qubit decoherence, inhibiting their potential utility. The overheads of quantum error correction are too great for near-term quantum computers, whereas error-mitigation strategies that address specific device imperfections may lose relevance as devices improve. To enhance the performance of quantum computers with high-quality qubits, we introduce a strategy based on symmetrization and nonlinear aggregation. On a com…
The quantum states representing classical phase space are given, and these are used to formulate quantum statistical mechanics as a formally exact double perturbation expansion about classical statistical mechanics. One series of quantum contributions arises from the non-commutativity of the position and momentum operators. Although the formulation of the quantum states differs, the present results for separate averages of position operators and of momentum operators agree with Wigner (1932) and Kirkwood (1933). The second series arises from wave function symmetrization, and is given in terms …
Quantum error correcting codes (QECC) are the key ingredients both for fault-tolerant quantum computation and quantum communication. Teleportation-based error correction (TEC) helps in detecting and correcting operational and erasure errors by performing X and Z measurements during teleportation. Here we demonstrate the TEC protocol for the detection and correction of a single bit-flip error by proposing a new quantum circuit. A single phase-flip error can also be detected and corrected using the above protocol. For the first time, we illustrate detection and correction of erasure error in the…
Quantum corrections to the classical pressure are obtained for Lennard-Jones models of argon, neon, and helium using classical Metropolis algorithm computer simulations. The corrections for non-commutativity are obtained to fourth order in Planck's constant. Compared to the classical virial pressure on all isotherms at liquid-like densities, the quantum correction is found to be ${\cal O}(10^{-2})$ for argon, ${\cal O}(10^{0})$ for neon, and ${\cal O}(10^{3})$ for helium. The first order correction due to wave function symmetrization is also obtained, but this is relatively negligible.
Experimental realization of automated error correction is demonstrated through IBM Quantum Experience for Bell and GHZ states using a measurement based approach upon ancilla qubits. The measurement automatically activates error correcting unitary operations to restore the system to its original entangled state. We illustrate the algorithm for the maximally entangled qudit case by applying appropriate Hadamard and Controlled-NOT gates.
Construction of a fault-tolerant quantum computer remains a challenging problem due to unavoidable noise in quantum states and the fragility of quantum entanglement. However, most of the error-correcting codes increases the complexity of the algorithms, thereby decreasing any quantum advantage. Here we present a task-specific error-correction technique that provides a complete protection over a restricted set of quantum states. Specifically, we give an automated error correction in Superdense Coding algorithms utilizing n-qubit generalized Bell states. At its core, it is based on non-destructi…
We study fault-tolerant error correction in a quantum memory constructed as a two-dimensional model of Fibonacci anyons on a torus, in the presence of thermal noise represented by pair-creation processes and measurement errors. The correction procedure is based on the cellular automaton decoders originating in the works of Gács and Harrington. Through numerical simulations, we observe that this code behaves fault-tolerantly and that threshold behavior is likely present. Hence, we provide strong evidence for the existence of a fault-tolerant universal non-Abelian topological quantum computer.
Quantum error correction holds the key to scaling up quantum computers. Cosmic ray events severely impact the operation of a quantum computer by causing chip-level catastrophic errors, essentially erasing the information encoded in a chip. Here, we present a distributed error correction scheme to combat the devastating effect of such events by introducing an additional layer of quantum erasure error correcting code across separate chips. We show that our scheme is fault tolerant against chip-level catastrophic errors and discuss its experimental implementation using superconducting qubits with…
We present error mitigation (EM) techniques for noisy intermediate-scale quantum computers (QC) based on density matrix purification and perturbative corrections to the target energy. We incorporate this scheme into the variational quantum eigensolver (VQE) and demonstrate chemically-accurate ground state energy calculations of various alkali metal hydrides using IBM quantum computers. Both the density matrix purification improvements and the perturbative corrections require only meager classical computational resources, and are conducted exclusively as post-processing of the measured density …
Quantum computing (QC) is at the cusp of a revolution. Machines with 100 quantum bits (qubits) are anticipated to be operational by 2020 [googlemachine,gambetta2015building], and several-hundred-qubit machines are around the corner. Machines of this scale have the capacity to demonstrate quantum supremacy, the tipping point where QC is faster than the fastest classical alternative for a particular problem. Because error correction techniques will be central to QC and will be the most expensive component of quantum computation, choosing the lowest-overhead error correction scheme is critical to…
The class of problems represented by frustrated cluster loops, FCL, is a robust set of problems that spans a wide range of computational difficulty and that are easy to determine what their solutions are. Here, we use frustrated cluster loops to test the relative performance of the D-Wave without post-processing and the D-Wave with multi-qubit correction (MQC) post-processing. MQC post-processing has shown itself exceptionally beneficial in improving the performance of the D-Wave 2000Q when processing difficult FCL problems.
Major obstacles remain to the implementation of macroscopic quantum computing: hardware problems of noise, decoherence, and scaling; software problems of error correction; and, most important, algorithm construction. Finding truly quantum algorithms is quite difficult, and many of these genuine quantum algorithms, like Shor's prime factoring or phase estimation, require extremely long circuit depth for any practical application, which necessitates error correction. In contrast, we show that machine learning can be used as a systematic method to construct algorithms, that is, to non-algorithmic…
This paper investigates quantum error correction schemes for fully-correlated noise channels on an $n$-qubit system, where error operators take the form $W^{\otimes n}$, with $W$ being an arbitrary $2\times 2$ unitary operator. In previous literature, a recursive quantum error correction scheme can be used to protect $k$ qubits using $(k+1)$-qubit ancilla. We implement this scheme on 3-qubit and 5-qubit channels using the IBM quantum computers, where we uncover an error in the previous paper related to the decomposition of the encoding/decoding operator into elementary quantum gates. Here, we …
We develop a classical bit-flip correction method to mitigate measurement errors on quantum computers. This method can be applied to any operator, any number of qubits, and any realistic bit-flip probability. We first demonstrate the successful performance of this method by correcting the noisy measurements of the ground-state energy of the longitudinal Ising model. We then generalize our results to arbitrary operators and test our method both numerically and experimentally on IBM quantum hardware. As a result, our correction method reduces the measurement error on the quantum hardware by up t…
Simplified circuit-level decoding using Knill error correction
Inria Paris（巴黎国家信息与自动化研究所）；Quandela（夸当德拉）；Institute for Quantum Computing, University of Waterloo（滑铁卢大学量子计算研究所）；Perimeter Institute for Theoretical Physics（理论物理前沿研究所）
