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:1612.00401 · Journal of Mathematical Physics

Almost all quantum channels are equidistant

Ion Nechita, Zbigniew Puchała, Łukasz Pawela, Karol Życzkowski

Published May 1, 2018• 34 citations
arXivHTMLPDF

Abstract

In this work, we analyze properties of generic quantum channels in the case of large system size. We use random matrix theory and free probability to show that the distance between two independent random channels converges to a constant value as the dimension of the system grows larger. As a measure of the distance we use the diamond norm. In the case of a flat Hilbert-Schmidt distribution on quantum channels, we obtain that the distance converges to 12+2π, giving also an estimate for the maximum success probability for distinguishing the channels. We also consider the problem of distinguishing two random unitary rotations.

DOI
10.1063/1.5019322

Related papers

Distinguishability of generic quantum states

Zbigniew Puchała, Łukasz Pawela, Karol Życzkowski

Properties of random mixed states of dimension $N$ distributed uniformly with respect to the Hilbert-Schmidt measure are investigated. We show that for large $N$, due to the concentration of measure, the trace distance between two random states tends to a fixed number $\stackrel{\ifmmode \tilde{}\else \~{}\fi{}}{D}=1/4+1/\ensuremath{\pi}$, which yields the Helstrom bound on their distinguishability. To arrive at this result, we apply free random calculus and derive the symmetrized Marchenko-Pastur distribution, which is shown to describe numerical data for the model of coupled quantum kicked tops. Asymptotic value for the root fidelity between two random states, $\sqrt{F}=\frac{3}{4}$, can serve as a universal reference value for further theoretical and experimental studies. Analogous results for quantum relative entropy and Chernoff quantity provide other bounds on the distinguishablity of both states in a multiple measurement setup due to the quantum Sanov theorem. We study also mean entropy of coherence of random pure and mixed states and entanglement of a generic mixed state of a bipartite system.

arXiv:1507.05123•Physical Review A•Jun 9, 2016•51 citations

Optimal Diamond Distance Estimation for Unitary Channels

Jinge Bao, Qisheng Wang

The diamond distance between two quantum channels determines the optimal probability of distinguishing them from a single use. We give a quantum algorithm that estimates the diamond distance between two unknown $d$-dimensional unitary channels to within additive error $\varepsilon$, using $O(\sqrt{d}/\varepsilon)$ queries to the unitary channels and their inverses. The query complexity is optimal, as it matches the lower bound due to Jeon and Oh (npj Quantum Inf. 2026).

quant-pharXiv:2610.40623•Oct 30, 2026•0 citations

Depolarizing behavior of quantum channels in higher dimensions

Easwar Magesan

The paper analyzes the behavior of quantum channels, particularly in large dimensions, by proving various properties of the quantum gate fidelity. Many of these properties are of independent interest in the theory of distance measures on quantum operations. A non-uniqueness result for the gate fidelity is proven, a consequence of which is the existence of non-depolarizing channels that produce a constant gate fidelity on pure states. Asymptotically, the gate fidelity associated with any quantum channel is shown to converge to that of a depolarizing channel. Methods for estimating the minimum of the gate fidelity are also presented.

arXiv:1002.3455•Quantum Information and Computation•May 1, 2011•10 citations

Computing the distance between quantum channels: usefulness of the Fano representation

Giuliano Benenti, G. Strini

The diamond norm measures the distance between two quantum channels. From an operational vewpoint, this norm measures how well we can distinguish between two channels by applying them to input states of arbitrarily large dimensions. In this paper, we show that the diamond norm can be conveniently and in a physically transparent way computed by means of a Monte-Carlo algorithm based on the Fano representation of quantum states and quantum operations. The effectiveness of this algorithm is illustrated for several single-qubit quantum channels.

arXiv:1004.4110•Journal of Physics B Atomic Molecular and Optical Physics•Oct 22, 2010•44 citations

Comparison of quantum channels and statistical experiments

Anna Jenčová

For a pair of quantum channels with the same input space, we show that the possibility of approximation of one channel by post-processings of the other channel can be characterized by comparing the success probabilities for the two ensembles obtained as outputs for any ensemble on the input space coupled with an ancilla. This provides an operational interpretation to a natural extension of Le Cam's deficiency to quantum channels. In particular, we obtain a version of the randomization criterion for quantum statistical experiments. The proofs are based on some properties of the diamond norm and its dual, which are of independent interest.

arXiv:1512.07016•IEEE International Symposium on Information Theory (ISIT)•Jul 1, 2016•22 citations

Randomization theorems for quantum channels

Anna Jenčová

The classical randomization criterion is an important result of statistical decision theory. Recently, a quantum analogue has been proposed, giving equivalent conditions for two sets of quantum states, ensuring existence of a quantum channel mapping one set close to the other, in $L_1$-distance. In the present paper, we extend these concepts in several ways. First, sets of states are replaced by channels and randomization is performed by either post- or pre-composition with another channel. The $L_1$-distance is replaced by the diamond norm. Secondly, the maps are not required to be completely positive, but positivity is given by an admissible family of convex cones. It is shown that the randomization theorems, generalizing both quantum and classical randomization criteria, can be proved in the framework of base section norms, including the diamond norm and its dual. The theory of such norms is developed in the Appendix.

arXiv:1404.3900•Apr 15, 2014•7 citations
In this work, we analyze properties of generic quantum channels in the case of large system size. We use random matrix theory and free probability to show that the distance between two independent random channels converges to a constant value as the dimension of the system grows larger. As a measure of the distance we use the diamond norm. In the case of a flat Hilbert-Schmidt distribution on quantum channels, we obtain that the distance converges to 12+2π, giving also an estimate for the maximum success probability for distinguishing the channels. We also consider the problem of distinguishing two random unitary rotations.
Properties of random mixed states of dimension NNN distributed uniformly with respect to the Hilbert-Schmidt measure are investigated. We show that for large NNN, due to the concentration of measure, the trace distance between two random states tends to a fixed number $\stackrel{\ifmmode \tilde{}\else \~{}\fi{}}{D}=1/4+1/\ensuremath{\pi}$, which yields the Helstrom bound on their distinguishability. To arrive at this result, we apply free random calculus and derive the symmetrized Marchenko-Pastur distribution, which is shown to describe numerical data for the model of coupled quantum kicked tops. Asymptotic value for the root fidelity between two random states, F=34\sqrt{F}=\frac{3}{4}F​=43​, can serve as a universal reference value for further theoretical and experimental studies. Analogous results for quantum relative entropy and Chernoff quantity provide other bounds on the distinguishablity of both states in a multiple measurement setup due to the quantum Sanov theorem. We study also mean entropy of coherence of random pure and mixed states and entanglement of a generic mixed state of a bipartite system.
The diamond distance between two quantum channels determines the optimal probability of distinguishing them from a single use. We give a quantum algorithm that estimates the diamond distance between two unknown ddd-dimensional unitary channels to within additive error ε\varepsilonε, using O(d/ε)O(\sqrt{d}/\varepsilon)O(d​/ε) queries to the unitary channels and their inverses. The query complexity is optimal, as it matches the lower bound due to Jeon and Oh (npj Quantum Inf. 2026).
The paper analyzes the behavior of quantum channels, particularly in large dimensions, by proving various properties of the quantum gate fidelity. Many of these properties are of independent interest in the theory of distance measures on quantum operations. A non-uniqueness result for the gate fidelity is proven, a consequence of which is the existence of non-depolarizing channels that produce a constant gate fidelity on pure states. Asymptotically, the gate fidelity associated with any quantum channel is shown to converge to that of a depolarizing channel. Methods for estimating the minimum of the gate fidelity are also presented.
The diamond norm measures the distance between two quantum channels. From an operational vewpoint, this norm measures how well we can distinguish between two channels by applying them to input states of arbitrarily large dimensions. In this paper, we show that the diamond norm can be conveniently and in a physically transparent way computed by means of a Monte-Carlo algorithm based on the Fano representation of quantum states and quantum operations. The effectiveness of this algorithm is illustrated for several single-qubit quantum channels.
For a pair of quantum channels with the same input space, we show that the possibility of approximation of one channel by post-processings of the other channel can be characterized by comparing the success probabilities for the two ensembles obtained as outputs for any ensemble on the input space coupled with an ancilla. This provides an operational interpretation to a natural extension of Le Cam's deficiency to quantum channels. In particular, we obtain a version of the randomization criterion for quantum statistical experiments. The proofs are based on some properties of the diamond norm and its dual, which are of independent interest.
The classical randomization criterion is an important result of statistical decision theory. Recently, a quantum analogue has been proposed, giving equivalent conditions for two sets of quantum states, ensuring existence of a quantum channel mapping one set close to the other, in L1L_1L1​-distance. In the present paper, we extend these concepts in several ways. First, sets of states are replaced by channels and randomization is performed by either post- or pre-composition with another channel. The L1L_1L1​-distance is replaced by the diamond norm. Secondly, the maps are not required to be completely positive, but positivity is given by an admissible family of convex cones. It is shown that the randomization theorems, generalizing both quantum and classical randomization criteria, can be proved in the framework of base section norms, including the diamond norm and its dual. The theory of such norms is developed in the Appendix.