Quantum Error Correction and Reversible Operations
Carlton M. Caves
备注：
Paper based on a talk presented at the International Workshop on Macroscopic Quantum Tunneling and Coherence, Naples, Italy, June 10-13, 1998; to be published in Superconductivity; 17 pages, no figures, LaTeX
I give a pedagogical account of Shor's nine-bit code for correcting arbitrary errors on single qubits, and I review work that determines when it is possible to maintain quantum coherence by reversing the deleterious effects of open-system quantum dynamics. The review provides an opportunity to introduce an efficient formalism for handling superoperators. I present and prove some bounds on entanglement fidelity, which might prove useful in analyses of approximate error correction.
Quantum operations provide a general description of the state changes allowed by quantum mechanics. Simple necessary and sufficient conditions for an ideal quantum operation to be reversible by a unitary operation are derived in this paper. These results generalize recent work on reversible measurements by Mabuchi and Zoller [Phys. Rev. Lett. {\bf 76}, 3108 (1996)]. Quantum teleportation can be understood as a special case of the problem of reversing quantum operations. We characterize completely teleportation schemes of the type proposed by Bennett {\it et al.} [Phys. Rev. Lett. {\bf 70}, 189…
Quantum operations provide a general description of the state changes allowed by quantum mechanics. The reversal of quantum operations is important for quantum error-correcting codes, teleportation, and reversing quantum measurements. We derive information-theoretic conditions and equivalent algebraic conditions that are necessary and sufficient for a general quantum operation to be reversible. We analyze the thermodynamic cost of error correction and show that error correction can be regarded as a kind of ``Maxwell demon,'' for which there is an entropy cost associated with information obtain…
Landauer's principle asserts that any computation has an unavoidable energy cost that grows proportionally to its degree of logical irreversibility. But even a logically reversible operation, when run on a physical processor that operates on different energy levels, requires energy. Here we quantify this energy requirement, providing upper and lower bounds that coincide up to a constant factor. We derive these bounds from a general quantum resource-theoretic argument, which implies that the initial resource requirement for implementing a unitary operation within an error~$ε$ grows like $1/\sqr…
Reversible algorithms play a crucial role both in classical and quantum computation. While for a classical bit the only nontrivial reversible operation is the bit-flip, nature is far more versatile in what it allows to do to a quantum bit. The reversible operations that a quantum computer can perform on a qubit are group of linear unitary transformations. However, laws of quantum mechanics prohibit implementation of anti-linear anti-unitary gates, even though they are perfectly reversible. Here we show that such a restriction on possible set of reversible operations is, remarkably, a fundament…
It has long been known that to minimise the heat emitted by a deterministic computer during it's operation it is necessary to make the computation act in a logically reversible manner\cite{Lan61}. Such logically reversible operations require a number of auxiliary bits to be stored, maintaining a history of the computation, and which allows the initial state to be reconstructed by running the computation in reverse. These auxiliary bits are wasteful of resources and may require a dissipation of energy for them to be reused. A simple procedure due to Bennett\cite{Ben73} allows these auxiliary bi…
We show how to perform reversible universal quantum computation on a translationally invariant pure state, using only global operations based on next-neighbor interactions. We do not need not to break the translational symmetry of the state at any time during the computation. Since the proposed scheme fulfills the locality condition of a quantum cellular automata, we present a reversible quantum cellular automaton capable of universal quantum computation.
We present a complete classification of all possible sets of classical reversible gates acting on bits, in terms of which reversible transformations they generate, assuming swaps and ancilla bits are available for free. Our classification can be seen as the reversible-computing analogue of Post's lattice, a central result in mathematical logic from the 1940s. It is a step toward the ambitious goal of classifying all possible quantum gate sets acting on qubits. Our theorem implies a linear-time algorithm (which we have implemented), that takes as input the truth tables of reversible gates G and…
A reversible logic has application in quantum computing. A reversible logic design needs resources such as ancilla and garbage qubits to reconfigure circuit functions or gate functions. The removal of garbage qubits and ancilla qubits are essential in designing an efficient quantum circuit. In the literature, there are multiple designs that have been proposed for a reversible multiplication operation. A multiplication hardware is essential for the circuit design of quantum algorithms, quantum cryptanalysis, and digital signal processing (DSP) applications. The existing designs of reversible qu…
General relativity allows for the existence of closed time-like curves, along which a material object could travel back in time and interact with its past self. This possibility raises the question whether certain initial conditions, or more generally local operations, lead to inconsistencies and should thus be forbidden. Here we consider the most general deterministic dynamics connecting classical degrees of freedom defined on a set of bounded space-time regions, requiring that it is compatible with arbitrary operations performed in the local regions. We find that any such dynamics can be rea…
We experimentally demonstrate phase-insensitive linear optical amplification which preserves the idler at the output. Since our amplification operation is unitary up to small excess noise, it is reversible beyond the classical limit. The entanglement between the two output modes is the resource for the reversibility. The amplification gain of 2.0 is demonstrated. In addition, combining this amplifier with a beamsplitter, we also demonstrate approximate cloning of coherent states where an anticlone is present. We investigate the reversibility by reconstructing the initial state from the output …
A remarkable feature of quantum theory is non-locality (i.e. the presence of correlations which violate Bell inequalities). However, quantum correlations are not maximally non-local, and it is natural to ask whether there are compelling reasons for rejecting theories in which stronger violations are possible. To shed light on this question, we consider post-quantum theories in which maximally non-local states (non-local boxes) occur. It has previously been conjectured that the set of dynamical transformations possible in such theories is severely limited. We settle the question affirmatively i…
Twenty-one characterizations of reversible quantum channels
State Key Laboratory of Mathematical Sciences, Academy of Mathematics and Systems Science, Chinese Academy of Sciences（中国科学院数学与系统科学研究院数学科学重点实验室）；School of Mathematical Sciences, University of Chinese Academy of Sciences（中国科学院大学数学科学学院）；School of Mathematics and Statistics, Shaanxi Normal University（陕西师范大学数学与统计学院）
We consider the manipulation of multipartite entangled states in the limit of many copies under quantum operations that asymptotically cannot generate entanglement. As announced in [Brandao and Plenio, Nature Physics 4, 8 (2008)], and in stark contrast to the manipulation of entanglement under local operations and classical communication, the entanglement shared by two or more parties can be reversibly interconverted in this setting. The unique entanglement measure is identified as the regularized relative entropy of entanglement, which is shown to be equal to a regularized and smoothed versio…
Collective behavior where a set of elements interact and generate effects that are beyond the reach of the individual non interacting elements, are always of great interest in physics. Quantum collective effects that have no classical analogue are even more intriguing. In this work we show how to construct collective quantum heat machines and explore their performance boosts with respect to regular machines. Without interactions between the machines the individual units operate in a stochastic, non-quantum manner. The construction of the collective machine becomes possible by introducing two s…
Our main models of computation (the Turing Machine and the RAM) make fundamental assumptions about which primitive operations are realizable. The consensus is that these include logical operations like conjunction, disjunction and negation, as well as reading and writing to memory locations. This perspective conforms to a macro-level view of physics and indeed these operations are realizable using macro-level devices involving thousands of electrons. This point of view is however incompatible with quantum mechanics, or even elementary thermodynamics, as both imply that information is a conserv…
A quantum measurement is logically reversible if the premeasurement density operator of the measured system can be calculated from the postmeasurement density operator and from the outcome of the measurement. This paper analyzes why many quantum measurements are logically irreversible, shows how to make them logically reversible, and discusses reversing measurement that returns the postmeasurement state to the premeasurement state by another measurement (physical reversibility). Reversing measurement and unitarily reversible quantum operation are compared from the viewpoint of error correction…
Based on the modelling of quantum systems with the aid of (classical) non-equilibrium thermodynamics, both the emergence and the collapse of the superposition principle are understood within one and the same framework. Both are shown to depend in crucial ways on whether or not an average orthogonality is maintained between reversible Schroedinger dynamics and irreversible processes of diffusion. Moreover, said orthogonality is already in full operation when dealing with a single free Gaussian wave packet. In an application, the quantum mechanical "decay of the wave packet" is shown to simply r…
Proposed below is a reversible digital computer modeled after the natural behavior of a quantum system. Using approaches usually reserved for idealized quantum computers, the Reversible CAM, or State Vector Parallel (RSVP) processor can easily find keywords in an unstructured database (that is, it can solve a needle in a haystack problem). The RSVP processor efficiently solves a SAT (Satisfiability of Boolean Formulae) problem; also it can aid in the solution of a GP (Global Properties of Truth Table) problem. The power delay product of the RSVP processor is exponentially lower than that of a …
Consider two quantum systems A and B interacting according to a product Hamiltonian H = H_A x H_B. We show that any two such Hamiltonians can be used to simulate each other reversibly (i.e., without efficiency losses) with the help of local unitary operations and local ancillas. Accordingly, all non-local features of a product Hamiltonian -- including the rate at which it can be used to produce entanglement, transmit classical or quantum information, or simulate other Hamiltonians -- depend only upon a single parameter. We identify this parameter and use it to obtain an explicit expression for…
We define quantum cellular automata as infinite quantum lattice systems with discrete time dynamics, such that the time step commutes with lattice translations and has strictly finite propagation speed. In contrast to earlier definitions this allows us to give an explicit characterization of all local rules generating such automata. The same local rules also generate the global time step for automata with periodic boundary conditions. Our main structure theorem asserts that any quantum cellular automaton is structurally reversible, i.e., that it can be obtained by applying two blockwise unitar…
Quantum computers require quantum arithmetic. We provide an explicit construction of quantum networks effecting basic arithmetic operations: from addition to modular exponentiation. Quantum modular exponentiation seems to be the most difficult (time and space consuming) part of Shor's quantum factorising algorithm. We show that the auxiliary memory required to perform this operation in a reversible way grows linearly with the size of the number to be factorised.
We study the entanglement cost under quantum operations preserving the positivity of the partial transpose (PPT-operations). We demonstrate that this cost is directly related to the logarithmic negativity, thereby providing the operational interpretation for this easily computable entanglement measure. As examples we discuss general Werner states and arbitrary bi-partite Gaussian states. Equipped with this result we then prove that for the anti-symmetric Werner state PPT-cost and PPT-entanglement of distillation coincide giving the first example of a truly mixed state for which entanglement ma…
We investigate the irreversibility of entanglement distillation for a symmetric d-1 parameter family of mixed bipartite quantum states acting on Hilbert spaces of arbitrary dimension d x d. We prove that in this family the entanglement cost is generically strictly larger than the distillable entanglement, such that the set of states for which the distillation process is asymptotically reversible is of measure zero. This remains true even if the distillation process is catalytically assisted by pure state entanglement and every operation is allowed, which preserves the positivity of the partial…
Quantum computers require quantum processors. An important part of the processor of any computer is the arithmetic unit, which performs binary addition, subtraction, division and multiplication, however multiplication can be performed using repeated addition, while division can be performed using repeated subtraction. In this paper we present two designs using the reversible $R^3$ gate to perform the quantum half adder/ subtractor and the quantum full adder/subtractor. The proposed half adder/subtractor design can be used to perform different logical operations, such as $AND$, $XOR$, $NAND$, $…
We give the logical description of a new kind of quantum measurement that is a reversible operation performed by an hypothetical insider observer, or, which is the same, a quantum measurement made in a quantum space background, like the fuzzy sphere. The result is that the non-contradiction and the excluded middle principles are both invalidated, leading to a paraconsistent, symmetric logic. Our conjecture is that, in this setting, one can develop the adequate logic of quantum computing. The role of standard quantum logic is then confined to describe the projective measurement scheme.
We propose a quantum error correction without error detection. A quantum state $ρ_0$ combined with an ancilla state $σ$ is encoded unitarily and an error operator is applied on the encoded state. The recovery operation then produces a tensor product state $ρ_0 \otimes σ'$. The decoding operation is combined with the recovery operation and the state $ρ_0$ is directly reproduced without referring to the code word. A higher rank projection operator required for a conventional operator quantum error correction is not necessary to implement. Encoding and the recovery operations are implemented with…
We present a class of numerical algorithms which adapt a quantum error correction scheme to a channel model. Given an encoding and a channel model, it was previously shown that the quantum operation that maximizes the average entanglement fidelity may be calculated by a semidefinite program (SDP), which is a convex optimization. While optimal, this recovery operation is computationally difficult for long codes. Furthermore, the optimal recovery operation has no structure beyond the completely positive trace preserving (CPTP) constraint. We derive methods to generate structured channel-adapted …
In many experiments on microscopic quantum systems, it is implicitly assumed that when a macroscopic procedure or "instruction" is repeated many times -- perhaps in different contexts -- each application results in the same microscopic quantum operation. But in practice, the microscopic effect of a single macroscopic instruction can easily depend on its context. If undetected, this can lead to unexpected behavior and unreliable results. Here, we design and analyze several tests to detect context-dependence. They are based on invariants of matrix products, and while they can be as data intensiv…
Fault-tolerant quantum computing demands many qubits with long lifetimes to conduct accurate quantum gate operations. However, external noise limits the computing time of physical qubits. Quantum error correction codes may extend such limits, but imperfect gate operations introduce errors to the correction procedure as well. The additional gate operations required due to the physical layout of qubits exacerbate the situation. Here, we use density-matrix simulations to investigate the performance change of logical qubits according to quantum error correction codes and qubit layouts and the expe…
An explicit algorithm for performing Schumacher's noiseless compression of quantum bits is given. This algorithm is based on a combinatorial expression for a particular bijection among binary strings. The algorithm, which adheres to the rules of reversible programming, is expressed in a high-level pseudocode language. It is implemented using $O(n^3)$ two- and three-bit primitive reversible operations, where $n$ is the length of the qubit strings to be compressed. Also, the algorithm makes use of $O(n)$ auxiliary qubits; however, space-saving techniques based on those proposed by Bennett are de…
Classical engines turn thermal resources into work, which is maximized for reversible operations. The quantum realm has expanded the range of useful operations beyond energy conversion, and incoherent resources beyond thermal reservoirs. This is the case of entanglement generation in a driven-dissipative protocol, which we hereby analyze as a continuous quantum machine. We show that for such machines the more irreversible the process the larger the concurrence. Maximal concurrence and entropy production are reached for the hot reservoir being at negative effective temperature, beating the limi…
Large-scale universal quantum computing requires the implementation of quantum error correction (QEC). While the implementation of QEC has already been demonstrated for quantum memories, reliable quantum computing requires also the application of nontrivial logical gate operations to the encoded qubits. Here, we present examples of such operations by implementing, in addition to the identity operation, the NOT and the Hadamard gate to a logical qubit encoded in a five qubit system that allows correction of arbitrary single qubit errors. We perform quantum process tomography of the encoded gate…
Integer arithmetic is the underpinning of many quantum algorithms, with applications ranging from Shor's algorithm over HHL for matrix inversion to Hamiltonian simulation algorithms. A basic objective is to keep the required resources to implement arithmetic as low as possible. This applies in particular to the number of qubits required in the implementation as for the foreseeable future this number is expected to be small. We present a reversible circuit for integer multiplication that is inspired by Karatsuba's recursive method. The main improvement over circuits that have been previously re…
Quantum memory management is becoming a pressing problem, especially given the recent research effort to develop new and more complex quantum algorithms. The only existing automatic method for quantum states clean-up relies on the availability of many extra resources. In this work, we propose an automatic tool for quantum memory management. We show how this problem exactly matches the reversible pebbling game. Based on that, we develop a SAT-based algorithm that returns a valid clean-up strategy, taking the limitations of the quantum hardware into account. The developed tool empowers the desig…
We study the corrections to adiabatic dynamics of two coupled quantum dot spin-qubits, each dot singly occupied with an electron, in the context of a quantum computing operation. Tunneling causes double occupancy at the conclusion of an operation and constitutes a processing error. We model the gate operation with an effective two-level system, where non-adiabatic transitions correspond to double occupancy. The model is integrable and possesses three independent parameters. We confirm the accuracy of Dykhne's formula, a nonperturbative estimate of transitions, and discuss physically intuitive …
We establish that, in an appropriate limit, qubits of communication should be regarded as composite resources, decomposing cleanly into independent correlation and transmission components. Because qubits of communication can establish ebits of entanglement, qubits are more powerful resources than ebits. We identify a new communications resource, the zero-bit, which is precisely half the gap between them, replacing classical bits by zero-bits makes teleportation asymptotically reversible. The decomposition of a qubit into an ebit and two zero-bits has wide-ranging consequences including applica…
Reversible work extraction from identical quantum systems via collective operations was shown to be possible even without producing entanglement among the sub-parts. Here, we show that implementing such global operations necessarily imply the creation of quantum correlations, as measured by quantum discord. We also reanalyze the conditions under which global transformations outperform local gates as far as maximal work extraction is considered by deriving a necessary and sufficient condition that is based on classical correlations.
Continuous and Reversible Electrical Tuning of Fluorescent Decay Rate via Fano Resonance
Bilkent University（比尔肯特大学）；UNAM- National Nanotechnology Research Center and Institute of Materials Science and Nanotechnology, Bilkent University（比尔肯特大学国家纳米技术研究与应用中心和材料科学与纳米技术研究所）；Middle East Technical University（中东理工大学）；Akdeniz University（安塔利亚大学）；Türkiye National Observatories, TUG（土耳其国家天文台）；Institute of Nuclear Sciences, Hacettepe University（哈杰泰佩大学核科学研究所）
