Weak Decoupling Duality and Quantum Identification

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 article, we develop an analogous duality in the case that the environment approximately forgets the identity of the quantum state, a weaker condition satisfied by epsilon-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 non-constant quantum channel, including classical channels.

14 pages; v2 has some remarks added and inaccuracies corrected; v3 has new title, improved presentation and additional references; v4 is the final, accepted version (to appear in IEEE IT), title changed once more and numerous improvements made - the main one being that we can now show that nontrivial amortization is necessary in erasure channels

References in corpus (11)

• Coding Theorem and Strong Converse for Quantum Channels
• Aspects of generic entanglement
• Randomizing quantum states: Constructions and applications
• The mother of all protocols: Restructuring quantum information's family tree
• A decoupling approach to the quantum capacity
• Remote preparation of quantum states
• Uncertainty, Monogamy, and Locking of Quantum Correlations
• On almost randomizing channels with a short Kraus decomposition
• Approximate Randomization of Quantum States With Fewer Bits of Key
• Optimal superdense coding of entangled states
• Random quantum codes from Gaussian ensembles and an uncertainty relation

Cited by in corpus (15)

• Entanglement Wedge Reconstruction via Universal Recovery Channels
• Beyond Toy Models: Distilling Tensor Networks in Full AdS/CFT
• Learning the Alpha-bits of Black Holes
• Quantum minimal surfaces from quantum error correction
• Quantum Error Correcting Codes in Eigenstates of Translation-Invariant Spin Chains
• From Low-Distortion Norm Embeddings to Explicit Uncertainty Relations and Efficient Information Locking
• Limits on the storage of quantum information in a volume of space
• On converse bounds for classical communication over quantum channels
• Approximate Quantum Error Correction Revisited: Introducing the Alpha-bit
• Quantum enigma machines and the locking capacity of a quantum channel
• Secure and Robust Identification via Classical-Quantum Channels
• Deterministic identification over channels with finite output: a dimensional perspective on superlinear rates
• Quantum soft-covering lemma with applications to rate-distortion coding, resolvability and identification via quantum channels
• What exactly does Bekenstein bound?
• Noisy quantum state redistribution with promise and the Alpha-bit