Using an error models motivated by the Knill, Laflamme, Milburn proposal for efficient linear optics quantum computing [Nature 409,46--52, 2001], error rate thresholds for erasure errors caused by imperfect photon detectors using a 7 qubit code are derived and verified through simulation. A novel method -- based on a Markov chain description of the erasure correction procedure -- is developed and used to calculate the recursion relation describing the error rate at different encoding levels from which the threshold is derived, matching threshold predictions by Knill, Laflamme and Milburn [quant-ph/0006120, 2000]. In particular, the erasure threshold for gate failure rate in the same order as the measurement failure rate is found to be above 1.78%.
We suggest a technique for constructing lower (existence) bounds for the fault-tolerant threshold to scalable quantum computation applicable to degenerate quantum codes with sublinear distance scaling. We give explicit analytic expressions combining probabilities of erasures, depolarizing errors, and phenomenological syndrome measurement errors for quantum LDPC codes with logarithmic or larger distances. These threshold estimates are parametrically better than the existing analytical bound based on percolation.
Topological subsystem color codes (TSCCs) are an important class of topological subsystem codes that allow for syndrome measurement with only 2-body measurements. It is expected that such low complexity measurements can help in fault tolerance. While TSCCs have been studied over depolarizing noise model, their performance over the erasure channel has not been studied as much. Recently, we proposed erasure decoders for TSCCs and reported a threshold of 9.7%. In this paper, we continue our study of TSCCS over the erasure channel. We propose two erasure decoders for topological subsystem color co…
A fundamental requirement for enabling fault-tolerant quantum information processing is an efficient quantum error-correcting code (QECC) that robustly protects the involved fragile quantum states from their environment. Just as classical error-correcting codes are indispensible in today's information technologies, it is believed that QECC will play a similarly crucial role in tomorrow's quantum information systems. Here, we report on the first experimental demonstration of a quantum erasure-correcting code that overcomes the devastating effect of photon losses. Whereas {\it errors} translate,…
In the optical Stern-Gerlach effect the two branches in which the incoming atomic packet splits up can display interference pattern outside the cavity when a field measurement is made which erases the which-way information on the quantum paths the system can follow. On the contrary, the mere possibility to acquire this information causes a decoherence effect which cancels out the interference pattern. A phase space analysis is also carried out to investigate on the negativity of the Wigner function and on the connection between its covariance matrix and the distinguishability of the quantum pa…
Recent experiments in quantum optics have shed light on the foundations of quantum physics. Quantum erasers - modified quantum interference experiments - show that quantum entanglement is responsible for the complementarity principle.
Quantum states of light being transmitted via realistic free-space channels often suffer erasure errors due to several factors such as coupling inefficiencies between transmitter and receiver. In this work, an error correction code capable of protecting a single-mode quantum state against erasures is presented. Our three-mode code protects a single-mode Continuous Variable (CV) state via a bipartite CV entangled state. In realistic deployments, it can almost completely reverse a single erasure on the encoded state, and for two erasures can it improve the fidelities of received states relative …
Executing quantum algorithms on error-corrected logical qubits is a critical step for scalable quantum computing, but the requisite numbers of qubits and physical error rates are demanding for current experimental hardware. Recently, the development of error correcting codes tailored to particular physical noise models has helped relax these requirements. In this work, we propose a qubit encoding and gate protocol for ${}^{171}$Yb neutral atom qubits that converts the dominant physical errors into erasures, that is, errors in known locations. The key idea is to encode qubits in a metastable el…
Many-body entangled states are key elements in quantum information science and quantum metrology. One important problem in establishing a high degree of many-body entanglement using optical techniques is the leakage of the system information via the light that creates such entanglement. We propose an all-optical interference-based approach to erase this information. Unwanted atom-light entanglement can be removed by destructive interference of three or more successive atom-light interactions, with only the desired effective atom-atom interaction left. This quantum erasure protocol allows imple…
We consider quantum error-correction codes for multimode bosonic systems, such as optical fields, that are affected by amplitude damping. Such a process is a generalization of an erasure channel. We demonstrate that the most accessible method of transforming optical systems with the help of passive linear networks has limited usefulness in preparing and manipulating such codes. These limitations stem directly from the recoverability condition for one-photon loss. We introduce a three-photon code protecting against the first order of amplitude damping, i.e. a single photon loss, and discuss its…
We expand the class of holographic quantum error correcting codes by developing the notion of block perfect tensors, a wider class that includes previously defined perfect tensors. The relaxation of this constraint opens up a range of other holographic codes. We demonstrate this by introducing the self-dual CSS heptagon holographic code, based on the 7-qubit Steane code. Finally we show promising thresholds for the erasure channel by applying a straightforward, optimal erasure decoder to the heptagon code and benchmark it against existing holographic codes.
In a delayed-choice quantum eraser, interference fringes are obtained by erasing which-way information after the interfering particle has already been irreversibly detected. Following an introductory review of delayed-choice experiments and quantum erasure, we describe the experimental realization of an optical delayed-choice quantum eraser, suitable for advanced undergraduates, based on polarization-entangled pairs of single photons. In our experiment, the delay of the erasure is implemented using two different setups. The first setup employs an arrangement of mirrors to increase the optical …
Landauer's erasure principle is a cornerstone of thermodynamics and information theory. According to this principle, erasing information incurs a minimum energy cost. Recently, Vaccaro and Barnett [Proc. R. Soc {\bf 467}, 1770 (2011)] explored information erasure in the context of multiple conserved quantities and showed that the erasure cost can be solely in terms of spin angular momentum. As Landauer's erasure principle plays a fundamental role in heat engines, their result considerably widens the possible configurations that heat engines can have. Motivated by this, we propose here a novel …
In order to build a large scale quantum computer, one must be able to correct errors extremely fast. We design a fast decoding algorithm for topological codes to correct for Pauli errors and erasure and combination of both errors and erasure. Our algorithm has a worst case complexity of $O(n α(n))$, where $n$ is the number of physical qubits and $α$ is the inverse of Ackermann's function, which is very slowly growing. For all practical purposes, $α(n) \leq 3$. We prove that our algorithm performs optimally for errors of weight up to $(d-1)/2$ and for loss of up to $d-1$ qubits, where $d$ is th…
We present a theoretical study of minimum error probability discrimination, using quantum- optical probe states, of M optical phase shifts situated symmetrically on the unit circle. We assume ideal lossless conditions and full freedom for implementing quantum measurements and for probe state selection, subject only to a constraint on the average energy, i.e., photon number. In particular, the probe state is allowed to have any number of signal and ancillary modes, and to be pure or mixed. Our results are based on a simple criterion that partitions the set of pure probe states into equivalence …
The recent years have seen a growing interest in quantum codes in three dimensions (3D). One of the earliest proposed 3D quantum codes is the 3D toric code. It has been shown that 3D color codes can be mapped to 3D toric codes. The 3D toric code on cubic lattice is also a building block for the welded code which has highest energy barrier to date. Although well known, the performance of the 3D toric code has not been studied extensively. In this paper, we propose efficient decoding algorithms for the 3D toric code on a cubic lattice with and without boundaries and report their performance for …
In this paper we numerically investigate the fault-tolerant threshold for optical cluster-state quantum computing. We allow both photon loss noise and depolarizing noise (as a general proxy for all local noise), and obtain a threshold region of allowed pairs of values for the two types of noise. Roughly speaking, our results show that scalable optical quantum computing is possible for photon loss probabilities less than 0.003, and for depolarization probabilities less than 0.0001.
Entropy threshold: A simple proxy for performance of quantum error correction
AWS Center for Quantum Computing（亚马逊量子计算中心）；Yale Quantum Institute & Department of Applied Physics, Yale University（耶鲁大学量子研究所与应用物理系）；Alice & Bob；Laboratoire de Physique de l’École Normale Supérieure, École Normale Supérieure, Centre Automatique et Systèmes, Mines Paris, Université PSL, CNRS, Inria（巴黎高等师范学院物理实验室、巴黎高等师范学院、自动与系统中心、巴黎矿业学院、巴黎文理研究大学、法国国家科学研究中心、Inria）
We show that the noise threshold for optical quantum computing can be significantly improved by using the EPR-type of photon source. In this implementation, the detector efficiency $η_{d}$ is required to be larger than 50%, and the source efficiency $η_{s}$ can be an arbitrarily small positive number. This threshold compares favorably with the implementation using the single-photon source, where one requires the combined efficiency $η_{d}η_{s}>2/3$. We discuss several physical setups for realization of the required EPR photon source, including the photon emitter from a single-atom cavity.
