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.4994 · IEEE Transactions on Information Theory

Weak Decoupling Duality and Quantum Identification

Patrick M. Hayden, Andreas Winter

Published Mar 23, 2012• 41 citations
arXivHTMLPDF

Abstract

If a quantum system is subject to noise, it is possible to perform quantum error correction reversing the action of the noise if and only if no information about the system's quantum state leaks to the environment. In this paper, we develop an analogous duality in the case that the environment approximately forgets the identity of the quantum state, a weaker condition satisfied by -randomizing maps and approximate unitary designs. Specifically, we show that the environment approximately forgets quantum states if and only if the original channel approximately preserves pairwise fidelities of pure inputs, an observation we call weak decoupling duality. Using this tool, we then go on to study the task of using the output of a channel to simulate restricted classes of measurements on a space of input states. The case of simulating measurements that test whether the input state is an arbitrary pure state is known as equality testing or quantum identification. An immediate consequence of weak decoupling duality is that the ability to perform quantum identification cannot be cloned. We, furthermore, establish that the optimal amortized rate at which quantum states can be identified through a noisy quantum channel is equal to the entanglement-assisted classical capacity of the channel, despite the fact that the task is quantum, not classical, and entanglement-assistance is not allowed. In particular, this rate is strictly positive for every nonconstant quantum channel, including classical channels.

DOI
10.1109/tit.2012.2191695

Related papers

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

Identifying the information gain of a quantum measurement

Mario Berta, Joseph M. Renes, Mark M. Wilde

We show that quantum-to-classical channels, i.e., quantum measurements, can be asymptotically simulated by an amount of classical communication equal to the quantum mutual information of the measurement, if sufficient shared randomness is available. This result generalizes Winter's measurement compression theorem for fixed independent and identically distributed inputs [Winter, CMP 244 (157), 2004] to arbitrary inputs, and more importantly, it identifies the quantum mutual information of a measurement as the information gained by performing it, independent of the input state on which it is performed. Our result is a generalization of the classical reverse Shannon theorem to quantum-to-classical channels. In this sense, it can be seen as a quantum reverse Shannon theorem for quantum-to-classical channels, but with the entanglement assistance and quantum communication replaced by shared randomness and classical communication, respectively. Our proof is based on quantum-proof randomness extractors and the post-selection technique for quantum channels [Christandl et al., PRL 102 (020504), 2009].

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2014•13 citations

The decoupling approach to quantum information theory

Frédéric Dupuis

Quantum information theory studies the fundamental limits that physical laws impose on information processing tasks such as data compression and data transmission on noisy channels. This thesis presents general techniques that allow one to solve many fundamental problems of quantum information theory in a unified framework. The central theorem of this thesis proves the existence of a protocol that transmits quantum data that is partially known to the receiver through a single use of an arbitrary noisy quantum channel. In addition to the intrinsic interest of this problem, this theorem has as immediate corollaries several central theorems of quantum information theory. The following chapters use this theorem to prove the existence of new protocols for two other types of quantum channels, namely quantum broadcast channels and quantum channels with side information at the transmitter. These protocols also involve sending quantum information partially known by the receiver with a single use of the channel, and have as corollaries entanglement-assisted and unassisted asymptotic coding theorems. The entanglement-assisted asymptotic versions can, in both cases, be considered as quantum versions of the best coding theorems known for the classical versions of these problems. The last chapter deals with a purely quantum phenomenon called locking. We demonstrate that it is possible to encode a classical message into a quantum state such that, by removing a subsystem of logarithmic size with respect to its total size, no measurement can have significant correlations with the message. The message is therefore "locked" by a logarithmic-size key. This thesis presents the first locking protocol for which the success criterion is that the trace distance between the joint distribution of the message and the measurement result and the product of their marginals be sufficiently small.

arXiv:1004.1641•Apr 9, 2010•133 citations

Convex combinations of bosonic pure-loss channels

Giuseppe Catalano, Marco Fanizza, Francesco Anna Mele +2 more

The pure-loss channel is a fundamental noise model for bosonic quantum platforms, characterised by a single parameter, the transmissivity. In realistic scenarios such as free-space quantum communication, the transmissivity fluctuates from one channel use to another, and the channel is a convex combination of pure-loss channels, known as a fading channel. Despite its practical relevance, its quantum Shannon theory has remained largely unexplored. Here we investigate degradability, anti-degradability, entanglement breakingness, and capacities of the fading channel. We prove that entanglement distribution and quantum key distribution can be achieved at a strictly positive rate over any fading channel that is not completely noisy. When the transmissivity takes a finite set of values, we determine the energy-unconstrained two-way quantum and secret-key capacities exactly, as the averages of those of the pure-loss components. We prove that thermal states, optimal for a broad class of static bosonic Gaussian channels, do not in general achieve the entanglement-assisted classical capacity of fading channels: for a binary fading model we derive the capacity-achieving state in closed form, and we exhibit channels for which non-Gaussian Fock-diagonal states strictly outperform every Gaussian encoding. For the quantum capacity, we give a simple sufficient condition on the transmissivity distribution under which weak thermal inputs yield a strictly positive rate. Outside this condition, we numerically identify parameter regions where no thermal input compatible with the energy constraint has a positive coherent information, while optimized non-Gaussian inputs do. For general fading distributions, we design an iterative variational algorithm to optimize the coherent and mutual information. Our work advances the study of quantum communication in the non-Gaussian regime.

quant-pharXiv:2604.26874•Apr 30, 2026•2 citations

Identification of malfunctioning quantum devices

Michalis Skotiniotis, Santiago Llorens, Ronja Hotz +2 more

We consider the problem of correctly identifying a malfunctioning quantum device that forms part of a network of N such devices, which can be considered as the quantum analog of classical anomaly detection. In the case where the devices in question are sources assumed to prepare identical quantum pure states, with the faulty source producing a different anomalous pure state, we show that the optimal probability of successful identification requires a global quantum measurement. We also put forth several local measurement strategies—both adaptive and nonadaptive—that achieve the same optimal probability of success in the limit where the number of devices to be checked is large. In the case where the faulty device performs a known unitary operation, we show that the use of entangled probes provides an improvement that even allows perfect identification for values of the unitary parameter that surpass a certain threshold. Finally, if the faulty device implements a known qubit channel, we find that the optimal probability for detecting the position of rank-one and rank-two Pauli channels can be achieved by product state inputs and separable measurements for any size of network, whereas for rank-three and general amplitude damping channels, optimal identification requires entanglement with N qubit ancillas. Published by the American Physical Society 2024

arXiv:1808.02729•Physical Review Research•Sep 23, 2024•15 citations

Duality of channels and codes

Joseph M. Renes

For any given channel W with classical inputs and possibly quantum outputs, a dual classical-input channel W⊥can be defined by embedding the original into a channel N with quantum inputs and outputs. Here we give new uncertainty relations for a general class of entropies that lead to very close relationships between the original channel and its dual. Moreover, we show that channel duality can be combined with duality of linear codes, whereupon the uncertainty relations imply that the performance of a given code over a given channel is entirely characterized by the performance of the dual code on the dual channel. This has several applications. In the context of polar codes, it implies that the rates of polarization to ideal and useless channels must be identical. Duality also relates the tasks of channel coding and privacy amplification, implying that the finite blocklength performance of extractors and codes is precisely linked, and that optimal rate extractors can be transformed into capacity-achieving codes, and vice versa. Finally, duality also extends to the EXIT function of any channel and code. Here it implies that for any channel family, if the EXIT function for a fixed code has a sharp transition, then it must be such that the rate of the code equals the capacity at the transition. This may give a different route to proving a code family achieves capacity by establishing EXIT function transitions.

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2017•4 citations
If a quantum system is subject to noise, it is possible to perform quantum error correction reversing the action of the noise if and only if no information about the system's quantum state leaks to the environment. In this paper, we develop an analogous duality in the case that the environment approximately forgets the identity of the quantum state, a weaker condition satisfied by -randomizing maps and approximate unitary designs. Specifically, we show that the environment approximately forgets quantum states if and only if the original channel approximately preserves pairwise fidelities of pure inputs, an observation we call weak decoupling duality. Using this tool, we then go on to study the task of using the output of a channel to simulate restricted classes of measurements on a space of input states. The case of simulating measurements that test whether the input state is an arbitrary pure state is known as equality testing or quantum identification. An immediate consequence of weak decoupling duality is that the ability to perform quantum identification cannot be cloned. We, furthermore, establish that the optimal amortized rate at which quantum states can be identified through a noisy quantum channel is equal to the entanglement-assisted classical capacity of the channel, despite the fact that the task is quantum, not classical, and entanglement-assistance is not allowed. In particular, this rate is strictly positive for every nonconstant quantum channel, including classical channels.
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.
We show that quantum-to-classical channels, i.e., quantum measurements, can be asymptotically simulated by an amount of classical communication equal to the quantum mutual information of the measurement, if sufficient shared randomness is available. This result generalizes Winter's measurement compression theorem for fixed independent and identically distributed inputs [Winter, CMP 244 (157), 2004] to arbitrary inputs, and more importantly, it identifies the quantum mutual information of a measurement as the information gained by performing it, independent of the input state on which it is performed. Our result is a generalization of the classical reverse Shannon theorem to quantum-to-classical channels. In this sense, it can be seen as a quantum reverse Shannon theorem for quantum-to-classical channels, but with the entanglement assistance and quantum communication replaced by shared randomness and classical communication, respectively. Our proof is based on quantum-proof randomness extractors and the post-selection technique for quantum channels [Christandl et al., PRL 102 (020504), 2009].
Quantum information theory studies the fundamental limits that physical laws impose on information processing tasks such as data compression and data transmission on noisy channels. This thesis presents general techniques that allow one to solve many fundamental problems of quantum information theory in a unified framework. The central theorem of this thesis proves the existence of a protocol that transmits quantum data that is partially known to the receiver through a single use of an arbitrary noisy quantum channel. In addition to the intrinsic interest of this problem, this theorem has as immediate corollaries several central theorems of quantum information theory. The following chapters use this theorem to prove the existence of new protocols for two other types of quantum channels, namely quantum broadcast channels and quantum channels with side information at the transmitter. These protocols also involve sending quantum information partially known by the receiver with a single use of the channel, and have as corollaries entanglement-assisted and unassisted asymptotic coding theorems. The entanglement-assisted asymptotic versions can, in both cases, be considered as quantum versions of the best coding theorems known for the classical versions of these problems. The last chapter deals with a purely quantum phenomenon called locking. We demonstrate that it is possible to encode a classical message into a quantum state such that, by removing a subsystem of logarithmic size with respect to its total size, no measurement can have significant correlations with the message. The message is therefore "locked" by a logarithmic-size key. This thesis presents the first locking protocol for which the success criterion is that the trace distance between the joint distribution of the message and the measurement result and the product of their marginals be sufficiently small.
The pure-loss channel is a fundamental noise model for bosonic quantum platforms, characterised by a single parameter, the transmissivity. In realistic scenarios such as free-space quantum communication, the transmissivity fluctuates from one channel use to another, and the channel is a convex combination of pure-loss channels, known as a fading channel. Despite its practical relevance, its quantum Shannon theory has remained largely unexplored. Here we investigate degradability, anti-degradability, entanglement breakingness, and capacities of the fading channel. We prove that entanglement distribution and quantum key distribution can be achieved at a strictly positive rate over any fading channel that is not completely noisy. When the transmissivity takes a finite set of values, we determine the energy-unconstrained two-way quantum and secret-key capacities exactly, as the averages of those of the pure-loss components. We prove that thermal states, optimal for a broad class of static bosonic Gaussian channels, do not in general achieve the entanglement-assisted classical capacity of fading channels: for a binary fading model we derive the capacity-achieving state in closed form, and we exhibit channels for which non-Gaussian Fock-diagonal states strictly outperform every Gaussian encoding. For the quantum capacity, we give a simple sufficient condition on the transmissivity distribution under which weak thermal inputs yield a strictly positive rate. Outside this condition, we numerically identify parameter regions where no thermal input compatible with the energy constraint has a positive coherent information, while optimized non-Gaussian inputs do. For general fading distributions, we design an iterative variational algorithm to optimize the coherent and mutual information. Our work advances the study of quantum communication in the non-Gaussian regime.
We consider the problem of correctly identifying a malfunctioning quantum device that forms part of a network of N such devices, which can be considered as the quantum analog of classical anomaly detection. In the case where the devices in question are sources assumed to prepare identical quantum pure states, with the faulty source producing a different anomalous pure state, we show that the optimal probability of successful identification requires a global quantum measurement. We also put forth several local measurement strategies—both adaptive and nonadaptive—that achieve the same optimal probability of success in the limit where the number of devices to be checked is large. In the case where the faulty device performs a known unitary operation, we show that the use of entangled probes provides an improvement that even allows perfect identification for values of the unitary parameter that surpass a certain threshold. Finally, if the faulty device implements a known qubit channel, we find that the optimal probability for detecting the position of rank-one and rank-two Pauli channels can be achieved by product state inputs and separable measurements for any size of network, whereas for rank-three and general amplitude damping channels, optimal identification requires entanglement with N qubit ancillas. Published by the American Physical Society 2024
For any given channel W with classical inputs and possibly quantum outputs, a dual classical-input channel W⊥can be defined by embedding the original into a channel N with quantum inputs and outputs. Here we give new uncertainty relations for a general class of entropies that lead to very close relationships between the original channel and its dual. Moreover, we show that channel duality can be combined with duality of linear codes, whereupon the uncertainty relations imply that the performance of a given code over a given channel is entirely characterized by the performance of the dual code on the dual channel. This has several applications. In the context of polar codes, it implies that the rates of polarization to ideal and useless channels must be identical. Duality also relates the tasks of channel coding and privacy amplification, implying that the finite blocklength performance of extractors and codes is precisely linked, and that optimal rate extractors can be transformed into capacity-achieving codes, and vice versa. Finally, duality also extends to the EXIT function of any channel and code. Here it implies that for any channel family, if the EXIT function for a fixed code has a sharp transition, then it must be such that the rate of the code equals the capacity at the transition. This may give a different route to proving a code family achieves capacity by establishing EXIT function transitions.