Almost all quantum channels are equidistant
From MaRDI portal
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 , giving also an estimate for the maximum success probability for distinguishing the channels. We also consider the problem of distinguishing two random unitary rotations.
Recommendations
- On almost randomizing channels with a short Kraus decomposition
- The effects of random qubit-qubit quantum channels to entropy gain, fidelity and trace distance
- Random quantum channels. I: Graphical calculus and the Bell state phenomenon
- Generating random quantum channels
- Contravariant densities, complete distancesand relative fidelities for quantum channels
Cites work
- Alice and Bob Meet Banach
- Asymptotic behavior of group integrals in the limit of infinite rank
- Bounds for eigenvalues using traces
- Combinatorial properties of Brownian motion on the compact classical groups
- Comments on “Improving Compressed Sensing With the Diamond Norm”–Saturation of the Norm Inequalities Between Diamond and Nuclear Norm
- Commutators of free random variables
- Completely positive linear maps on complex matrices
- Computing stabilized norms for quantum operations via the theory of completely bounded maps
- Computing the norms of elementary operators
- Conditions for optimal input states for discrimination of quantum channels
- Convergence of Wigner integrals to the tetilla law
- Cryptographic distinguishability measures for quantum-mechanical states
- Distribution of bipartite entanglement for random pure states
- Extreme gaps between eigenvalues of random matrices
- Geometry of sets of quantum maps: A generic positive map acting on a high-dimensional system is not completely positive
- scientific article; zbMATH DE number 194139 (Why is no real title available?)
- scientific article; zbMATH DE number 1003147 (Why is no real title available?)
- scientific article; zbMATH DE number 1182655 (Why is no real title available?)
- scientific article; zbMATH DE number 1465044 (Why is no real title available?)
- scientific article; zbMATH DE number 3454668 (Why is no real title available?)
- scientific article; zbMATH DE number 1849957 (Why is no real title available?)
- Improving Compressed Sensing With the Diamond Norm
- Integration with respect to the Haar measure on unitary, orthogonal and symplectic group
- Lectures on the Combinatorics of Free Probability
- Limit of the smallest eigenvalue of a large dimensional sample covariance matrix
- Linear transformations which preserve trace and positive semidefiniteness of operators
- Lipschitz Continuity of Functions of Operators in the Schatten Classes
- Matrix factorizations and their perturbations
- Positive Functions on C ∗ -Algebras
- Quantum computations: algorithms and error correction
- Quantum detection and estimation theory
- Random matrix techniques in quantum information theory
- Random quantum channels. I: Graphical calculus and the Bell state phenomenon
- Random quantum operations
- Segal-Bargmann transform, functional calculus on matrix spaces and the theory of semi-circular and circular systems
- Simpler semidefinite programs for completely bounded norms
- Spectral analysis of large dimensional random matrices
- Statistical properties of random density matrices
- The absolute positive partial transpose property for random induced states
- The norm of polynomials in large random and deterministic matrices
- The theory of quantum information
Cited in
(8)- Amortized channel divergence for asymptotic quantum channel discrimination
- Generalizations of 2-dimensional diagonal quantum channels with constant Frobenius norm
- The effects of random qubit-qubit quantum channels to entropy gain, fidelity and trace distance
- Generating random quantum channels
- Disguising quantum channels by mixing and channel distance trade-off
- Characterising port-based teleportation as universal simulator of qubit channels
- Comparing two entropy functions of a quantum channel
- On almost randomizing channels with a short Kraus decomposition
This page was built for publication: Almost all quantum channels are equidistant
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4565439)
