(2,m)-threshold quantum data hiding
- URL: http://arxiv.org/abs/2607.08070v1
- Date: Thu, 09 Jul 2026 02:58:24 GMT
- Title: (2,m)-threshold quantum data hiding
- Abstract summary: We consider multiparty quantum state discrimination and present a multiparty quantum data-hiding scheme for one classical bit to be shared among multiple parties.<n>In the proposed scheme, any pair of parties can collaborate to perfectly recover the hidden bit through a joint measurement.<n> measurements based on local operations and classical communication(LOCC) performed even by all parties reveal only an arbitrarily small amount of information.
- Score: 0.48342038441006796
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: 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.
Related papers
- Sharing quantum indistinguishability with multiple parties [0.8024955346582039]
We present a sequential state-discrimination scheme that enables multiple parties to share quantum uncertainty.<n>We show how our scheme would work through a number of examples where ensembles may or may not contain symmetries.
arXiv Detail & Related papers (2025-12-17T08:49:49Z) - Robustness of quantum data hiding against entangled catalysts and memory [47.791962198275066]
We develop a general framework for state discrimination that unifies catalytic and memory-assisted local discrimination protocols.<n>We prove that when the hiding states are separable, neither entangled catalysts nor quantum memory can increase the optimal discrimination probability.<n>In contrast, for some entangled states, a reusable quantum memory turns locally indistinguishable states into ones that can be discriminated almost perfectly.
arXiv Detail & Related papers (2025-11-06T14:36:36Z) - Quantum data-hiding scheme using orthogonal separable states [0.0]
We consider bipartite quantum state discrimination and present a quantum data-hiding scheme utilizing a separable state ensemble.<n>As our scheme employs separable states of low-dimensional quantum systems, it becomes more feasible for practical implementation.
arXiv Detail & Related papers (2025-02-25T21:33:41Z) - Multi-player quantum data hiding by nonlocal quantum state ensembles [0.0]
We provide multi-player quantum data hiding based on nonlocal quantum state ensembles.<n>Our data-hiding scheme can be used to hide multiple bits, unless all the players collaborate.
arXiv Detail & Related papers (2024-03-08T03:40:43Z) - Nonlocal quantum state ensembles and quantum data hiding [0.0]
We consider the discrimination of bipartite quantum states and establish a relation between nonlocal quantum state ensemble and quantum data hiding processing.
Our results are illustrated by examples in multidimensional bipartite quantum systems.
arXiv Detail & Related papers (2023-11-10T12:38:09Z) - Multipartite entanglement theory with entanglement-nonincreasing operations [55.2480439325792]
We extend the resource theory of entanglement for multipartite systems beyond the standard framework of local operations and classical communication.<n>We demonstrate that in this adjusted framework, the transformation rates between multipartite states are fundamentally dictated by the bipartite entanglement entropies of the respective quantum states.
arXiv Detail & Related papers (2023-05-30T12:53:56Z) - Multi-partite subspaces containing no locally inaccessible information [0.0]
We show that measurements on encoded qubits in two-dimensional subspaces may be performed locally.
This requires only local measurement and feed-forward of classical information.
Results may have practical applications to the measurement of encoded qubits in e.g. quantum secret sharing.
arXiv Detail & Related papers (2022-07-26T18:31:57Z) - Efficient Bipartite Entanglement Detection Scheme with a Quantum
Adversarial Solver [89.80359585967642]
Proposal reformulates the bipartite entanglement detection as a two-player zero-sum game completed by parameterized quantum circuits.
We experimentally implement our protocol on a linear optical network and exhibit its effectiveness to accomplish the bipartite entanglement detection for 5-qubit quantum pure states and 2-qubit quantum mixed states.
arXiv Detail & Related papers (2022-03-15T09:46:45Z) - Entanglement catalysis for quantum states and noisy channels [41.94295877935867]
We investigate properties of entanglement and its role for quantum communication.
For transformations between bipartite pure states, we prove the existence of a universal catalyst.
We further develop methods to estimate the number of singlets which can be established via a noisy quantum channel.
arXiv Detail & Related papers (2022-02-10T18:36:25Z) - Quantum communication complexity beyond Bell nonlocality [87.70068711362255]
Efficient distributed computing offers a scalable strategy for solving resource-demanding tasks.
Quantum resources are well-suited to this task, offering clear strategies that can outperform classical counterparts.
We prove that a new class of communication complexity tasks can be associated to Bell-like inequalities.
arXiv Detail & Related papers (2021-06-11T18:00:09Z) - Genuine Network Multipartite Entanglement [62.997667081978825]
We argue that a source capable of distributing bipartite entanglement can, by itself, generate genuine $k$-partite entangled states for any $k$.
We provide analytic and numerical witnesses of genuine network entanglement, and we reinterpret many past quantum experiments as demonstrations of this feature.
arXiv Detail & Related papers (2020-02-07T13:26:00Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.