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:2311.06029 · Physical Review A

Nonlocal quantum state ensembles and quantum data hiding

Donghoon Ha, Jeong San Kim

Published May 10, 2024• 7 citations
arXivHTMLPDF

Abstract

We consider the discrimination of bipartite quantum states and establish a relation between a nonlocal quantum state ensemble and quantum data-hiding processing. Using a bound on the optimal local discrimination of bipartite quantum states, we provide a sufficient condition for a bipartite quantum state ensemble to be used to construct a quantum data-hiding scheme. Our results are illustrated with examples in multidimensional bipartite quantum systems.

DOI
10.1103/physreva.109.052418

Related papers

Quantum data-hiding scheme using orthogonal separable states

Donghoon Ha, Jeong San Kim

We consider bipartite quantum state discrimination and present a quantum data-hiding scheme utilizing an orthogonal separable state ensemble. Using a bound on local minimum-error discrimination, we provide a sufficient condition for the separable state ensemble to be used in constructing a quantum data-hiding scheme. Our results are illustrated with various examples in bipartite quantum systems. As our scheme employs separable states of low-dimensional quantum systems, it becomes more feasible for practical implementation.

arXiv:2502.18656•Physical Review A•May 2, 2025•0 citations

Quantum data hiding with two-qubit separable states

Donghoon Ha, Jeong San Kim

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.

quant-pharXiv:2512.15095•Dec 18, 2025•0 citations

Multi-player quantum data hiding by nonlocal quantum state ensembles

Donghoon Ha, Jeong San Kim

Abstract We provide multi-player quantum data hiding based on nonlocal quantum state ensembles arising from multi-party quantum state discrimination. Using bounds on local minimum-error discrimination of multi-party quantum states, we construct a multi-player quantum data-hiding scheme. Our data-hiding scheme can be used to hide multiple bits, asymptotically, unless all the players collaborate. We also illustrate our results by examples of nonlocal quantum state ensembles.

arXiv:2403.14363•Quantum Information Processing•May 12, 2025•0 citations

Bound on local minimum-error discrimination of bipartite quantum states

Donghoon Ha, Jeong San Kim

We consider the optimal discrimination of bipartite quantum states and provide an upper bound for the maximum success probability of optimal local discrimination. We also provide a necessary and sufficient condition for a measurement to realize the upper bound. We further establish a necessary and sufficient condition for this upper bound to be saturated. Finally, we illustrate our results using an example.

arXiv:2112.14424•Physical Review A•Mar 10, 2022•8 citations

(2,m)-threshold quantum data hiding

Donghoon Ha, Jeong San Kim

We consider multiparty quantum state discrimination and present a multiparty quantum data-hiding scheme for one classical bit to be shared among multiple parties. In the proposed scheme, any pair of parties can collaborate to perfectly recover the hidden bit through a joint measurement, whereas measurements based on local operations and classical communication(LOCC) performed even by all parties reveal only an arbitrarily small amount of information. We further provide bounds on the optimal LOCC discrimination of multiparty quantum states. The proposed scheme can be implemented using only separable states of low-dimensional quantum systems, enhancing its practical feasibility.

quant-pharXiv:2607.08070•Journal of Physics A Mathematical and Theoretical•Jul 10, 2026•0 citations

Bound on optimal local discrimination of multipartite quantum states

Donghoon Ha, Jeong San Kim

We consider the unambiguous discrimination of multipartite quantum states and provide an upper bound for the maximum success probability of optimal local discrimination. We also provide a necessary and sufficient condition to realize the upper bound. We further establish a necessary and sufficient condition for this upper bound to be saturated. Finally, we illustrate our results using examples in multidimensional multipartite quantum systems.

arXiv:2204.12830•Scientific Reports•Aug 19, 2022•3 citations
We consider the discrimination of bipartite quantum states and establish a relation between a nonlocal quantum state ensemble and quantum data-hiding processing. Using a bound on the optimal local discrimination of bipartite quantum states, we provide a sufficient condition for a bipartite quantum state ensemble to be used to construct a quantum data-hiding scheme. Our results are illustrated with examples in multidimensional bipartite quantum systems.
We consider bipartite quantum state discrimination and present a quantum data-hiding scheme utilizing an orthogonal separable state ensemble. Using a bound on local minimum-error discrimination, we provide a sufficient condition for the separable state ensemble to be used in constructing a quantum data-hiding scheme. Our results are illustrated with various examples in bipartite quantum systems. As our scheme employs separable states of low-dimensional quantum systems, it becomes more feasible for practical implementation.
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.
We consider multiparty quantum state discrimination and present a multiparty quantum data-hiding scheme for one classical bit to be shared among multiple parties. In the proposed scheme, any pair of parties can collaborate to perfectly recover the hidden bit through a joint measurement, whereas measurements based on local operations and classical communication(LOCC) performed even by all parties reveal only an arbitrarily small amount of information. We further provide bounds on the optimal LOCC discrimination of multiparty quantum states. The proposed scheme can be implemented using only separable states of low-dimensional quantum systems, enhancing its practical feasibility.