Entanglement measures and approximate quantum error correction
Francesco Buscemi
备注：
7 pages, two-columned revtex4, no figures. v1: Deeply revised and extended version: different entanglement measures are separately considered, references are added, and some remarks are stressed. v2: Added a sufficient condition for distillability in terms of entanglement of formation; published version
It is shown that, if the loss of entanglement along a quantum channel is sufficiently small, then approximate quantum error correction is possible, thereby generalizing what happens for coherent information. Explicit bounds are obtained for the entanglement of formation and the distillable entanglement, and their validity naturally extends to other bipartite entanglement measures in between. Robustness of derived criteria is analyzed and their tightness compared. Finally, as a byproduct, we prove a bound quantifying how large the gap between entanglement of formation and distillable entanglement can be for any given finite dimensional bipartite system, thus providing a sufficient condition for distillability in terms of entanglement of formation.
Dissipation may cause two initially entangled qubits to evolve into a separable state in a finite time. This behavior is called entanglement sudden death (ESD). We study to what extent quantum error correction can combat ESD. We find that in some cases quantum error correction can delay entanglement sudden death but in other cases quantum error correction may cause ESD for states that otherwise do not suffer from it. Our analysis also shows that fidelity may not be the best measure to compare the efficiency of different error correction codes since the fidelity is not directly coupled to a sta…
Two new expressions for the entanglement fidelity recently introduced by Schumacher (LANL e-print quant-ph/9604023, to appear in Phys. Rev. A) are derived. These expressions show that it is the entanglement fidelity which must be maximized when performing error correction on qubits for quantum computers, not the fidelity, which is the most-often used generalization of the probability for storing a qubit correctly.
We investigate the effects of error correction on non-local quantum coherence as a function of time, extending the study by Sainz and Björk. We consider error correction of amplitude damping, pure phase damping and combinations of amplitude and phase damping as they affect both fidelity and quantum entanglement. Initial two-qubit entanglement is encoded in arbitrary real superpositions of both Φ-type and Ψ-type Bell states. Our main focus is on the possibility of delay or prevention of ESD (early stage decoherence, or entanglement sudden death). We obtain the onset times for ESD as a function …
We construct a theory of continuous-variable entanglement-assisted quantum error correction. We present an example of a continuous-variable entanglement-assisted code that corrects for an arbitrary single-mode error. We also show how to implement encoding circuits using passive optical devices, homodyne measurements, feedforward classical communication, conditional displacements, and off-line squeezers.
Classical and quantum error correction are presented in the form of Maxwell's demon and their efficiency analyzed from the thermodynamic point of view. We explain how Landauer's principle of information erasure applies to both cases. By then extending this principle to entanglement manipulations we rederive upper bounds on purification procedures thereby linking the ''no local increase of entanglement'' principle to the Second Law of thermodynamics.
We give a review on entanglement purification for bipartite and multipartite quantum states, with the main focus on theoretical work carried out by our group in the last couple of years. We discuss entanglement purification in the context of quantum communication, where we emphasize its close relation to quantum error correction. Various bipartite and multipartite entanglement purification protocols are discussed, and their performance under idealized and realistic conditions is studied. Several applications of entanglement purification in quantum communication and computation are presented, w…
We study the possibility of preventing finite-time disentanglement caused by dissipation by making use of "non-local quantum error correction. This is made in comparison of previous results, where was shown that "local" quantum error correction can delay disentanglement, but can also cause entanglement sudden death when is not originally present.
In this paper I explore the entanglement evolution of qubits that are part of a five qubit quantum error correction code subject to various decohering environments. Specifically, I look for possible parallels between the entanglement degradation and the fidelity of the logical qubit of quantum information stored in the physical qubits. In addition, I note the possible exhibition of entanglement sudden death (ESD) due to decoherence and question whether ESD is actually a roadblock to successful quantum computation.
Entanglement of a quantum system depends upon relative phase in complicated ways, which no single measurement can reflect. Because of this, entanglement witnesses are necessarily limited in applicability and/or utility. We propose here a solution to the problem using quantum neural networks. A quantum system contains the information of its entanglement; thus, if we are clever, we can extract that information efficiently. As proof of concept, we show how this can be done for the case of pure states of a two-qubit system, using an entanglement indicator corrected for the anomalous phase oscillat…
We present two economical one-step error-correction protocols for multipartite polarization-entangled systems in a Greenberger-Horne-Zeilinger state. One uses spatial entanglement to correct errors in the polarization entanglement of an N-photon system, resorting to linear optical elements. The other uses frequency entanglement to correct errors in the polarization entanglement of an N-photon system. The parties in quantum communication can obtain a maximally entangled state from each N-photon system transmitted with one step in these two protocols, and both of their success probabilities are …
In this article we study the role that quantum resources play in quantum error correction assisted quantum metrology (QECQM) schemes. We show that there exist classes of such problems where entanglement is not necessary to retrieve noise free evolution and Heisenberg scaling in the long time limit. Over short time scales, noise free evolution is also possible even without any form of quantum correlations. In particular, for qubit probes, we show that whenever noise free quantum metrology is possible via QECQM, entanglement free schemes over long time scales and correlation free schemes over sh…
Entanglement-assisted quantum error-correcting codes (EAQECCs) make use of pre-existing entanglement between the sender and receiver to boost the rate of transmission. It is possible to construct an EAQECC from any classical linear code, unlike standard QECCs which can only be constructed from dual-containing codes. Operator quantum error-correcting codes (OQECCs) allow certain errors to be corrected (or prevented) passively, reducing the complexity of the correction procedure. We combine these two extensions of standard quantum error correction into a unified entanglement-assisted quantum err…
The task of preserving entanglement against noises is of crucial importance for both quantum communication and quantum information transfer. To this aim, quantum error correction (QEC) codes may be employed to compensate, at least partially, the detriments induced by environmental noise that can be modelled as a bit-flip or a phase-flip error channel. In this paper we investigate the effects of the simple three-qubit QEC codes to restore entanglement and nonlocality in a two-qubit system and consider two practical applications: superdense coding and quantum teleportation. Though the considered…
In this dissertation, I present a general method for studying quantum error correction codes (QECCs). This method not only provides us an intuitive way of understanding QECCs, but also leads to several extensions of standard QECCs, including the operator quantum error correction (OQECC), the entanglement-assisted quantum error correction (EAQECC). Furthermore, we can combine both OQECC and EAQECC into a unified formalism, the entanglement-assisted operator formalism. This provides great flexibility of designing QECCs for different applications. Finally, I show that the performance of quantum l…
Unified and Generalized Approach to Entanglement-Assisted Quantum Error Correction
Xanadu；Department of Mathematics & Statistics, University of Guelph（圭尔夫大学数学与统计系）；Perimeter Institute for Theoretical Physics（理论物理珀米特研究所）；Institute for Quantum Computing, University of Waterloo（滑铁卢大学量子计算研究所）
By interpreting the well-known, qualitative criteria for the existence of quantum error correction (QEC) codes by Knill and Laflamme from a quantitative perspective, we propose a figure of merit for assessing a QEC scheme based on the average fidelity between codewords. This enables us to quantify the performance of a protocol as a whole, including errors beyond the correctable set. Various examples are calculated for photonic qubit codes dealing with the experimentally relevant case of photon loss, demonstrating the advantages of the new measure. In the context of continuous-variable QEC, our…
The squashed entanglement is a fundamental entanglement measure in quantum information theory, finding application as an upper bound on the distillable secret key or distillable entanglement of a quantum state or a quantum channel. This paper simplifies proofs that the squashed entanglement is an upper bound on distillable key for finite-dimensional quantum systems and solidifies such proofs for infinite-dimensional quantum systems. More specifically, this paper establishes that the logarithm of the dimension of the key system (call it $\log_{2}K$) in an $\varepsilon$-approximate private state…
We analyze the effect of a quantum error correcting code on the entanglement of encoded logical qubits in the presence of a dephasing interaction with a correlated environment. Such correlated reservoir introduces entanglement between physical qubits. We show that for short times the quantum error correction interprets such entanglement as errors and suppresses it. However for longer time, although quantum error correction is no longer able to correct errors, it enhances the rate of entanglement production due to the interaction with the environment.
We analyze approximate transformations of pure entangled quantum states by local operations and classical communication, finding explicit conversion strategies which optimize the fidelity of transformation. These results allow us to determine the most faithful teleportation strategy via an initially shared partially entangled pure state. They also show that procedures for entanglement manipulation such as entanglement catalysis [Jonathan and Plenio, Phys. Rev. Lett. 83, 3566 (1999)] are robust against perturbation of the states involved, and motivate the notion of non-local fidelity, which qua…
We introduce and analyze graph-associated entanglement cost, a generalization of the entanglement cost of quantum states to multipartite settings. We identify a necessary and sufficient condition for any multipartite entangled state to be constructible when quantum communication between the multiple parties is restricted to a quantum network represented by a tree. The condition for exact state construction is expressed in terms of the Schmidt ranks of the state defined with respect to edges of the tree. We also study approximate state construction and provide a second-order asymptotic analysis…
Variational quantum algorithms constitute one of the most widespread methods for using current noisy quantum computers. However, it is unknown if these heuristic algorithms provide any quantum-computational speedup, although we cannot simulate them classically for intermediate sizes. Since entanglement lies at the core of quantum computing power, we investigate its role in these heuristic methods for solving optimization problems. In particular, we use matrix product states to simulate the quantum approximate optimization algorithm with reduced bond dimensions $D$, a parameter bounding the sys…
Known quantum error correction schemes are typically able to take advantage of only a limited class of classical error-correcting codes. Entanglement-assisted quantum error correction is a partial solution which made it possible to exploit any classical linear codes over the binary or quaternary finite field. However, the known entanglement-assisted scheme requires noiseless qubits that help correct quantum errors on noisy qubits, which can be too severe an assumption. We prove that a more relaxed and realistic assumption is sufficient by presenting encoding and decoding operations assisted by…
We present a multipartite entanglement purification scheme in a Greenberger-Horne-Zeilinger state for electrons based on their spins and their charges. This scheme works for purification with two steps, i.e., bit-flipping error correction and phase-error flip error correction. By repeating these two steps, the parties in quantum communication can get some high-fidelity multipartite entangled electronic systems.
Consider a stabilizer state on $n$ qudits, each of dimension $D$ with $D$ being a prime or a squarefree integer, divided into three mutually disjoint sets or parts. Generalizing a result of Bravyi et al. [J. Math. Phys. \textbf{47}, 062106 (2006)] for qubits (D=2), we show that up to local unitaries on the three parts the state can be written as a tensor product of unentangled single-qudit states, maximally entangled EPR pairs, and tripartite GHZ states. We employ this result to obtain a complete characterization of the properties of a class of channels associated with stabilizer error-correct…
Stabilizer states constitute a set of pure states which plays a dominant role in quantum error correction, measurement--based quantum computation, and quantum communication. Central in these applications are the local symmetries of these states. We characterize all local symmetries of arbitrary stabilizer states and provide an algorithm which determines them. We demonstrate the usefulness of these results by showing that the additional local symmetries find applications in entanglement theory and quantum error correction.
In this letter, we propose a method of dark count correction in quantum state tomography of entangled photon pairs. The framework is based on a linear model of dark counts, which is imposed on the measurement formalism. The method is tested on empirical data derived from an experiment on polarization-entangled photons. We demonstrate that the numerical approach to dark count correction guarantees more reliable state reconstruction compared with standard estimation. Most importantly, however, the conceptually simple theoretical approach proves to be more efficient at entanglement quantification…
Quantum error correction protects the quantum state against noise and decoherence in quantum communication and quantum computation, which enables one to perform fault-torrent quantum information processing. We experimentally demonstrate a quantum error correction scheme with a five-wave-packet code against a single stochastic error, the original theoretical model of which is firstly proposed by S. L. Braunstein and T. A. Walker. Five submodes of a continuous variable cluster entangled state of light are used for five encoding channels. Especially, in our encoding scheme the information of the …
We show that quantum designs characterize the general structure of the optimal approximation of the transpose map on quantum states. Based on this characterization, we propose an implementation of the approximate transpose map by a measurement-and-preparation scheme. The results show that state-manipulation in quantum two-designs suffices for transpose-based quantu3 information applications. In particular, we present how these results can be applied to the framework of detecting multipartite entangled states, for instance, when local measurements or interferometry-based experimental approaches…
We propose and prove an existential theorem for entanglement-assisted asymmetric quantum error correction. Then we demonstrate its superiority over the conventional one.
Many quantum algorithms seek to output a specific bitstring solving the problem of interest--or a few if the solution is degenerate. It is the case for the quantum approximate optimization algorithm (QAOA) in the limit of large circuit depth, which aims to solve quadratic unconstrained binary optimization problems. Hence, the expected final state for these algorithms is either a product state or a low-entangled superposition involving a few bitstrings. What happens in between the initial $N$-qubit product state $\vert 0\rangle^{\otimes N}$ and the final one regarding entanglement? Here, we con…
We study the problem of deterministic transformations of an \textit{initial} pure entangled quantum state, $|ψ\rangle$, into a \textit{target} pure entangled quantum state, $|ϕ\rangle$, by using \textit{local operations and classical communication} (LOCC). A celebrated result of Nielsen [Phys. Rev. Lett. \textbf{83}, 436 (1999)] gives the necessary and sufficient condition that makes this entanglement transformation process possible. Indeed, this process can be achieved if and only if the majorization relation $ψ\prec ϕ$ holds, where $ψ$ and $ϕ$ are probability vectors obtained by taking the s…
Ensuring the correct functioning of quantum error correction (QEC) circuits is crucial to achieve fault tolerance in realistic quantum processors subjected to noise. The first checkpoint for a fully operational QEC circuit is to create genuine multipartite entanglement across all subsystems of physical qubits. We introduce a conditional witnessing technique to certify genuine multipartite entanglement (GME) that is efficient in the number of subsystems and, importantly, robust against experimental noise and imperfections. Specifically, we prove that the detection of entanglement in a linear nu…
We investigate entanglement production by inhomogeneous perturbations over a homogeneous and isotropic cosmic background, demonstrating that the interplay between quantum and geometric effects can have relevant consequences on entanglement entropy, with respect to homogeneous scenarios. To do so, we focus on a conformally coupled scalar field and discuss how geometric production of scalar particles leads to entanglement. Perturbatively, at first order we find oscillations in entropy correction, whereas at second order the underlying geometry induces mode-mixing on entanglement production. We t…
We analyze the finite size corrections to entanglement in quantum critical systems. By using conformal symmetry and density functional theory, we discuss the structure of the finite size contributions to a general measure of ground state entanglement, which are ruled by the central charge of the underlying conformal field theory. More generally, we show that all conformal towers formed by an infinite number of excited states (as the size of the system $L \to \infty$) exhibit a unique pattern of entanglement, which differ only at leading order $(1/L)^2$. In this case, entanglement is also shown…
In this talk, we focus on the corrections to Bekenstein-Hawking entropy by associating it with the entanglement between degrees of freedom inside and outside the horizon. Using numerical techniques, we show that the corrections proportional to fractional power of area result when the field is in a superposition of ground and excited states. We explain this result by identifying that the degrees of freedom contributing to such corrections are different from those contributing to Bekenstein-Hawking entropy.
Quantum error-correcting codes will be the ultimate enabler of a future quantum computing or quantum communication device. This theory forms the cornerstone of practical quantum information theory. We provide several contributions to the theory of quantum error correction--mainly to the theory of "entanglement-assisted" quantum error correction where the sender and receiver share entanglement in the form of entangled bits (ebits) before quantum communication begins. Our first contribution is an algorithm for encoding and decoding an entanglement-assisted quantum block code. We then give severa…
When a multi-qubit state evolves under local unitaries it may obtain a geometric phase, a feature dependent on the geometry of the state's projective Hilbert space. A correction term to this geometric phase in addition to the local subsystem phases may appear from correlations between the subsystems. We find this correction term can be characterized completely either by the entanglement or completely by the classical correlations for several classes of entangled state. States belonging to the former set are W states and their mixtures, while members of the latter set are cluster states, GHZ st…
Mass-correction-induced enhancement of quantum correlations even beyond entanglement in the $e^{+}e^{-} \rightarrow J/ψ\rightarrow Λ(pπ^{-}) \barΛ(\bar{p}π^{+})$ process at the BESIII experiment under memory effects
Gaussian channels are the typical way to model the decoherence introduced by the environment in continuous-variable quantum states. It is known that those channels can be simulated by a teleportation protocol using as a resource state either a maximally entangled state passing through the same channel, i.e., the Choi-state, or a state that is entangled at least as much as the Choi-state. Since the construction of the Choi-state requires infinite mean energy and entanglement, i.e. it is unphysical, we derive instead every physical state able to simulate a given channel through teleportation wit…
Using convex optimization, we propose entanglement-assisted quantum error correction procedures that are optimized for given noise channels. We demonstrate through numerical examples that such an optimized error correction method achieves higher channel fidelities than existing methods. This improved performance, which leads to perfect error correction for a larger class of error channels, is interpreted in at least some cases by quantum teleportation, but for general channels this interpretation does not hold.
Contrary to the assumption that most quantum error-correcting codes (QECC) make, it is expected that phase errors are much more likely than bit errors in physical devices. By employing the entanglement-assisted stabilizer formalism, we develop a new kind of error-correcting protocol which can flexibly trade error correction abilities between the two types of errors, such that high error correction performance is achieved both in symmetric and in asymmetric situations. The characteristics of the QECCs can be optimized in an adaptive manner during information transmission. The proposed entanglem…
The correction to the area law for the bipartite min-entanglement entropy of weakly and locally interacting fermions is calculated based on a perturbative extension of the flow equation holography method. Explicit calculations for the one- and two-dimensional case (and similarly for higher dimensions) show that the leading correction to the entanglement entropy of non-interacting fermions up to $U^2$ in the interaction strength does not change the scaling, but only affects the pre-factor of the leading logarithmic term multiplying it by the quasiparticle residue. A term sub-leading to the area…
We consider 2D networks composed of nodes initially linked by two-qubit mixed states. In these networks we develop a global error correction scheme that can generate distance-independent entanglement from arbitrary network geometries using rank two states. By using this method and combining it with the concept of percolation we also show that the generation of long distance entanglement is possible with rank three states. Entanglement percolation and global error correction have different advantages depending on the given situation. To reveal the trade-off between them we consider their applic…
Entanglement renormalization can be viewed as an encoding circuit for a family of approximate quantum error correcting codes. The logical information becomes progressively more well-protected against erasure errors at larger length scales. In particular, an approximate variant of holographic quantum error correcting code emerges at low energy for critical systems. This implies that two operators that are largely separated in scales behave as if they are spatially separated operators, in the sense that they obey a Lieb-Robinson type locality bound under a time evolution generated bya local Hami…
We investigate the scaling of entanglement entropy in both the multi-scale entanglement renormalization ansatz (MERA) and in its generalization, the branching MERA. We provide analytical upper bounds for this scaling, which take the general form of a boundary law with various types of multiplicative corrections, including power-law corrections all the way to a bulk law. For several cases of interest, we also provide numerical results that indicate that these upper bounds are saturated to leading order. In particular we establish that, by a suitable choice of holographic tree, the branching MER…
We investigate measurement-based quantum communication with noisy resource states that are generated by entanglement purification. We consider the transmission of encoded information via noisy quantum channels using a measurement-based implementation of encoding, error correction and decoding. We show that such an approach offers advantages over direct transmission, gate-based error correction and measurement-based schemes with direct generation of resource states. We analyze the noise structure of resource states generated by entanglement purification and show that a local error model, i.e. n…
We examine quantum gravity effects on entanglement by a straightforward application of the generalized uncertainty principle (GUP) to continuous-variable systems. In particular, we study the following cases: the modified uncertainty relation of two identical entangled particles (Rigolin, 2002), and the inseparability conditions for entangled particles in the bipartite (Duan, Giedke, Cirac and Zoller, 2000) and tripartite (van Loock and Furusawa, 2003) cases. Rigolin showed a decrease in the lower bound of the product of the uncertainties of the position and momentum for two identical entangled…
We consider single interval Rényi and entanglement entropies for a two dimensional conformal field theory on a circle at nonzero temperature. Assuming that the finite size of the system introduces a unique ground state with a nonzero mass gap, we calculate the leading corrections to the Rényi and entanglement entropy in a low temperature expansion. These corrections have a universal form for any two dimensional conformal field theory that depends only on the size of the mass gap and its degeneracy. We analyze the limits where the size of the interval becomes small and where it becomes close to…
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 show that for any $\varepsilon>0$ there is an XOR game $G=G(\varepsilon)$ with $Θ(\varepsilon^{-1/5})$ inputs for one player and $Θ(\varepsilon^{-2/5})$ inputs for the other player such that $Ω(\varepsilon^{-1/5})$ ebits are required for any strategy achieving bias that is at least a multiplicative factor $(1-\varepsilon)$ from optimal. This gives an exponential improvement in both the number of inputs or outputs and the noise tolerance of any previously-known self-test for highly entangled states. Up to the exponent $-1/5$ the scaling of our bound with $\varepsilon$ is tight: for any XOR g…
