Logical Reversibility and Physical Reversibility in Quantum Measurement
Masahito Ueda
备注：
9pages, LaTex, Invited lecture presented at the Int. Conf. on Frontiers in Quantum Physics (Kuala Lumpur, Malaysia, 9-11 July, 1997) to be published from Springer-Verlag, e-mail: mueda@ipc.hiroshima-u.ac.jp
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 in quantum computation.
Four types of photon counters are discussed in terms of information, fidelity, and physical reversibility: conventional photon counter, quantum counter, and their quantum nondemolition (QND) versions. It is shown that when a photon field to be measured is in an arbitrary superposition of vacuum and one-photon states, the quantum counter is the most reversible, the QND version of conventional photon counter provides the most information, and the QND version of quantum counter causes the smallest state change. Our results suggest that the physical reversibility of a counter tends to decrease the…
We argue that if, in order to reverse an object's dynamics, we need to be able to keep track of it with enough precision, then there is an upper bound on the size of the object whose dynamics we can reverse - even using all the available resources of the universe. Using a bound from the holographic principle and treating the universe as the ultimate quantum computer, we show that if we want to reverse the dynamics of an object which has evolved since the beginning of time, its radius cannot exceed ten microns. If this computation is performed irreversibly, the object must be much smaller. This…
There is a constraining relation between the reliability of a quantum measurement and the extent to which the measurement process is, in principle, reversible. The greater the information that is gained, the less reversible the measurement dynamics become. To illustrate this relation, we develop a simple physical model for quantum measurement, as well as a hypothetical scheme by which the experimenters can determine the reliability and reversibility. We derive an "uncertainty" (constraining) relation between reliability and reversibility, which holds even when there is no interaction with any …
Similarly to quantum states, quantum operations can also be transformed by means of quantum superchannels, also known as process matrices. Quantum superchannels with multiple slots are deterministic transformations whichtake independent quantum operations as inputs. While they are enforced to respect the laws of quantum mechanics, the use of input operations may lack a definite causal order, and characterizations of general superchannels in terms of quantum objects with a physical implementation have been missing. In this paper, we provide a mathematical characterization for pure superchannels…
We investigate the class of physical theories with the same local structure as quantum theory, but a potentially different global structure. It has previously been shown that any bipartite correlations generated by such a theory must be simulatable in quantum theory, but that this does not hold for tripartite correlations. Here we explore whether imposing an additional constraint on this space of theories - that of dynamical reversibility - will allow us to recover the global quantum structure. In the particular case in which the local systems are identical qubits, we show that any theory admi…
We investigate the robustness of the microscopic reversibility in open quantum systems which is discussed by Monnai [arXiv:1106.1982 (2011)]. We derive an exact relation between the forward transition probability and the reversed transition probability in the case of a general measurement basis. We show that the microscopic reversibility acquires some corrections in general and discuss the physical meaning of the corrections. Under certain processes, some of the correction terms vanish and we numerically confirmed that the remaining correction term becomes negligible; the microscopic reversibi…
The discussion on time-reversal in quantum mechanics exists at least since Wigner's ``Uber die Operation der Zeitumkehr in der Quantenmechanik'' paper in 1932. If and how the dynamics of the quantum world is time-reversible has been the subject of many controversies. Some have seen quantum mechanics as fundamentally time-irreversible, see for example von Neumann, and some have seen in that the ultimate cause of time's arrow and second law behavior. In his best-selling book ``The Emperor's New Mind'', Roger Penrose argues similarly and concludes that ``our sought-for quantum gravity must be a t…
This article is an attempt to generalize the classical theory of reversible computing, principally developed by Bennet [IBM J. Res. Develop., 17(1973)] and by Fredkin and Toffoli [Internat. J. Theoret. Phys., 21(1982)], to the quantum case. This is a fundamental step towards the construction of a quantum computer because a time efficient quantum computation is a reversible physical process. The paper is organized as follows. The first section reviews the classical theory of reversible computing. In the second section it is showed that the designs used in the classical framework to decrease the…
Hybrid physical/logical zero-noise extrapolation with limited logical executions
Dukhov Research Institute of Automatics (VNIIA)（杜霍夫自动控制系统研究所）；Moscow Institute of Physics and Technology（莫斯科物理技术学院）；Institute for Theoretical and Applied Electrodynamics, Russian Academy of Sciences（俄罗斯科学院理论与应用电动力学研究所）
Extrapolating physical error rates to logical error rates requires many assumptions and thus can radically under- or overestimate the performance of an error correction implementation. We introduce logical randomized benchmarking, a characterization procedure that directly assesses the performance of a quantum error correction implementation at the logical level, and is motivated by a reduction to the well-studied case of physical randomized benchmarking. We show that our method reliably reports logical performance and can estimate the average probability of correctable and uncorrectable error…
Future miniaturization and mobilization of computing devices requires energy parsimonious `adiabatic' computation. This is contingent on logical reversibility of computation. An example is the idea of quantum computations which are reversible except for the irreversible observation steps. We propose to study quantitatively the exchange of computational resources like time and space for irreversibility in computations. Reversible simulations of irreversible computations are memory intensive. Such (polynomial time) simulations are analysed here in terms of `reversible' pebble games. We show that…
In a recent work [S. Asthana. New Journal of Physics 24.5 (2022): 053026], we have shown the interrelation of different nonclassical correlations in multiqubit systems with quantum coherence in a single logical qubit. In this work, we generalize it to higher-dimensional systems. For this, we take different choices of logical qudits and logical continuous-variable (cv) systems in terms of their constituent physical qudits and physical cv systems. Thereafter, we show reciprocity between conditions for coherence (in logical qudits and logical cv systems) and conditions for nonlocality and entangl…
We investigate the statistical arrow of time for a quantum system being monitored by a sequence of measurements. For a continuous qubit measurement example, we demonstrate that time-reversed evolution is always physically possible, provided that the measurement record is also negated. Despite this restoration of dynamical reversibility, a statistical arrow of time emerges, and may be quantified by the log-likelihood difference between forward and backward propagation hypotheses. We then show that such reversibility is a universal feature of non-projective measurements, with forward or backward…
There are several inequalities in physics which limit how well we can process physical systems to achieve some intended goal, including the second law of thermodynamics, entropy bounds in quantum information theory, and the uncertainty principle of quantum mechanics. Recent results provide physically meaningful enhancements of these limiting statements, determining how well one can attempt to reverse an irreversible process. In this paper, we apply and extend these results to give strong enhancements to several entropy inequalities, having to do with entropy gain, information gain, entropic di…
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…
In a digital quantum simulator, basic two-qubit interactions are manipulated by means of fast local control operations to establish a desired target Hamiltonian. Here we consider a quantum simulator based on logical systems, i.e. where several physical qubits are used to represent a single logical two-level system to obtain enhanced and simple control over effective interactions between logical systems. Fixed, distance-dependent pairwise interactions between the physical qubits lead to effective interactions between the logical systems, which can be fully controlled solely by the choice of the…
The method of complementary channel for analysis of reversibility (sufficiency) of a quantum channel with respect to families of input states (pure states for the most part) are considered and applied to Bosonic linear (quasi-free) channels, in particular, to Bosonic Gaussian channels. The obtained reversibility conditions for Bosonic linear channels have clear physical interpretation and their sufficiency is also shown by explicit construction of reversing channels. The method of complementary channel gives possibility to prove necessity of these conditions and to describe all reversed famili…
Quantum error correction is an essential tool for reliably performing tasks for processing quantum information on a large scale. However, integration into quantum circuits to achieve these tasks is problematic when one realizes that non-transverse operations, which are essential for universal quantum computation, lead to the spread of errors. Quantum gate teleportation has been proposed as an elegant solution for this. Here, one replaces these fragile, non-transverse inline gates with the generation of specific, highly entangled offline resource states that can be teleported into the circuit t…
Logical qubit encoding and quantum error correction (QEC) have been experimentally demonstrated in various physical systems with multiple physical qubits, however, logical operations are challenging due to the necessary nonlocal operations. Alternatively, logical qubits with bosonic-mode-encoding are of particular interest because their QEC protection is hardware efficient, but gate operations on QEC protected logical qubits remain elusive. Here, we experimentally demonstrate full control on a single logical qubit with a binomial bosonic code, including encoding, decoding, repetitive QEC, and …
Quantum error correction procedures have the potential to enable faithful operation of large-scale quantum computers. They protect information from environmental decoherence by storing it in logical qubits, built from ensembles of entangled physical qubits according to suitably tailored quantum error correcting encodings. To date, no generally accepted framework to characterise the behaviour of logical qubits as quantum memories has been developed. In this work, we show that generalisations of well-established figures of merit of physical qubits, such as relaxation times, to logical qubits fai…
Stabilization of encoded logical qubits using quantum error correction is key to the realization of reliable quantum computers. While qubit codes require many physical systems to be controlled, oscillator codes offer the possibility to perform error correction on a single physical entity. One powerful encoding for oscillators is the grid state or GKP encoding, which allows small displacement errors to be corrected. Here we introduce and implement a dissipative map designed for physically realistic finite GKP codes which performs quantum error correction of a logical qubit implemented in the mo…
Leading idea of this manuscript is to discuss the structure and the deep correlations among different quantum physical systems, and to explore how such correlations bear on the capacity of the systems to encode and manipulate information. In particular, the role of logical operators constructed out of multi-boson (and possibly fractionary-boson) operators is analyzed in its relation on the one hand with the algebra of diffeomorphisms of the circle, on the other with the physical properties of the fractional quantum Hall effect (described in terms of Laughlin states) and of its many electron re…
We propose two protocols to encode a logical qubit into physical qubits relying on common types of qubit-qubit interactions in as simple forms as possible. We comment on its experimental implementation in several quantum computing architectures, e.g. with trapped atomic ion qubits, atomic qubits inside a high Q optical cavity, solid state Josephson junction qubits, and Bose-Einstein condensed atoms.
We discuss two methods to encode one qubit into six physical qubits. Each of our two examples corrects an arbitrary single-qubit error. Our first example is a degenerate six-qubit quantum error-correcting code. We explicitly provide the stabilizer generators, encoding circuit, codewords, logical Pauli operators, and logical CNOT operator for this code. We also show how to convert this code into a non-trivial subsystem code that saturates the subsystem Singleton bound. We then prove that a six-qubit code without entanglement assistance cannot simultaneously possess a Calderbank-Shor-Steane (CSS…
To date, a great deal of attention has focused on characterizing the performance of quantum error correcting codes via their thresholds, the maximum correctable physical error rate for a given noise model and decoding strategy. Practical quantum computers will necessarily operate below these thresholds meaning that other performance indicators become important. In this work we consider the scaling of the logical error rate of the toric code and demonstrate how, in turn, this may be used to calculate a key performance indicator. We use a perfect matching decoding algorithm to find the scaling o…
We show how the efficiency of a logical Bell measurement (BM) can be calculated for arbitrary CSS codes with the experimentally important constraint of using only transversal static linear-optical BMs on the physical single-photon qubit level. For this purpose, we utilize the codes' description in terms of stabilizers in order to calculate general efficiencies for the loss-free case, but also for specific cases including photon loss. These efficiencies can be, for instance, used for obtaining transmission rates of all-optical quantum repeaters. In the loss-free case, we demonstrate that the im…
We describe a fault-tolerant memory for an error-corrected logical qubit based on silicon double quantum dot physical qubits. Our design accounts for constraints imposed by supporting classical electronics. A significant consequence of the constraints is to add error-prone idle steps for the physical qubits. Even using a schedule with provably minimum idle time, for our noise model and choice of error-correction code, we find that these additional idles negate any benefits of error correction. Using additional qubit operations, we can greatly suppress idle-induced errors, making error correcti…
The most peculiar, specifically quantum, features of quantum mechanics --- quantum nonlocality, indeterminism, interference of probabilities, quantization, wave function collapse during measurement --- are explained on a logical-geometrical basis. It is shown that truths of logical statements about numerical values of quantum observables are quantum observables themselves and are represented in quantum mechanics by density matrices of pure states. Structurally, quantum mechanics is a result of applying non-Abelian symmetries to truth operators and their eigenvectors --- wave functions. Wave fu…
We improve the planar honeycomb code by describing boundaries that need no additional physical connectivity, and by optimizing the shape of the qubit patch. We then benchmark the code using Monte Carlo sampling to estimate logical error rates and derive metrics including thresholds, lambdas, and teraquop qubit counts. We determine that the planar honeycomb code can create a logical qubit with one-in-a-trillion logical error rates using 7000 physical qubits at a 0.1% gate-level error rate (or 900 physical qubits given native two-qubit parity measurements). Our results cement the honeycomb code …
An important approach to the fault-tolerant quantum computation is protecting the logical information using the quantum error correction. Usually, the logical information is in the form of logical qubits, which are encoded in physical qubits using quantum error correction codes. Compared with the qubit quantum computation, the fermionic quantum computation has advantages in quantum simulations of fermionic systems, e.g. molecules. In this paper, we show that the fermionic quantum computation can be universal and fault-tolerant if we encode logical Majorana fermions in physical Majorana fermion…
The resource theory of thermal operations, an established model for small-scale thermodynamics, provides an extension of equilibrium thermodynamics to nonequilibrium situations. On a lattice of any dimension with any translation-invariant local Hamiltonian, we identify a large set of translation-invariant states that can be reversibly converted to and from the thermal state with thermal operations and a small amount of coherence. These are the spatially ergodic states, i.e., states that have sharp statistics for any translation-invariant observable, and mixtures of such states with the same th…
Resource consumption of the conventional surface code is expensive, in part due to the need to separate the defects that create the logical qubit far apart on the physical qubit lattice. We propose that instantiating the deformation-based surface code using superstabilizers makes it possible to detect short error chains connecting the superstabilizers, allowing us to place logical qubits close together. Additionally, we demonstrate the process of conversion from the defect-based surface code, which works as arbitrary state injection, and a lattice surgery-like CNOT gate implementation that req…
Geometric quantum computation offers a practical strategy toward robust quantum computation due to its inherently error tolerance. However, the rigorous geometric conditions lead to complex and/or error-disturbed quantum controls, especially for logical qubits that involve more physical qubits, whose error tolerance is effective in principle though, their experimental demonstration is still demanding. Thus, how to best simplify the needed control and manifest its full advantage has become the key to widespread applications of geometric quantum computation. Here we propose a new fast and robust…
Fault-tolerant quantum error correction (QEC) is crucial for unlocking the true power of quantum computers. QEC codes use multiple physical qubits to encode a logical qubit, which is protected against errors at the physical qubit level. Here we use a trapped ion system to experimentally prepare $m$-qubit GHZ states and sample the measurement results to construct $m\times m$ logical states of the $[[m^2,1,m]]$ Shor code, up to $m=7$. The synthetic logical fidelity shows how deeper encoding can compensate for additional gate errors in state preparation for larger logical states. However, the opt…
A quantum error correction (QEC) code uses $N_{\rm c}$ quantum bits to construct one "logical" quantum bits of better quality than the original "physical" ones. QEC theory predicts that the failure probability $p_L$ of logical qubits decreases exponentially with $N_{\rm c}$ provided the failure probability $p$ of the physical qubit is below a certain threshold $p<p_{\rm th}$. In particular QEC theorems imply that the logical qubits can be made arbitrarily precise by simply increasing $N_{\rm c}$. In this letter, we search for physical mechanisms that lie outside of the hypothesis of QEC theore…
We study effects of the physical realization of quantum computers on their logical operation. Through simulation of physical models of quantum computer hardware, we analyze the difficulties that are encountered in programming physical realizations of quantum computers. Examples of logically identical implementations of the controlled-NOT operation and Grover's database search algorithm are used to demonstrate that the results of a quantum computation are unstable with respect to the physical realization of the quantum computer. We discuss the origin of these instabilities and discuss possibili…
