Metric and classical fidelity uncertainty relations for random unitary matrices

Abstract

We analyze uncertainty relations on finite dimensional Hilbert spaces expressed in terms of classical fidelity, which are stronger then metric uncertainty relations introduced by Fawzi, Hayden and Sen. We establish 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 ${\ell }_1^n({\ell }_2^m)$ with a better dimension/distortion dependence than allowed in previously known constructions.

References in corpus (20)

• Superadditivity of communication capacity using entangled inputs
• Everything You Always Wanted to Know About LOCC (But Were Afraid to Ask)
• Entropic uncertainty relations - A survey
• Quantum Data Hiding
• Randomizing quantum states: Constructions and applications
• Locking classical correlation in quantum states
• Hastings' additivity counterexample via Dvoretzky's theorem
• Entanglement thresholds for random induced states
• Spectral measures of powers of random matrices
• A Quantum Enigma Machine: Experimentally Demonstrating Quantum Data Locking
• From Low-Distortion Norm Embeddings to Explicit Uncertainty Relations and Efficient Information Locking
• Hiding Quantum Data
• Locking classical information
• Quantum-locked key distribution at nearly the classical capacity rate
• Non-additivity of Renyi entropy and Dvoretzky's Theorem
• Experimental quantum data locking
• Asymptotic entropic uncertainty relations
• Quantum data locking for high-rate private communication
• Almost-Euclidean subspaces of ${\ell }_1^N$ via tensor products: a simple approach to randomness reduction
• Quantum data hiding in the presence of noise

Cited by in corpus (4)

• Advances in Quantum Cryptography
• Probabilistic Simulation of Quantum Circuits with the Transformer
• Photonic quantum data locking
• Fault tolerant quantum data locking