While quantum weight enumerators establish some of the best upper bounds on the minimum distance of quantum error-correcting codes, these bounds are not optimized to quantify the performance of quantum codes under the effect of arbitrary quantum channels that describe bespoke noise models. Herein, for any Kraus decomposition of any given quantum channel, we introduce corresponding quantum weight enumerators that naturally generalize the Shor-Laflamme quantum weight enumerators. We establish an indirect linear relationship between these generalized quantum weight enumerators by introducing an auxiliary exact weight enumerator that completely quantifies the quantum code's projector, and is independent of the underlying noise process. By additionally working within the framework of approximate quantum error correction, we establish a general framework for constructing a linear program that is infeasible whenever approximate quantum error correcting codes with corresponding parameters do not exist. Our linear programming framework allows us to establish the non-existence of certain quantum codes that approximately correct amplitude damping errors, and obtain non-trivial upper bounds on the maximum dimension of a broad family of permutation-invariant quantum codes.
In this paper, we consider a simplified error-correcting problem: for a fixed encoding process, to find a cascade connected quantum channel such that the worst fidelity between the input and the output becomes maximum. With the use of the one-to-one parametrization of quantum channels, a procedure finding a suboptimal error-correcting channel based on a semidefinite programming is proposed. The effectiveness of our method is verified by an example of the bit-flip channel decoding.
A universal set of quantum gates is constructed for the recently developed jump-error correcting quantum codes. These quantum codes are capable of correcting errors arising from the spontaneous decay of distinguishable qubits into statistically independent reservoirs. The proposed universal quantum gates are constructed with the help of Heisenberg- and Ising-type Hamiltonians acting on these physical qubits. This way it is guaranteed that the relevant error correcting code space is not left at any time even during the application of one of these quantum gates. The proposed entanglement gate is…
We construct explicitly two infinite families of genuine nonadditive 1-error correcting quantum codes and prove that their coding subspaces are 50% larger than those of the optimal stabilizer codes of the same parameters via the linear programming bound. All these nonadditive codes can be characterized by a stabilizer-like structure and thus their encoding circuits can be designed in a straightforward manner.
Quantum error correcting codes with finite-dimensional Hilbert spaces have yielded new insights on bulk reconstruction in AdS/CFT. In this paper, we give an explicit construction of a quantum error correcting code where the code and physical Hilbert spaces are infinite-dimensional. We define a von Neumann algebra of type II$_1$ acting on the code Hilbert space and show how it is mapped to a von Neumann algebra of type II$_1$ acting on the physical Hilbert space. This toy model demonstrates the equivalence of entanglement wedge reconstruction and the exact equality of bulk and boundary relative…
This study considers implementations of error correction in a simulation language on a classical computer. Error correction will be necessarily in quantum computing and quantum information. We will give some examples of the implementations of some error correction codes. These implementations will be made in a more general quantum simulation language on a classical computer in the language Mathematica. The intention of this research is to develop a programming language that is able to make simulations of all quantum algorithms and error corrections in the same framework. The program code imple…
The dual of an entanglement-assisted quantum error-correcting (EAQEC) code is defined from the orthogonal group of a simplified stabilizer group. From the Poisson summation formula, this duality leads to the MacWilliams identities and linear programming bounds for EAQEC codes. We establish a table of upper and lower bounds on the minimum distance of any maximal-entanglement EAQEC code with length up to 15 channel qubits.
We investigate various aspects of operator quantum error-correcting codes or, as we prefer to call them, subsystem codes. We give various methods to derive subsystem codes from classical codes. We give a proof for the existence of subsystem codes using a counting argument similar to the quantum Gilbert-Varshamov bound. We derive linear programming bounds and other upper bounds. We answer the question whether or not there exist [[n,n-2d+2,r>0,d]]<sub>q</sub> subsystem codes. Finally, we compare stabilizer and subsystem codes with respect to the required number of syndrome qudits.
Performing experiments on small-scale quantum computers is certainly a challenging endeavor. Many parameters need to be optimized to achieve high-fidelity operations. This can be done efficiently for operations acting on single qubits as errors can be fully characterized. For multi-qubit operations, though, this is no longer the case as in the most general case analyzing the effect of the operation on the system requires a full state tomography for which resources scale exponentially with the system size. Furthermore, in recent experiments additional electronic levels beyond the two-level syst…
Uniqueness of Complementary Recovery in Holographic Error-Correcting Codes
Institute for Quantum & Information Sciences, Syracuse University（雪城大学量子与信息科学研究所）；Department of Physics, Syracuse University（雪城大学物理系）；Department of Electrical Engineering and Computer Science, Syracuse University（雪城大学电气与计算机工程系）
A semi-definite programming formulation of the device-dependent guessing probability
ICFO-Institut de Ciències Fotòniques, The Barcelona Institute of Science and Technology（ICFO-光子科学研究所，巴塞罗那科学技术研究院）；Institute for Quantum Optics and Quantum Information (IQOQI) Vienna, Austrian Academy of Sciences（奥地利科学院维也纳量子光学与量子信息研究所）；ICREA - Institució Catalana de Recerca i Estudis Avançats（加泰罗尼亚研究与高级研究学院）；Quside Technologies S.L.（Quside科技有限公司）
Self-correcting quantum memories demonstrate robust properties that can be exploited to improve active quantum error-correction protocols. Here we propose a cellular automaton decoder for a variation of the color code where the bases of the physical qubits are locally rotated, which we call the XYZ color code. The local transformation means our decoder demonstrates key properties of a two-dimensional fractal code if the noise acting on the system is infinitely biased towards dephasing, namely, no string-like logical operators. As such, in the high-bias limit, our local decoder reproduces the b…
Characterizing noisy quantum processes is important to quantum computation and communication (QCC), since quantum systems are generally open. To date, all methods of characterization of quantum dynamics (CQD), typically implemented by quantum process tomography, are \textit{off-line}, i.e., QCC and CQD are not concurrent, as they require distinct state preparations. Here we introduce a method, "quantum error correction based characterization of dynamics", in which the initial state is any element from the code space of a quantum error correcting code that can protect the state from arbitrary e…
When a logical qubit is protected using a quantum error-correcting code, the net effect of coding, decoherence (a physical channel acting on qubits in the codeword) and recovery can be represented exactly by an effective channel acting directly on the logical qubit. In this paper we describe a procedure for deriving the map between physical and effective channels that results from a given coding and recovery procedure. We show that the map for a concatenation of codes is given by the composition of the maps for the constituent codes. This perspective leads to an efficient means for calculating…
The codeword stabilized ("CWS") quantum codes formalism presents a unifying approach to both additive and nonadditive quantum error-correcting codes (arXiv:0708.1021). This formalism reduces the problem of constructing such quantum codes to finding a binary classical code correcting an error pattern induced by a graph state. Finding such a classical code can be very difficult. Here, we consider an algorithm which maps the search for CWS codes to a problem of identifying maximum cliques in a graph. While solving this problem is in general very hard, we prove three structure theorems which reduc…
A quantum error correcting code is a subspace $\mathcal{C}$ such that allowed errors acting on any state in $\mathcal{C}$ can be corrected. A quantum code for which state recovery is only required up to a logical rotation within $\mathcal{C}$, can be used for detection of errors, but not for quantum error correction. Such a code with stabilizer structure, which we call an "ambiguous stabilizer code" (ASC), can nevertheless be useful for the characterization of quantum dynamics (CQD). The use of ASCs can help lower the size of CQD probe states used, but at the cost of increased number of operat…
We first show that a class of operators acting on a given bipartite pure state on $\mathcal{H}_{A}\otimes\mathcal{H}_{B}$ can shrink its supports on $\mathcal{H}_{A}\otimes\mathcal{H}_{B}$ to only $\mathcal{H}_{A}$ or $\mathcal{H}_{B}$ while keeping its mappings. Using this result, we show how to systematically construct the decoders of the quantum error-correcting codes against erasure errors. The implications of the results for the operator dictionary in the AdS/CFT correspondence are also discussed. The "subalgebra code with complementary recovery" introduced in the recent work of Harlow is…
In a recent paper ([quant-ph/9610040]), Shor and Laflamme define two ``weight enumerators'' for quantum error correcting codes, connected by a MacWilliams transform, and use them to give a linear-programming bound for quantum codes. We introduce two new enumerators which, while much less powerful at producing bounds, are useful tools nonetheless. The new enumerators are connected by a much simpler duality transform, clarifying the duality between Shor and Laflamme's enumerators. We also use the new enumerators to give a simpler condition for a quantum code to have specified minimum distance, a…
A long-standing open question about Gaussian continuous-variable cluster states is whether they enable fault-tolerant measurement-based quantum computation. The answer is yes. Initial squeezing in the cluster above a threshold value of 20.5 dB ensures that errors from finite squeezing acting on encoded qubits are below the fault-tolerance threshold of known qubit-based error-correcting codes. By concatenating with one of these codes and using ancilla-based error correction, fault-tolerant measurement-based quantum computation of theoretically indefinite length is possible with finitely squeeze…
We analyze the accuracy of quantum phase gates acting on "0-$π$ qubits" in superconducting circuits, where the gates are protected against thermal and Hamiltonian noise by continuous-variable quantum error-correcting codes. The gates are executed by turning on and off a tunable Josephson coupling between an $LC$ oscillator and a qubit or pair of quits; assuming perfect qubits, we show that the gate errors are exponentially small when the oscillator's impedance $\sqrt{L/C}$ is large compared to $\hbar/4e^2 \approx 1\, kΩ$. The protected gates are not computationally universal by themselves, but…
Performing active quantum error correction to protect fragile quantum states highly depends on the correctness of error information--error syndromes. To obtain reliable error syndromes using imperfect physical circuits, we propose the idea of quantum data-syndrome (DS) codes that are capable of correcting both data qubits and syndrome bits errors. We study fundamental properties of quantum DS codes, including split weight enumerators, generalized MacWilliams identities, and linear programming bounds. In particular, we derive Singleton and Hamming-type upper bounds on degenerate quantum DS code…
Discovery of Optimal Quantum Error Correcting Codes via Reinforcement Learning
Center for Theoretical Physics & Department of Physics, University of California, Berkeley, CA 94720, USA（加州大学伯克利分校理论物理中心及物理系）；Joint Center for Quantum Information and Computer Science, University of Maryland, College Park, MD, 20742, USA（马里兰大学量子信息与计算机科学联合中心）；Institute for Quantum Information and Matter, California Institute of Technology, Pasadena, CA, 91125, USA（加州理工学院量子信息与物质研究所）；Department of Physics, Virginia Tech, Blacksburg, VA, 24060, USA（弗吉尼亚理工学院物理系）；Department of Physics, University of California San Diego, La Jolla, CA 92093, USA（加州大学圣地亚哥分校物理系）；Department of Physics, Harvard University, 17 Oxford Street, Cambridge, MA 02138, USA（哈佛大学物理系）；Harvard Quantum Initiative, Harvard University, 17 Oxford Street, Cambridge, MA 02138, USA（哈佛大学量子倡议）；Laboratory for Physical Sciences, 8050 Greenmead Dr., College Park, MD 20740, USA（物理科学实验室）；Department of Physics, Brandeis University, Waltham, Massachusetts 02453, USA（布兰迪大学物理系）
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 understood as a combination of Pauli operators acting on the system. Each quantum error correcting code allows a subset of these errors to be corrected. In many situations the noise is such that the remaining uncorrectable errors are unlikely to arise, and hence quantum error correction has a high probability of success. In order to achieve the best noise to…
Fawzi and Renner [Commun. Math. Phys. 340(2):575, 2015] recently established a lower bound on the conditional quantum mutual information (CQMI) of tripartite quantum states $ABC$ in terms of the fidelity of recovery (FoR), i.e. the maximal fidelity of the state $ABC$ with a state reconstructed from its marginal $BC$ by acting only on the $C$ system. The FoR measures quantum correlations by the local recoverability of global states and has many properties similar to the CQMI. Here we generalize the FoR and show that the resulting measure is multiplicative by utilizing semi-definite programming …
It is reasonable to expect the theory of quantum codes to be simplified in the case of codes of minimum distance 2; thus, it makes sense to examine such codes in the hopes that techniques that prove effective there will generalize. With this in mind, we present a number of results on codes of minimum distance 2. We first compute the linear programming bound on the dimension of such a code, then show that this bound can only be attained when the code either is of even length, or is of length 3 or 5. We next consider questions of uniqueness, showing that the optimal code of length 2 or 4 is uniq…
In a recent paper [quant-ph/9610040], Shor and Laflamme define two ``weight enumerators'' for quantum error correcting codes, connected by a MacWilliams transform, and use them to give a linear-programming bound for quantum codes. We extend their work by introducing another enumerator, based on the classical theory of shadow codes, that tightens their bounds significantly. In particular, nearly all of the codes known to be optimal among additive quantum codes (codes derived from orthogonal geometry ([quant-ph/9608006])) can be shown to be optimal among all quantum codes. We also use the shadow…
For a positive integer $k$, the rank-$k$ numerical range $Λ_k(A)$ of an operator $A$ acting on a Hilbert space $\cH$ of dimension at least $k$ is the set of scalars $λ$ such that $PAP = λP$ for some rank $k$ orthogonal projection $P$. In this paper, a close connection between low rank perturbation of an operator $A$ and $Λ_k(A)$ is established. In particular, for $1 \le r < k$ it is shown that $Λ_k(A) \subseteq Λ_{k-r}(A+F)$ for any operator $F$ with $\rank (F) \le r$. In quantum computing, this result implies that a quantum channel with a $k$-dimensional error correcting code under a perturba…
Entanglement purification protocols (EPP) and quantum error-correcting codes (QECC) provide two ways of protecting quantum states from interaction with the environment. In an EPP, perfectly entangled pure states are extracted, with some yield D, from a mixed state M shared by two parties; with a QECC, an arbi- trary quantum state $|ξ\rangle$ can be transmitted at some rate Q through a noisy channel $χ$ without degradation. We prove that an EPP involving one- way classical communication and acting on mixed state $\hat{M}(χ)$ (obtained by sharing halves of EPR pairs through a channel $χ$) yields…
Monolithic Quantum Error Correction in the Presence of Distinguishability
Joint Center for Quantum Information and Computer Science, NIST/University of Maryland（量子信息与计算机科学联合中心，美国国家标准与技术研究院/马里兰大学）；Center for Quantum Science and Engineering, Department of Physics & Astronomy, University of California Los Angeles（加州大学洛杉矶分校物理与天文学系量子科学与工程中心）；Department of Physics & Astronomy, University of California Los Angeles（加州大学洛杉矶分校物理与天文学系）；Joint Quantum Institute, NIST/University of Maryland（美国国家标准与技术研究院/马里兰大学联合量子研究所）
Mixed-state Quantum Phases: Renormalization and Quantum Error Correction
Perimeter Institute for Theoretical Physics（Perimeter理论物理研究所）；Department of Physics and Astronomy, University of Waterloo（滑铁卢大学物理与天文系）；Kavli Institute for Theoretical Physics, University of California, Santa Barbara（加州大学圣塔芭芭拉分校卡弗里理论物理研究所）；Stanford Institute for Theoretical Physics（斯坦福理论物理研究所）
