Presents a poly-complexity quantum circuit implementing the random dilation superchannel for parallel channel queries, with approximate sequential extension, a no-go theorem for exact sequential dilation, and an application to exponentially improved channel storage-retrieval.
Cryptographic Distinguishability Measures for Quantum Mechanical States
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
abstract
This paper, mostly expository in nature, surveys four measures of distinguishability for quantum-mechanical states. This is done from the point of view of the cryptographer with a particular eye on applications in quantum cryptography. Each of the measures considered is rooted in an analogous classical measure of distinguishability for probability distributions: namely, the probability of an identification error, the Kolmogorov distance, the Bhattacharyya coefficient, and the Shannon distinguishability (as defined through mutual information). These measures have a long history of use in statistical pattern recognition and classical cryptography. We obtain several inequalities that relate the quantum distinguishability measures to each other, one of which may be crucial for proving the security of quantum cryptographic key distribution. In another vein, these measures and their connecting inequalities are used to define a single notion of cryptographic exponential indistinguishability for two families of quantum states. This is a tool that may prove useful in the analysis of various quantum cryptographic protocols.
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 4verdicts
UNVERDICTED 4roles
background 1polarities
background 1representative citing papers
Quantum strategy stores isometry channels with n = Θ(1/√ε) queries for error ε, quadratic improvement over classical n = Θ(ε^{-1}).
A differentiable tensor-network framework learns CPTP noise channels from single-circuit measurement data on IBM hardware and generalizes the model to unrelated circuits.
The paper proposes steganographic protocols for transmitting quantum entanglement disguised as thermal noise, enabling hidden nonclassical state teleportation even against an active eavesdropper.
citing papers explorer
-
Random dilation superchannel
Presents a poly-complexity quantum circuit implementing the random dilation superchannel for parallel channel queries, with approximate sequential extension, a no-go theorem for exact sequential dilation, and an application to exponentially improved channel storage-retrieval.
-
Quantum Advantage in Storage and Retrieval of Isometry Channels
Quantum strategy stores isometry channels with n = Θ(1/√ε) queries for error ε, quadratic improvement over classical n = Θ(ε^{-1}).
-
Quantum hardware noise learning via differentiable Kraus representation on tensor networks
A differentiable tensor-network framework learns CPTP noise channels from single-circuit measurement data on IBM hardware and generalizes the model to unrelated circuits.
-
Steganographic Entanglement Sharing
The paper proposes steganographic protocols for transmitting quantum entanglement disguised as thermal noise, enabling hidden nonclassical state teleportation even against an active eavesdropper.