Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1003.1150

Approximate Quantum Error Correction via Complementary Observables

Joseph M. Renes

Published Mar 4, 2010• 11 citations
arXivHTMLPDF

Abstract

The breakthrough of quantum error correction brought with it the picture of quantum information as a sort of combination of two complementary types of classical information, "amplitude" and "phase". Here I show how this intuition can be used to construct two new conditions for approximate quantum error correction. The first states that entanglement is locally recoverable from a bipartite state when one system can be used to approximately predict the outcomes of two complementary observables on the other. The second, more in the spirit of the recent decoupling approach, states that entanglement is locally recoverable when the environment cannot reliably predict either.

DOI
10.48550/arxiv.1003.1150

Related papers

Uncertainty relations and approximate quantum error correction

Joseph M. Renes

The uncertainty principle can be understood as constraining the probability of winning a game in which Alice measures one of two conjugate observables, such as position or momentum, on a system provided by Bob, and he is to guess the outcome. Two variants are possible: either Alice tells Bob which observable she measured, or he has to furnish guesses for both cases. Here I derive uncertainty relations for both, formulated directly in terms of Bob's guessing probabilities. For the former these relate to the entanglement that can be recovered by action on Bob's system alone. This gives an explicit quantum circuit for approximate quantum error correction using the guessing measurements for ``amplitude'' and ``phase'' information, implicitly used in the recent construction of efficient quantum polar codes. I also find a relation on the guessing probabilities for the latter game, which has application to wave-particle duality relations.

arXiv:1605.01420•Physical Review A•Sep 14, 2016•14 citations

Emerging Paradigms in Quantum Error Correction and Quantum Cryptography

Prabha Mandayam Doddamane

We study two novel paradigms in quantum error correction and quantum cryptography — approximate quantum error correction and noisy-storage cryptography — which explore alternate approaches for dealing with quantum noise. Approximate quantum error correction seeks to relax the constraint of perfect error correction and construct codes that might be better adapted to correct for specific noise models. Noisy-storage cryptography relies on the power of quantum noise to execute two-party cryptographic tasks securely. Motivated by examples of approximately correcting codes, which make use of fewer physical resources than perfect codes and still obtain comparable levels of fidelity, we study the problem of finding and characterizing such codes in general. We construct for the first time a universal, near-optimal recovery map for approximate quantum error correction (AQEC), with optimality defined in terms of worst-case fidelity. Using the analytical form of this recovery, we also obtain easily verifiable conditions for AQEC. This in turn leads to a simple algorithm for identifying good approximate codes, without having to perform a difficult optimization over all recovery maps for every possible encoding. Noisy-storage cryptography envisions a setting where two-party cryptographic protocols can be securely implemented based solely on the assumption that the quantum storage device possessed by either party is noisy and bounded. Here, we construct two-party protocols (using higher-dimensional states) that are secure even when a dishonest player can store all but a small fraction of the information transmitted during the protocol, in his noiseless quantum memory. We also show that when his memory is noisy, security can be extended to a larger class of noisy quantum memories. Our result demonstrates that the physical limits of the quantum noisy-storage model are indeed achievable, albeit asymptotically. We also describe our investigations on obtaining strong entropic uncertainty relations using symmetric complementary bases. Uncertainty relations are an important and useful resource in analyzing the security of quantum cryptographic protocols, in addition to being of interest from a foundational standpoint. We present a novel construction of sets of symmetric, complementary bases in dimension d = 2n, which are cyclically permuted under the action of a unitary transformation. We also obtain new lower bounds for uncertainty relations in terms of the min-entropy, which are tight for specific instances of our construction.

•Jun 1, 2011•0 citations

Applications of Entanglement in Quantum Information

Nada Ali

Entanglement is the resource that most sharply distinguishes quantum information processing from its classical counterpart, and this thesis examines it from two complementary directions: how it can be detected and quantified, and how it, together with the broader machinery of quantum correlations, interference, and measurement, can be put to use. We first study two simple, measurable conditions that detect bipartite entanglement, and show that the extent to which either is violated yields a lower bound on the negativity of a state. The bound is established for two qubits, extended to systems of arbitrary finite dimension, and sharpened when partial knowledge of the Schmidt vectors is available. We then turn to discrete-outcome quantum sensor networks, in which one seeks only to determine which detectors, or which group or spatial pattern of detectors, has responded to a signal. Working in the weak-interaction regime, where the output states are nonorthogonal, we use minimum-error and unambiguous state discrimination to show that entangled initial states and collective measurements confer an advantage when detectors are grouped, and we develop a shift-operator formalism that gives closed-form success probabilities for the detection of shifted patterns in one- and two-dimensional arrays. Next we consider the problem of learning two unknown pure qubit states, together with their probabilities of occurrence, from a scrambled stream; we show that receiving the systems in identically prepared pairs supplies exactly the extra quantum information needed, since the resulting two-qubit state in the symmetric subspace has a unique decomposition into pure product states, which we recover by tomography. Finally, we show how interference and measurement can convert information encoded in the phases of quantum amplitudes into information encoded in their magnitudes, amplifying the amplitudes that carry useful information and suppressing those that do not, and we apply this technique to states produced by the quantum approximate optimization algorithm for the MaxCut and minimum-vertex-cover problems. Throughout, a single theme recurs: the correlations and superpositions permitted by quantum mechanics are at once something to be measured and something to be exploited.

•Sep 1, 2026•0 citations

Approximate simulation of quantum channels

Cédric Bény, Ognyan Oreshkov

Earlier, we proved a duality between two optimizations problems [Phys. Rev. Lett. 104, 120501 (2010)]. The primary one is, given two quantum channels $\mathcal{M}$ and $\mathcal{N}$, to find a quantum channel $\mathcal{R}$ such that $\mathcal{R}\ensuremath{\circ}\mathcal{N}$ is optimally close to $\mathcal{M}$ as measured by the worst-case entanglement fidelity. The dual problem involves the information obtained by the environment through the so-called complementary channels $\stackrel{\ifmmode \hat{}\else \^{}\fi{}}{\mathcal{M}}$ and $\stackrel{\ifmmode \hat{}\else \^{}\fi{}}{\mathcal{N}}$, and consists in finding a quantum channel ${\mathcal{R}}^{\ensuremath{'}}$ such that ${\mathcal{R}}^{\ensuremath{'}}\ensuremath{\circ}\stackrel{\ifmmode \hat{}\else \^{}\fi{}}{\mathcal{M}}$ is optimally close to $\stackrel{\ifmmode \hat{}\else \^{}\fi{}}{\mathcal{N}}$. It turns out to be easier to find an approximate solution to the dual problem in certain important situations, notably when $\mathcal{M}$ is the identity channel---the problem of quantum error correction---yielding a good near-optimal worst-case entanglement fidelity as well as the corresponding near-optimal correcting channel. Here we provide more detailed proofs of these results. In addition, we generalize the main theorem to the case where there are certain constraints on the implementation of $\mathcal{R}$, namely, on the number of Kraus operators. We also offer a simple algebraic form for the near-optimal correction channel in the case $\mathcal{M}=\mathrm{id}$. For approximate error correction, we show that any $\ensuremath{\varepsilon}$-correctable channel is, up to appending an ancilla, $\ensuremath{\varepsilon}$-close to an exactly correctable one. We also demonstrate an application of our theorem to the problem of minimax state discrimination.

arXiv:1103.0649•Physical Review A•Aug 25, 2011•31 citations

Quantum Error Correction Networks via Complementary Information Encoding

Jincheng Zhang

This paper investigates a novel approach to quantum error correction within a network architecture, termed complementary information encoding. The core claim is that by utilizing complementary encoding strategies leveraging quantum entanglement, it's possible to achieve non-local error correction, moving beyond the limitations of purely local, neighboring-node correction schemes. The proposed mechanism involves designing an encoding protocol that distributes redundant information across the network via quantum entanglement, significantly expanding the coverage and efficiency of the error correction process. This approach fundamentally shifts from local reliance to global error detection, inherently increasing the network's overall error tolerance. We detail the mathematical framework and theoretical considerations underpinning this new strategy, focusing on the key parameters influencing its performance. The presented method offers a potentially more robust and scalable solution for quantum information transmission and storage compared to conventional local error correction techniques.

•Sep 5, 2026•0 citations

Approximate Quantum Error Correction at Chiral Topological Edges

Yuntai Song, Zejun Liu, Zhencheng Wang +2 more

Topologically ordered phases naturally realize quantum error correction through nonlocal encoding of quantum information. More recently, conformal field theories have been shown to realize approximate quantum error-correcting codes, but such constructions generally require fine tuning to criticality. Here we introduce a family of approximate quantum error-correcting codes realized by the chiral edges of two-dimensional topologically ordered phases. The proposed encoding combines the robustness of a gapped topological bulk with the flexibility of gapless edge conformal field theories. To characterize its robustness, we study coherent-information loss under local erasure. We derive an exact expression relating coherent-information loss to relative entropy, reducing the recoverability problem to universal properties of the edge theory. This leads to power-law scaling of coherent-information loss with the size of the erased region. We further show that, for geometrically local erasures near one edge, the two-dimensional chiral edge code is at least as robust as the dimensionally reduced CFT code, and is strictly more robust in several representative examples. For Abelian code subspaces, we further construct a power-law-range recovery map supported on the erased region together with a power-law-range buffer; this recovery map depends only on the code subspace, not on the unknown encoded state. We provide numerical calculations for lattice realizations of compact free boson and Ising CFT examples that support the theoretical predictions of the power-law exponents.

quant-pharXiv:2608.06258•Aug 7, 2026•0 citations
The breakthrough of quantum error correction brought with it the picture of quantum information as a sort of combination of two complementary types of classical information, "amplitude" and "phase". Here I show how this intuition can be used to construct two new conditions for approximate quantum error correction. The first states that entanglement is locally recoverable from a bipartite state when one system can be used to approximately predict the outcomes of two complementary observables on the other. The second, more in the spirit of the recent decoupling approach, states that entanglement is locally recoverable when the environment cannot reliably predict either.
The uncertainty principle can be understood as constraining the probability of winning a game in which Alice measures one of two conjugate observables, such as position or momentum, on a system provided by Bob, and he is to guess the outcome. Two variants are possible: either Alice tells Bob which observable she measured, or he has to furnish guesses for both cases. Here I derive uncertainty relations for both, formulated directly in terms of Bob's guessing probabilities. For the former these relate to the entanglement that can be recovered by action on Bob's system alone. This gives an explicit quantum circuit for approximate quantum error correction using the guessing measurements for ``amplitude'' and ``phase'' information, implicitly used in the recent construction of efficient quantum polar codes. I also find a relation on the guessing probabilities for the latter game, which has application to wave-particle duality relations.
We study two novel paradigms in quantum error correction and quantum cryptography — approximate quantum error correction and noisy-storage cryptography — which explore alternate approaches for dealing with quantum noise. Approximate quantum error correction seeks to relax the constraint of perfect error correction and construct codes that might be better adapted to correct for specific noise models. Noisy-storage cryptography relies on the power of quantum noise to execute two-party cryptographic tasks securely. Motivated by examples of approximately correcting codes, which make use of fewer physical resources than perfect codes and still obtain comparable levels of fidelity, we study the problem of finding and characterizing such codes in general. We construct for the first time a universal, near-optimal recovery map for approximate quantum error correction (AQEC), with optimality defined in terms of worst-case fidelity. Using the analytical form of this recovery, we also obtain easily verifiable conditions for AQEC. This in turn leads to a simple algorithm for identifying good approximate codes, without having to perform a difficult optimization over all recovery maps for every possible encoding. Noisy-storage cryptography envisions a setting where two-party cryptographic protocols can be securely implemented based solely on the assumption that the quantum storage device possessed by either party is noisy and bounded. Here, we construct two-party protocols (using higher-dimensional states) that are secure even when a dishonest player can store all but a small fraction of the information transmitted during the protocol, in his noiseless quantum memory. We also show that when his memory is noisy, security can be extended to a larger class of noisy quantum memories. Our result demonstrates that the physical limits of the quantum noisy-storage model are indeed achievable, albeit asymptotically. We also describe our investigations on obtaining strong entropic uncertainty relations using symmetric complementary bases. Uncertainty relations are an important and useful resource in analyzing the security of quantum cryptographic protocols, in addition to being of interest from a foundational standpoint. We present a novel construction of sets of symmetric, complementary bases in dimension d = 2n, which are cyclically permuted under the action of a unitary transformation. We also obtain new lower bounds for uncertainty relations in terms of the min-entropy, which are tight for specific instances of our construction.
Entanglement is the resource that most sharply distinguishes quantum information processing from its classical counterpart, and this thesis examines it from two complementary directions: how it can be detected and quantified, and how it, together with the broader machinery of quantum correlations, interference, and measurement, can be put to use. We first study two simple, measurable conditions that detect bipartite entanglement, and show that the extent to which either is violated yields a lower bound on the negativity of a state. The bound is established for two qubits, extended to systems of arbitrary finite dimension, and sharpened when partial knowledge of the Schmidt vectors is available. We then turn to discrete-outcome quantum sensor networks, in which one seeks only to determine which detectors, or which group or spatial pattern of detectors, has responded to a signal. Working in the weak-interaction regime, where the output states are nonorthogonal, we use minimum-error and unambiguous state discrimination to show that entangled initial states and collective measurements confer an advantage when detectors are grouped, and we develop a shift-operator formalism that gives closed-form success probabilities for the detection of shifted patterns in one- and two-dimensional arrays. Next we consider the problem of learning two unknown pure qubit states, together with their probabilities of occurrence, from a scrambled stream; we show that receiving the systems in identically prepared pairs supplies exactly the extra quantum information needed, since the resulting two-qubit state in the symmetric subspace has a unique decomposition into pure product states, which we recover by tomography. Finally, we show how interference and measurement can convert information encoded in the phases of quantum amplitudes into information encoded in their magnitudes, amplifying the amplitudes that carry useful information and suppressing those that do not, and we apply this technique to states produced by the quantum approximate optimization algorithm for the MaxCut and minimum-vertex-cover problems. Throughout, a single theme recurs: the correlations and superpositions permitted by quantum mechanics are at once something to be measured and something to be exploited.
Earlier, we proved a duality between two optimizations problems [Phys. Rev. Lett. 104, 120501 (2010)]. The primary one is, given two quantum channels M\mathcal{M}M and N\mathcal{N}N, to find a quantum channel R\mathcal{R}R such that $\mathcal{R}\ensuremath{\circ}\mathcal{N}$ is optimally close to M\mathcal{M}M as measured by the worst-case entanglement fidelity. The dual problem involves the information obtained by the environment through the so-called complementary channels $\stackrel{\ifmmode \hat{}\else \^{}\fi{}}{\mathcal{M}}$ and $\stackrel{\ifmmode \hat{}\else \^{}\fi{}}{\mathcal{N}}$, and consists in finding a quantum channel ${\mathcal{R}}^{\ensuremath{'}}$ such that ${\mathcal{R}}^{\ensuremath{'}}\ensuremath{\circ}\stackrel{\ifmmode \hat{}\else \^{}\fi{}}{\mathcal{M}}$ is optimally close to $\stackrel{\ifmmode \hat{}\else \^{}\fi{}}{\mathcal{N}}$. It turns out to be easier to find an approximate solution to the dual problem in certain important situations, notably when M\mathcal{M}M is the identity channel---the problem of quantum error correction---yielding a good near-optimal worst-case entanglement fidelity as well as the corresponding near-optimal correcting channel. Here we provide more detailed proofs of these results. In addition, we generalize the main theorem to the case where there are certain constraints on the implementation of R\mathcal{R}R, namely, on the number of Kraus operators. We also offer a simple algebraic form for the near-optimal correction channel in the case M=id\mathcal{M}=\mathrm{id}M=id. For approximate error correction, we show that any $\ensuremath{\varepsilon}$-correctable channel is, up to appending an ancilla, $\ensuremath{\varepsilon}$-close to an exactly correctable one. We also demonstrate an application of our theorem to the problem of minimax state discrimination.
This paper investigates a novel approach to quantum error correction within a network architecture, termed complementary information encoding. The core claim is that by utilizing complementary encoding strategies leveraging quantum entanglement, it's possible to achieve non-local error correction, moving beyond the limitations of purely local, neighboring-node correction schemes. The proposed mechanism involves designing an encoding protocol that distributes redundant information across the network via quantum entanglement, significantly expanding the coverage and efficiency of the error correction process. This approach fundamentally shifts from local reliance to global error detection, inherently increasing the network's overall error tolerance. We detail the mathematical framework and theoretical considerations underpinning this new strategy, focusing on the key parameters influencing its performance. The presented method offers a potentially more robust and scalable solution for quantum information transmission and storage compared to conventional local error correction techniques.
Topologically ordered phases naturally realize quantum error correction through nonlocal encoding of quantum information. More recently, conformal field theories have been shown to realize approximate quantum error-correcting codes, but such constructions generally require fine tuning to criticality. Here we introduce a family of approximate quantum error-correcting codes realized by the chiral edges of two-dimensional topologically ordered phases. The proposed encoding combines the robustness of a gapped topological bulk with the flexibility of gapless edge conformal field theories. To characterize its robustness, we study coherent-information loss under local erasure. We derive an exact expression relating coherent-information loss to relative entropy, reducing the recoverability problem to universal properties of the edge theory. This leads to power-law scaling of coherent-information loss with the size of the erased region. We further show that, for geometrically local erasures near one edge, the two-dimensional chiral edge code is at least as robust as the dimensionally reduced CFT code, and is strictly more robust in several representative examples. For Abelian code subspaces, we further construct a power-law-range recovery map supported on the erased region together with a power-law-range buffer; this recovery map depends only on the code subspace, not on the unknown encoded state. We provide numerical calculations for lattice realizations of compact free boson and Ising CFT examples that support the theoretical predictions of the power-law exponents.