Empirical Coordination of Quantum Correlations

• URL: http://arxiv.org/abs/2412.17119v4
• Date: Sun, 06 Apr 2025 19:39:47 GMT
• Title: Empirical Coordination of Quantum Correlations
• Authors: Husein Natur, Uzi Pereg,
• Abstract summary: We introduce the notion of empirical coordination for quantum correlations.<n>This makes empirical coordination a natural and operationally meaningful framework for quantum systems.<n>We discuss how our results provide new insights into the implementation and simulation of quantum nonlocal games.
• Score: 16.025002076222002
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We introduce the notion of empirical coordination for quantum correlations. Quantum mechanics enables the calculation of probabilities for experimental outcomes, emphasizing statistical averages rather than detailed descriptions of individual events. This makes empirical coordination a natural and operationally meaningful framework for quantum systems - particularly in the context of nonlocal games, which rely on repeated measurements to assess performance. We begin by analyzing networks with classical links, focusing on the cascade network. For this setting, we establish the optimal coordination rates, which indicate the minimal resources required to simulate a quantum state on average. Providing the users with shared randomness, before communication begins, does not affect the optimal rates for empirical coordination. Our analysis starts with a basic two-node scenario and extends to cascade networks, including the special case of a network with an isolated node. The results can be further generalized to other networks as our analysis includes a generic achievability scheme. The optimal rate formula involves optimization over a collection of state extensions. This is a unique feature of the quantum setting, as the classical parallel does not include optimization. As demonstrated through examples, the performance depends heavily on the choice of decomposition. We then extend the framework to networks with quantum links, focusing on a broadcast setting where the receivers have side information. Finally, we discuss how our results provide new insights into the implementation and simulation of quantum nonlocal games in the empirical regime.

Related papers

• Distributing quantum correlations through local operations and classical resources [0.0]
  Global quantum correlations, as characterized by the discord, can be distributed to quantum memories using a mixed state of information carriers.<n>We show that even more discord can be generated when the resource state undergoes correlated dephasing noise.
  arXiv  Detail & Related papers  (2024-08-10T08:42:06Z)
• eQMARL: Entangled Quantum Multi-Agent Reinforcement Learning for Distributed Cooperation over Quantum Channels [98.314893665023]
  Quantum computing has sparked a potential synergy between quantum entanglement and cooperation in multi-agent environments. Current state-of-the-art quantum MARL (QMARL) implementations rely on classical information sharing. eQMARL is a distributed actor-critic framework that facilitates cooperation over a quantum channel.
  arXiv  Detail & Related papers  (2024-05-24T18:43:05Z)
• Quantum Advantage: A Single Qubit's Experimental Edge in Classical Data Storage [5.669806907215807]
  We implement an experiment on a photonic quantum processor establishing efficacy of the elementary quantum system in classical information storage. Our work paves the way for immediate applications in near-term quantum technologies.
  arXiv  Detail & Related papers  (2024-03-05T05:09:32Z)
• Percolation Theories for Quantum Networks [5.004146855779428]
  Review paper discusses a fundamental question: how can entanglement be effectively and indirectly distributed between distant nodes in an imperfect quantum network? We show that the classical percolation frameworks do not uniquely define the network's indirect connectivity. This realization leads to the emergence of an alternative theory called concurrence percolation,'' which uncovers a previously unrecognized quantum advantage that emerges at large scales.
  arXiv  Detail & Related papers  (2023-10-27T18:24:58Z)
• Variational-quantum-eigensolver-inspired optimization for spin-chain work extraction [39.58317527488534]
  Energy extraction from quantum sources is a key task to develop new quantum devices such as quantum batteries. One of the main issues to fully extract energy from the quantum source is the assumption that any unitary operation can be done on the system. We propose an approach to optimize the extractable energy inspired by the variational quantum eigensolver (VQE) algorithm.
  arXiv  Detail & Related papers  (2023-10-11T15:59:54Z)
• Anticipative measurements in hybrid quantum-classical computation [68.8204255655161]
  We present an approach where the quantum computation is supplemented by a classical result. Taking advantage of its anticipation also leads to a new type of quantum measurements, which we call anticipative. In an anticipative quantum measurement the combination of the results from classical and quantum computations happens only in the end.
  arXiv  Detail & Related papers  (2022-09-12T15:47:44Z)
• General quantum correlation from nonreal values of Kirkwood-Dirac quasiprobability over orthonormal product bases [0.0]
  A general quantum correlation, wherein entanglement is a subset, has been recognized as a resource in a variety of schemes of quantum information processing and quantum technology. We show that it satisfies certain requirements expected for a quantifier of general quantum correlations. Our results suggest a deep connection between the general quantum correlation and the nonclassical values of the KD quasiprobability and the associated strange weak values.
  arXiv  Detail & Related papers  (2022-08-06T04:29:15Z)
• Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
  "Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation. We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
  arXiv  Detail & Related papers  (2021-12-09T19:00:00Z)
• Cluster-Promoting Quantization with Bit-Drop for Minimizing Network Quantization Loss [61.26793005355441]
  Cluster-Promoting Quantization (CPQ) finds the optimal quantization grids for neural networks. DropBits is a new bit-drop technique that revises the standard dropout regularization to randomly drop bits instead of neurons. We experimentally validate our method on various benchmark datasets and network architectures.
  arXiv  Detail & Related papers  (2021-09-05T15:15:07Z)
• 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 Federated Learning with Quantum Data [87.49715898878858]
  Quantum machine learning (QML) has emerged as a promising field that leans on the developments in quantum computing to explore large complex machine learning problems. This paper proposes the first fully quantum federated learning framework that can operate over quantum data and, thus, share the learning of quantum circuit parameters in a decentralized manner.
  arXiv  Detail & Related papers  (2021-05-30T12:19:27Z)
• Classical-quantum network coding: a story about tensor [0.0]
  We study the conditions to perform the distribution of a pure state on a quantum network using quantum operations. We develop a formalism which encompasses both types of distribution protocols.
  arXiv  Detail & Related papers  (2021-04-10T12:05:38Z)
• Concurrence Percolation in Quantum Networks [3.52359746858894]
  We introduce a new statistical theory, concurrence percolation theory (ConPT) We find that the entanglement transmission threshold predicted by ConPT is lower than the known classical-percolation-based results. ConPT also shows a percolation-like universal critical behavior derived by finite-size analysis on the Bethe lattice.
  arXiv  Detail & Related papers  (2021-03-25T17:14:48Z)
• Genuine quantum networks: superposed tasks and addressing [68.8204255655161]
  We show how to make quantum networks, both standard and entanglement-based, genuine quantum. We provide them with the possibility of handling superposed tasks and superposed addressing.
  arXiv  Detail & Related papers  (2020-04-30T18:00:06Z)
• Semidefinite tests for quantum network topologies [0.9176056742068814]
  Quantum networks play a major role in long-distance communication, quantum cryptography, clock synchronization, and distributed quantum computing. The question of which correlations a given quantum network can give rise to, remains almost uncharted. We show that constraints on the observable covariances, previously derived for the classical case, also hold for quantum networks.
  arXiv  Detail & Related papers  (2020-02-13T22:36:46Z)

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.