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:1608.06658 · Journal of Physics A Mathematical and Theoretical

Metric and classical fidelity uncertainty relations for random unitary matrices

Radosław Adamczak

Published Feb 2, 2017• 4 citations
arXivHTMLPDF

Abstract

Abstract We analyze uncertainty relations on finite dimensional Hilbert spaces expressed in terms of classical fidelity, which are stronger than metric uncertainty relations introduced by Fawzi, Hayden and Sen. We establish the validity of fidelity uncertainty relations for random unitary matrices with optimal parameters (up to universal constants) which improves upon known results for the weaker notion of metric uncertainty. This result is then applied to locking classical information in quantum states and allows to obtain optimal locking in Hellinger distance, improving upon previous results on locking in the total variation distance, both by strengthening the metric used and by improving the dependence on parameters. We also show that general probabilistic estimates behind the main theorem can be used to prove existence of data hiding schemes with Bayesian type guarantees. As a byproduct of our approach we obtain existence of almost Euclidean subspaces of the matrix spaces ℓ 1 n ( ℓ 2 m ) with a better dimension/distortion dependence than allowed in previously known constructions.

DOI
10.1088/1751-8121/aa5662

Related papers

From Low-Distortion Norm Embeddings to Explicit Uncertainty Relations and Efficient Information Locking

Omar Fawzi, Patrick M. Hayden, Pranab Sen

The existence of quantum uncertainty relations is the essential reason that some classically unrealizable cryptographic primitives become realizable when quantum communication is allowed. One operational manifestation of these uncertainty relations is a purely quantum effect referred to as information locking [DiVincenzo et al. 2004]. A locking scheme can be viewed as a cryptographic protocol in which a uniformly random n -bit message is encoded in a quantum system using a classical key of size much smaller than n . Without the key, no measurement of this quantum state can extract more than a negligible amount of information about the message, in which case the message is said to be “locked”. Furthermore, knowing the key, it is possible to recover, that is “unlock”, the message. In this article, we make the following contributions by exploiting a connection between uncertainty relations and low-distortion embeddings of Euclidean spaces into slightly larger spaces endowed with the ℓ 1 norm. We introduce the notion of a metric uncertainty relation and connect it to low-distortion embeddings of ℓ 2 into ℓ 1 . A metric uncertainty relation also implies an entropic uncertainty relation. We prove that random bases satisfy uncertainty relations with a stronger definition and better parameters than previously known. Our proof is also considerably simpler than earlier proofs. We then apply this result to show the existence of locking schemes with key size independent of the message length. Moreover, we give efficient constructions of bases satisfying metric uncertainty relations. The bases defining these metric uncertainty relations are computable by quantum circuits of almost linear size. This leads to the first explicit construction of a strong information locking scheme. These constructions are obtained by adapting an explicit norm embedding due to Indyk [2007] and an extractor construction of Guruswami et al. [2009]. We apply our metric uncertainty relations to exhibit communication protocols that perform equality testing of n -qubit states. We prove that this task can be performed by a single message protocol using O (log 2 n ) qubits and n bits of communication, where the computation of the sender is efficient.

arXiv:1010.3007•Journal of the ACM•Nov 1, 2013•52 citations

Asymptotic entropic uncertainty relations

Radosław Adamczak, Rafał Latała, Zbigniew Puchała +1 more

We analyze entropic uncertainty relations for two orthogonal measurements on a N-dimensional Hilbert space, performed in two generic bases. It is assumed that the unitary matrix U relating both bases is distributed according to the Haar measure on the unitary group. We provide lower bounds on the average Shannon entropy of probability distributions related to both measurements. The bounds are stronger than those obtained with use of the entropic uncertainty relation by Maassen and Uffink, and they are optimal up to additive constants. We also analyze the case of a large number of measurements and obtain strong entropic uncertainty relations, which hold with high probability with respect to the random choice of bases. The lower bounds we obtain are optimal up to additive constants and allow us to prove a conjecture by Wehner and Winter on the asymptotic behavior of constants in entropic uncertainty relations as the dimension tends to infinity. As a tool we develop estimates on the maximum operator norm of a submatrix of a fixed size of a random unitary matrix distributed according to the Haar measure, which are of independent interest.

arXiv:1412.7065•Journal of Mathematical Physics•Mar 1, 2016•21 citations

Majorization entropic uncertainty relations

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

Entropic uncertainty relations in a finite-dimensional Hilbert space are investigated. Making use of the majorization technique we derive explicit lower bounds for the sum of Rényi entropies describing probability distributions associated with a given pure state expanded in eigenbases of two observables. Obtained bounds are expressed in terms of the largest singular values of submatrices of the unitary rotation matrix. Numerical simulations show that for a generic unitary matrix of size N = 5, our bound is stronger than the well-known result of Maassen and Uffink (MU) with a probability larger than 98%. We also show that the bounds investigated are invariant under the dephasing and permutation operations. Finally, we derive a classical analogue of the MU uncertainty relation, which is formulated for stochastic transition matrices.

arXiv:1304.7755•Journal of Physics A Mathematical and Theoretical•Jun 21, 2013•158 citations

Information geometry of density matrices and state estimation

Dorje C. Brody

Given a pure state vector | x ⟩ and a density matrix , the function defines a probability density on the space of pure states parameterised by density matrices. The associated Fisher–Rao information measure is used to define a unitary invariant Riemannian metric on the space of density matrices. An alternative derivation of the metric, based on square-root density matrices and trace norms, is provided. This is applied to the problem of quantum-state estimation. In the simplest case of unitary parameter estimation, new higher-order corrections to the uncertainty relations, applicable to general mixed states, are derived.

arXiv:1009.1115•Journal of Physics A Mathematical and Theoretical•May 19, 2011•32 citations

Exact mean and variance of the squared Hellinger distance for random density matrices

Vinay Kumar, Kaushik Vasan, Santosh Kumar

The Hellinger distance between quantum states is a significant measure in quantum information theory, known for its Riemannian and monotonic properties. It is easier to compute than the Bures distance, another measure that shares these properties, particularly in information-theoretic applications. Furthermore, in these applications, random quantum states are crucial for securing communication, studying entanglement, benchmarking quantum systems, aiding in quantum state tomography, and understanding how quantum systems behave in noisy environments. Recent works have computed exact results for distance measures such as Bures and Hilbert-Schmidt for random density matrices; however, no such results exist for the Hellinger distance. In this work, we derive the mean and variance of the Hellinger distance between pairs of density matrices, where one or both matrices are random. Our derivation utilizes Weingarten functions to perform the necessary unitary group integrals and is supported by existing results for eigenvalue moments of random density matrices. Along the way, we also obtain exact results for the mean affinity and mean square affinity. The first two cumulants of the Hellinger distance allow us to propose an approximation for the corresponding probability density function based on the gamma distribution. Our analytical results are corroborated through Monte Carlo simulations, showing excellent agreement.

arXiv:2409.14560•Physical review. E•May 5, 2025•2 citations

Total, classical, and quantum uncertainty matrices via operator monotone functions

Yajing Fan, Nan Li, Shunlong Luo

It is important to distinguish between classical information and quantum information in quantum information theory. In this paper, we first extend the concept of metric-adjusted correlation measure and some related measures to non-Hermitian operators, and establish several relations between the metric-adjusted skew information with different operator monotone functions. By employing operator monotone functions, we next introduce three uncertainty matrices generated by channels: the total uncertainty matrix, the classical uncertainty matrix, and the quantum uncertainty matrix. We establish a decomposition of the total uncertainty matrix into classical and quantum parts and further investigate their basic properties. As applications, we employ uncertainty matrices to quantify the decoherence caused by the action of quantum channels on quantum states, and calculate the uncertainty matrices of some typical channels to reveal certain intrinsic features of the corresponding channels. Moreover, we establish several uncertainty relations that improve the traditional Heisenberg uncertainty relations involving variance.

Theoretical and Mathematical Physics•Nov 1, 2024•1 citation
Abstract We analyze uncertainty relations on finite dimensional Hilbert spaces expressed in terms of classical fidelity, which are stronger than metric uncertainty relations introduced by Fawzi, Hayden and Sen. We establish the validity of fidelity uncertainty relations for random unitary matrices with optimal parameters (up to universal constants) which improves upon known results for the weaker notion of metric uncertainty. This result is then applied to locking classical information in quantum states and allows to obtain optimal locking in Hellinger distance, improving upon previous results on locking in the total variation distance, both by strengthening the metric used and by improving the dependence on parameters. We also show that general probabilistic estimates behind the main theorem can be used to prove existence of data hiding schemes with Bayesian type guarantees. As a byproduct of our approach we obtain existence of almost Euclidean subspaces of the matrix spaces ℓ 1 n ( ℓ 2 m ) with a better dimension/distortion dependence than allowed in previously known constructions.
The existence of quantum uncertainty relations is the essential reason that some classically unrealizable cryptographic primitives become realizable when quantum communication is allowed. One operational manifestation of these uncertainty relations is a purely quantum effect referred to as information locking [DiVincenzo et al. 2004]. A locking scheme can be viewed as a cryptographic protocol in which a uniformly random n -bit message is encoded in a quantum system using a classical key of size much smaller than n . Without the key, no measurement of this quantum state can extract more than a negligible amount of information about the message, in which case the message is said to be “locked”. Furthermore, knowing the key, it is possible to recover, that is “unlock”, the message. In this article, we make the following contributions by exploiting a connection between uncertainty relations and low-distortion embeddings of Euclidean spaces into slightly larger spaces endowed with the ℓ 1 norm. We introduce the notion of a metric uncertainty relation and connect it to low-distortion embeddings of ℓ 2 into ℓ 1 . A metric uncertainty relation also implies an entropic uncertainty relation. We prove that random bases satisfy uncertainty relations with a stronger definition and better parameters than previously known. Our proof is also considerably simpler than earlier proofs. We then apply this result to show the existence of locking schemes with key size independent of the message length. Moreover, we give efficient constructions of bases satisfying metric uncertainty relations. The bases defining these metric uncertainty relations are computable by quantum circuits of almost linear size. This leads to the first explicit construction of a strong information locking scheme. These constructions are obtained by adapting an explicit norm embedding due to Indyk [2007] and an extractor construction of Guruswami et al. [2009]. We apply our metric uncertainty relations to exhibit communication protocols that perform equality testing of n -qubit states. We prove that this task can be performed by a single message protocol using O (log 2 n ) qubits and n bits of communication, where the computation of the sender is efficient.
We analyze entropic uncertainty relations for two orthogonal measurements on a N-dimensional Hilbert space, performed in two generic bases. It is assumed that the unitary matrix U relating both bases is distributed according to the Haar measure on the unitary group. We provide lower bounds on the average Shannon entropy of probability distributions related to both measurements. The bounds are stronger than those obtained with use of the entropic uncertainty relation by Maassen and Uffink, and they are optimal up to additive constants. We also analyze the case of a large number of measurements and obtain strong entropic uncertainty relations, which hold with high probability with respect to the random choice of bases. The lower bounds we obtain are optimal up to additive constants and allow us to prove a conjecture by Wehner and Winter on the asymptotic behavior of constants in entropic uncertainty relations as the dimension tends to infinity. As a tool we develop estimates on the maximum operator norm of a submatrix of a fixed size of a random unitary matrix distributed according to the Haar measure, which are of independent interest.
Entropic uncertainty relations in a finite-dimensional Hilbert space are investigated. Making use of the majorization technique we derive explicit lower bounds for the sum of Rényi entropies describing probability distributions associated with a given pure state expanded in eigenbases of two observables. Obtained bounds are expressed in terms of the largest singular values of submatrices of the unitary rotation matrix. Numerical simulations show that for a generic unitary matrix of size N = 5, our bound is stronger than the well-known result of Maassen and Uffink (MU) with a probability larger than 98%. We also show that the bounds investigated are invariant under the dephasing and permutation operations. Finally, we derive a classical analogue of the MU uncertainty relation, which is formulated for stochastic transition matrices.
Given a pure state vector | x ⟩ and a density matrix , the function defines a probability density on the space of pure states parameterised by density matrices. The associated Fisher–Rao information measure is used to define a unitary invariant Riemannian metric on the space of density matrices. An alternative derivation of the metric, based on square-root density matrices and trace norms, is provided. This is applied to the problem of quantum-state estimation. In the simplest case of unitary parameter estimation, new higher-order corrections to the uncertainty relations, applicable to general mixed states, are derived.
The Hellinger distance between quantum states is a significant measure in quantum information theory, known for its Riemannian and monotonic properties. It is easier to compute than the Bures distance, another measure that shares these properties, particularly in information-theoretic applications. Furthermore, in these applications, random quantum states are crucial for securing communication, studying entanglement, benchmarking quantum systems, aiding in quantum state tomography, and understanding how quantum systems behave in noisy environments. Recent works have computed exact results for distance measures such as Bures and Hilbert-Schmidt for random density matrices; however, no such results exist for the Hellinger distance. In this work, we derive the mean and variance of the Hellinger distance between pairs of density matrices, where one or both matrices are random. Our derivation utilizes Weingarten functions to perform the necessary unitary group integrals and is supported by existing results for eigenvalue moments of random density matrices. Along the way, we also obtain exact results for the mean affinity and mean square affinity. The first two cumulants of the Hellinger distance allow us to propose an approximation for the corresponding probability density function based on the gamma distribution. Our analytical results are corroborated through Monte Carlo simulations, showing excellent agreement.
It is important to distinguish between classical information and quantum information in quantum information theory. In this paper, we first extend the concept of metric-adjusted correlation measure and some related measures to non-Hermitian operators, and establish several relations between the metric-adjusted skew information with different operator monotone functions. By employing operator monotone functions, we next introduce three uncertainty matrices generated by channels: the total uncertainty matrix, the classical uncertainty matrix, and the quantum uncertainty matrix. We establish a decomposition of the total uncertainty matrix into classical and quantum parts and further investigate their basic properties. As applications, we employ uncertainty matrices to quantify the decoherence caused by the action of quantum channels on quantum states, and calculate the uncertainty matrices of some typical channels to reveal certain intrinsic features of the corresponding channels. Moreover, we establish several uncertainty relations that improve the traditional Heisenberg uncertainty relations involving variance.