Quantum data hiding with two-qubit separable states
Donghoon Ha, Jeong San Kim

TL;DR
This paper presents a quantum data-hiding scheme using two-qubit separable states, providing bounds and conditions for local discrimination, making practical implementation more feasible.
Contribution
It introduces a new data-hiding scheme based on two-qubit separable states and establishes conditions for its construction, enhancing practical quantum data hiding.
Findings
Bound on optimal local discrimination of two-party states
Sufficient condition for data-hiding scheme construction
Implementation with minimal-dimensional separable states
Abstract
We consider the discrimination of two-party quantum states and provide a quantum data-hiding scheme using two-qubit separable states. We first provide a bound on the optimal local discrimination of two-party quantum states, and establish a sufficient condition under which a two-party quantum state ensemble can be used to construct a data-hiding scheme. We illustrate this condition with examples of two-qubit state ensembles consisting of two orthogonal separable states. As our data-hiding scheme can be implemented with separable states of the lowest possible dimension, its practical realization becomes significantly more attainable.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Information and Cryptography · Quantum Computing Algorithms and Architecture · Quantum Mechanics and Applications
