Quantum data hiding

DOI10.1109/18.985948zbMath1071.81511DBLPjournals/tit/DiVincenzoLT02arXivquant-ph/0103098OpenAlexW3100536493WikidataQ59434794 ScholiaQ59434794MaRDI QIDQ4544815

Barbara M. Terhal, David P. DiVincenzo, Debbie W. Leung

Publication date: 4 August 2002

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/quant-ph/0103098

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum measurement theory, state operations, state preparations (81P15) Authentication, digital signatures and secret sharing (94A62)

Related Items (76)

Round efficient secure multiparty quantum computation with identifiable abort ⋮ Quantum steganography for multi-party covert communication ⋮ Unextendible product operator basis ⋮ Mixing and localization in random time-periodic quantum circuits of Clifford unitaries ⋮ Local distinguishability of generalized Bell states ⋮ On small set of one-way LOCC indistinguishability of maximally entangled states ⋮ DISTINGUISHING UNENTANGLED STATES WITH AN UNENTANGLED MEASUREMENT ⋮ Strong quantum nonlocality for unextendible product bases in heterogeneous systems ⋮ Quantum steganography using prior entanglement ⋮ Misdirection steganography ⋮ Effects of quantum noises on \(\chi\) state-based quantum steganography protocol ⋮ On the mixed-unitary rank of quantum channels ⋮ Approximate unitary 3-designs from transvection Markov chains ⋮ Ultimate data hiding in quantum mechanics and beyond ⋮ Asymptotic state discrimination and a strict hierarchy in distinguishability norms ⋮ How to efficiently select an arbitrary Clifford group element ⋮ Distinguishing multi-partite states by local measurements ⋮ The local distinguishability of any three generalized Bell states ⋮ Representations of the multi-qubit Clifford group ⋮ Entanglement, quantum randomness, and complexity beyond scrambling ⋮ The construction of sets with strong nonlocality using fewer states ⋮ Discrimination of quantum states under locality constraints in the many-copy setting ⋮ A holographic derivation of the weak gravity conjecture ⋮ Local indistinguishability and possibility of hiding cbits in activable bound entangled states ⋮ Entanglement as a resource to locally distinguish tripartite quantum states ⋮ Using entanglement more efficiently in distinguishing orthogonal product states by LOCC ⋮ Chaos and complexity by design ⋮ Locally distinguishable maximally entangled states by two-way LOCC ⋮ Zero-error correctibility and phase retrievability for twirling channels ⋮ Efficient unitary designs with a system-size independent number of non-Clifford gates ⋮ Quantum advantage of resources in data hiding ⋮ Locally distinguishing multipartite orthogonal product states with different entanglement resource ⋮ Entanglement sharing in real-vector-space quantum theory ⋮ A Decoupling Approach to the Quantum Capacity ⋮ Metric and classical fidelity uncertainty relations for random unitary matrices ⋮ Deterministic twirling with low resources ⋮ Evenly distributed unitaries: On the structure of unitary designs ⋮ LOCC distinguishability of unilaterally transformable quantum states ⋮ Optimal networks for quantum metrology: semidefinite programs and product rules ⋮ On the Chernoff distance for asymptotic LOCC discrimination of bipartite quantum states ⋮ Everything you always wanted to know about LOCC (but were afraid to ask) ⋮ Dualities and identities for entanglement-assisted quantum codes ⋮ Quantum secret sharing with continuous variable graph state ⋮ Decoupling with unitary approximate two-designs ⋮ Entanglement reactivation in separable environments ⋮ Limitations of semidefinite programs for separable states and entangled games ⋮ Generating a statet-design by diagonal quantum circuits ⋮ Twirling channels have minimal mixed-unitary rank ⋮ Transitions in entanglement complexity in random quantum circuits by measurements ⋮ Local discrimination of orthogonal product states with a two-qubit maximally entangled state ⋮ LOCC protocols with bounded width per round optimize convex functions ⋮ Multi-party quantum steganography ⋮ DIAGONAL-UNITARY 2-DESIGN AND THEIR IMPLEMENTATIONS BY QUANTUM CIRCUITS ⋮ Unifying typical entanglement and coin tossing: on randomization in probabilistic theories ⋮ Comment on ``Random quantum circuits are approximate 2-designs by A.W. Harrow and R.A. Low (Commun. Math. Phys. 291, 257-302 (2009)) ⋮ Unitary 2-designs from random X- and Z-diagonal unitaries ⋮ Randomizing quantum states: constructions and applications ⋮ Faithful squashed entanglement ⋮ Exponential decay of correlations implies area law ⋮ One-shot randomized and nonrandomized partial decoupling ⋮ Quantumness of correlations, quantumness of ensembles and quantum data hiding ⋮ Study of tangle on the three qubit Werner states by using of twirl operation ⋮ BASIC OPERATIONS AMONG ENTANGLED STATES AND THEIR APPLICATIONS TO QUANTUM PROTOCOLS ⋮ The locking-decoding frontier for generic dynamics ⋮ Security of Quantum Bit String Commitment Depends on the Information Measure ⋮ Random quantum circuits are approximate 2-designs ⋮ Hilbert's projective metric in quantum information theory ⋮ Composite parameterization and Haar measure for all unitary and special unitary groups ⋮ Quantum entanglement as a resource to locally distinguish orthogonal product states ⋮ Small set of orthogonal product states with nonlocality ⋮ Local distinguishability of generalized Bell states with one ebit of entanglement ⋮ Inaccessible entanglement in symmetry protected topological phases ⋮ Constructions of locally distinguishable sets of maximally entangled states which require two-way LOCC ⋮ Distinguishing classically indistinguishable states and channels ⋮ On the explicit constructions of certain unitaryt-designs ⋮ Local distinguishability based genuinely quantum nonlocality without entanglement

This page was built for publication: Quantum data hiding