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

Springer eBooks

A Measure of the Distinguishability of Quantum States

William K. Wootters

Published Jan 1, 1983• 3 citations
Publisher
DOI
10.1007/978-1-4613-3712-6_8

Related papers

Distinguishability of generic quantum states

Pawela, Karol yczkowski

•Jan 1, 2015•0 citations

Quantum state and circuit distinguishability with single-qubit measurements

Tomoyuki Morimae

We show that the Quantum State Distinguishability (QSD), which is a QSZK-complete problem, and the Quantum Circuit Distinguishability (QCD), which is a QIP-complete problem, can be solved by the verifier who can perform only single-qubit measurements. To show these results, we use measurement-based quantum computing: the honest prover sends a graph state to the verifier, and the verifier can perform universal quantum computing on it with only single-qubit measurements. If the prover is malicious, he does not necessarily generate the correct graph state, but the verifier can verify the correctness of the graph state by measuring the stabilizer operators.

arXiv:1607.00574•Jul 3, 2016•1 citation

Overlap and distinguishability of quantum states

Dennis Dieks

Physics Letters A•Jan 1, 1988•626 citations

Geodesics and the best measurement for distinguishing quantum states

Åsa Ericsson

From statistical distinguishability of probability distributions, one can define distinguishability of quantum states. A corresponding measurement to perform, optimal in a definite sense, for distinguishing between two given states ρ A and ρ B , has been derived by Fuchs and Caves. We show that the Bures–Uhlmann geodesic through the two states singles out this measurement. The geodesic ‘bounces’ at the boundary of the set of quantum states. Whenever the geodesic hits the boundary, the state orthogonal to that boundary state is one of the basis states for the measurement.

arXiv:quant-ph/0508133•Journal of Physics A Mathematical and General•Oct 19, 2005•11 citations

Can scrambling protect quantum state distinguishability under noise?

Guoding Liu, Chushi Qin, Zitai Xu +2 more

Quantum state distinguishability is a fundamental concept in quantum information science that underpins a wide range of important practical tasks. Traditionally formulated for pairs of states, quantum state distinguishability is here extended to quantum state ensembles, which we characterize through the average pairwise trace distance. Motivated by both theoretical and practical interest in noisy quantum information processing, we ask whether ``minimally'' scrambled ensembles modeled by 2-designs protect distinguishability under noise, which sheds light on the fundamental competition between noise and information scrambling. Using a rigorous decoupling approach, we establish tight bounds on noisy ensemble distinguishability. We show that the distinguishability of noisy 2-design ensembles exhibits a sharp threshold and phase-transition behavior governed by channel conditional entropy: below the threshold, the states remain mutually distinguishable with high probability, while above it, distinguishability undergoes a sudden power-law decay and then collapses exponentially. On the other hand, under local purity-shrinking noise, post-measured noisy 2-design ensembles become exponentially indistinguishable for any measurement, precluding a noise threshold for learning tasks such as shadow tomography. These results reveal a sharp difference between unmeasured and post-measured scrambled ensembles: the former can retain high distinguishability for sufficiently small noise, whereas the latter exhibits no such protected regime. We discuss the implications of these results for crucial tasks ranging from quantum communication and cryptography to learning.

quant-pharXiv:2606.02122•Jun 2, 2026•0 citations

Measuring Quantum States

Giacomo Mauro D’Ariano

Springer eBooks•Jan 1, 1997•32 citations
We show that the Quantum State Distinguishability (QSD), which is a QSZK-complete problem, and the Quantum Circuit Distinguishability (QCD), which is a QIP-complete problem, can be solved by the verifier who can perform only single-qubit measurements. To show these results, we use measurement-based quantum computing: the honest prover sends a graph state to the verifier, and the verifier can perform universal quantum computing on it with only single-qubit measurements. If the prover is malicious, he does not necessarily generate the correct graph state, but the verifier can verify the correctness of the graph state by measuring the stabilizer operators.
From statistical distinguishability of probability distributions, one can define distinguishability of quantum states. A corresponding measurement to perform, optimal in a definite sense, for distinguishing between two given states ρ A and ρ B , has been derived by Fuchs and Caves. We show that the Bures–Uhlmann geodesic through the two states singles out this measurement. The geodesic ‘bounces’ at the boundary of the set of quantum states. Whenever the geodesic hits the boundary, the state orthogonal to that boundary state is one of the basis states for the measurement.
Quantum state distinguishability is a fundamental concept in quantum information science that underpins a wide range of important practical tasks. Traditionally formulated for pairs of states, quantum state distinguishability is here extended to quantum state ensembles, which we characterize through the average pairwise trace distance. Motivated by both theoretical and practical interest in noisy quantum information processing, we ask whether ``minimally'' scrambled ensembles modeled by 2-designs protect distinguishability under noise, which sheds light on the fundamental competition between noise and information scrambling. Using a rigorous decoupling approach, we establish tight bounds on noisy ensemble distinguishability. We show that the distinguishability of noisy 2-design ensembles exhibits a sharp threshold and phase-transition behavior governed by channel conditional entropy: below the threshold, the states remain mutually distinguishable with high probability, while above it, distinguishability undergoes a sudden power-law decay and then collapses exponentially. On the other hand, under local purity-shrinking noise, post-measured noisy 2-design ensembles become exponentially indistinguishable for any measurement, precluding a noise threshold for learning tasks such as shadow tomography. These results reveal a sharp difference between unmeasured and post-measured scrambled ensembles: the former can retain high distinguishability for sufficiently small noise, whereas the latter exhibits no such protected regime. We discuss the implications of these results for crucial tasks ranging from quantum communication and cryptography to learning.