Factorizability of multi-party quantum sequence discrimination under local operations and classical communication

• URL: http://arxiv.org/abs/2508.05050v1
• Date: Thu, 07 Aug 2025 06:05:45 GMT
• Title: Factorizability of multi-party quantum sequence discrimination under local operations and classical communication
• Authors: Donghoon Ha, Jeong San Kim,
• Abstract summary: We consider multi-party quantum sequence discrimination under local operations and classical communication(LOCC)<n>We provide conditions under which the optimal LOCC discrimination of a multi-party quantum sequence ensemble can be factorized into that of each individual ensemble.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We consider multi-party quantum sequence discrimination under local operations and classical communication(LOCC), and provide conditions under which the optimal LOCC discrimination of a multi-party quantum sequence ensemble can be factorized into that of each individual ensemble. In other words, the optimal LOCC discrimination of a multi-party quantum sequence ensemble can be achieved just by performing optimal LOCC discrimination independently at each step of the quantum sequence. We also illustrate through examples of multi-party quantum states that such factorizability of optimal LOCC discrimination is possible. We further establish a necessary and sufficient condition under which the optimal LOCC discrimination of a multi-party quantum state ensemble can be realized just by guessing the state with the largest probability. Our results can provide a useful application to investigate the fundamental limits of quantum data hiding.

Related papers

• Separable Power of Classical and Quantum Learning Protocols Through the Lens of No-Free-Lunch Theorem [70.42372213666553]
  The No-Free-Lunch (NFL) theorem quantifies problem- and data-independent generalization errors regardless of the optimization process. We categorize a diverse array of quantum learning algorithms into three learning protocols designed for learning quantum dynamics under a specified observable. Our derived NFL theorems demonstrate quadratic reductions in sample complexity across CLC-LPs, ReQu-LPs, and Qu-LPs. We attribute this performance discrepancy to the unique capacity of quantum-related learning protocols to indirectly utilize information concerning the global phases of non-orthogonal quantum states.
  arXiv  Detail & Related papers  (2024-05-12T09:05:13Z)
• Entanglement cost of discriminating quantum states under locality constraints [7.0937306686264625]
  We show that a pure state can be optimally discriminated against any other state with the assistance of a single Bell state. This study advances our understanding of the pivotal role played by entanglement in quantum state discrimination, serving as a crucial element in unlocking quantum data hiding against locally constrained measurements.
  arXiv  Detail & Related papers  (2024-02-28T16:16:50Z)
• Orthogonality Broadcasting and Quantum Position Verification [3.549868541921029]
  We introduce the study of "orthogonality broadcasting"<n>We provide a new method for establishing error bounds in the no pre-shared entanglement model.<n>Our key technical contribution is an uncertainty relation that uses the geometric relation of the states that undergo broadcasting rather than the non-commutative aspect of the final measurements.
  arXiv  Detail & Related papers  (2023-11-01T17:37:20Z)
• Bound on optimal local discrimination of multipartite quantum states [0.0]
  We consider the unambiguous discrimination of multipartite quantum states and provide an upper bound for the maximum success probability of optimal local discrimination. We illustrate our results using examples in multidimensional multipartite quantum systems.
  arXiv  Detail & Related papers  (2022-04-27T10:34:16Z)
• Deterministic Generation of Multipartite Entanglement via Causal Activation in the Quantum Internet [7.219077740523682]
  Entanglement represents textitthe'' key resource for several applications of quantum information processing. We propose a novel generation scheme exhibiting two attractive features. The only necessary condition is the possibility of coherently controlling -- according to the indefinite causal order framework -- the causal order among the unitaries acting on the qubits.
  arXiv  Detail & Related papers  (2021-12-01T15:02:34Z)
• Experimental violations of Leggett-Garg's inequalities on a quantum computer [77.34726150561087]
  We experimentally observe the violations of Leggett-Garg-Bell's inequalities on single and multi-qubit systems. Our analysis highlights the limits of nowadays quantum platforms, showing that the above-mentioned correlation functions deviate from theoretical prediction as the number of qubits and the depth of the circuit grow.
  arXiv  Detail & Related papers  (2021-09-06T14:35:15Z)
• Experimental multi-state quantum discrimination through a Quantum network [63.1241529629348]
  We have experimentally implemented two discrimination schemes in a minimum-error scenario based on a receiver featured by a network structure and a dynamical processing of information. The first protocol achieves binary optimal discrimination, while the second one provides a novel approach to multi-state quantum discrimination, relying on the dynamical features of the network-like receiver.
  arXiv  Detail & Related papers  (2021-07-21T09:26:48Z)
• 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)
• Simple upper and lower bounds on the ultimate success probability for discriminating arbitrary finite-dimensional quantum processes [2.538209532048866]
  We present a simple upper bound on the ultimate success probability for discriminating arbitrary quantum processes. In the special case of multi-shot channel discrimination, it can be shown that the ultimate success probability increases by at most a constant factor determined by the given channels. We also present a lower bound based on Bayesian updating, which has a low computational cost.
  arXiv  Detail & Related papers  (2020-12-27T01:14:23Z)
• Idler-Free Multi-Channel Discrimination via Multipartite Probe States [0.0]
  Multi-channel discrimination creates a scenario in which the discrimination of multiple quantum channels can be equated to the idea of pattern recognition. We develop general classes of unassisted multi-channel discrimination protocols which are not assisted by idler modes. Our findings uncover the existence of strongly quantum advantageous, idler-free protocols for the discrimination of bosonic loss and environmental noise.
  arXiv  Detail & Related papers  (2020-10-23T12:35:15Z)
• Using Quantum Metrological Bounds in Quantum Error Correction: A Simple Proof of the Approximate Eastin-Knill Theorem [77.34726150561087]
  We present a proof of the approximate Eastin-Knill theorem, which connects the quality of a quantum error-correcting code with its ability to achieve a universal set of logical gates. Our derivation employs powerful bounds on the quantum Fisher information in generic quantum metrological protocols.
  arXiv  Detail & Related papers  (2020-04-24T17:58:10Z)
• Fermionic state discrimination by local operations and classical communication [68.8204255655161]
  Local operations and classical communication (LOCC) discrimination between two bipartite pure states of fermionic systems is studied. We show that, contrary to the case of quantum systems, for fermionic systems it is generally not possible to achieve the ideal state discrimination performances.
  arXiv  Detail & Related papers  (2020-02-24T12:25:36Z)

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.