Neural Network Approach to the Simulation of Entangled States with One Bit of Communication

• URL: http://arxiv.org/abs/2305.19935v5
• Date: Fri, 29 Sep 2023 17:01:11 GMT
• Title: Neural Network Approach to the Simulation of Entangled States with One Bit of Communication
• Authors: Peter Sidajaya, Aloysius Dewen Lim, Baichu Yu, Valerio Scarani
• Abstract summary: Bell's theorem states that Local Hidden Variables cannot fully explain the statistics of measurements on some entangled quantum states. It is natural to ask how much supplementary classical communication would be needed to simulate them. We present evidence that all projective measurements on partially entangled pure two-qubit states require only one bit of communication.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Bell's theorem states that Local Hidden Variables (LHVs) cannot fully explain the statistics of measurements on some entangled quantum states. It is natural to ask how much supplementary classical communication would be needed to simulate them. We study two long-standing open questions in this field with neural network simulations and other tools. First, we present evidence that all projective measurements on partially entangled pure two-qubit states require only one bit of communication. We quantify the statistical distance between the exact quantum behaviour and the product of the trained network, or of a semianalytical model inspired by it. Second, while it is known on general grounds (and obvious) that one bit of communication cannot eventually reproduce all bipartite quantum correlation, explicit examples have proved evasive. Our search failed to find one for several bipartite Bell scenarios with up to 5 inputs and 4 outputs, highlighting the power of one bit of communication in reproducing quantum correlations.

Related papers

• Experimental quantum triangle network nonlocality with an AlGaAs multiplexed entangled photon source [0.9092013845117769]
  We show that quantum nonlocality without inputs can be demonstrated for sources with an arbitrarily small level of independence. We use a simulated triangle network to violate experimentally for the first time a Bell-like inequality. Our results allow us to deepen our understanding of network nonlocality while also pushing its practical relevance for quantum communication networks.
  arXiv  Detail & Related papers  (2024-10-09T13:21:11Z)
• Quantum coherence in networks [0.0]
  We show that verifying quantum coherence in a network scenario without the need for inputs is not necessary. We show that there exist probability distributions for joint outcomes of three parties in a triangular network. We derive nonlinear inequalities that are satisfied by classical correlations and find quantum states that violate them.
  arXiv  Detail & Related papers  (2024-07-15T18:00:01Z)
• A computational test of quantum contextuality, and even simpler proofs of quantumness [43.25018099464869]
  We show that an arbitrary contextuality game can be compiled into an operational "test of contextuality" involving a single quantum device. Our work can be seen as using cryptography to enforce spatial separation within subsystems of a single quantum device.
  arXiv  Detail & Related papers  (2024-05-10T19:30:23Z)
• Enhanced quantum state transfer: Circumventing quantum chaotic behavior [35.74056021340496]
  We show how to transfer few-particle quantum states in a two-dimensional quantum network. Our approach paves the way to short-distance quantum communication for connecting distributed quantum processors or registers.
  arXiv  Detail & Related papers  (2024-02-01T19:00:03Z)
• Classical Cost of Transmitting a Qubit [0.0]
  We show that the statistics obtained in any quantum protocol can be simulated by the purely classical means of shared randomness and two bits of communication. In particular, two bits of communication are enough to simulate all quantum correlations associated to arbitrary local POVMs applied to any entangled two-qubit state.
  arXiv  Detail & Related papers  (2022-07-05T18:06:45Z)
• Entanglement-assisted quantum communication with simple measurements [0.0]
  Dense coding is the seminal example of how entanglement can boost qubit communication. We show that measurements enable strong and sometimes even optimal entanglement-assisted qubit communication protocols. Our results reveal that there are scenarios in which the power of entanglement in enhancing quantum communication can be harvested in simple and scalable optical experiments.
  arXiv  Detail & Related papers  (2022-05-19T14:47:38Z)
• 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)
• 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)
• Entanglement in prepare-and-measure scenarios: many questions, a few answers [0.0]
  Entanglement and quantum communication are paradigmatic resources in quantum information science. Correlations due to entanglement when communication is absent have been studied in Bell scenarios. We focus on entanglement-assisted prepare-and-measure scenarios.
  arXiv  Detail & Related papers  (2021-08-01T12:22:00Z)
• Computation-aided classical-quantum multiple access to boost network communication speeds [61.12008553173672]
  We quantify achievable quantum communication rates of codes with computation property for a two-sender cq-MAC. We show that it achieves the maximum possible communication rate (the single-user capacity), which cannot be achieved with conventional design.
  arXiv  Detail & Related papers  (2021-05-30T11:19:47Z)
• Neural network quantum state tomography in a two-qubit experiment [52.77024349608834]
  Machine learning inspired variational methods provide a promising route towards scalable state characterization for quantum simulators. We benchmark and compare several such approaches by applying them to measured data from an experiment producing two-qubit entangled states. We find that in the presence of experimental imperfections and noise, confining the variational manifold to physical states greatly improves the quality of the reconstructed states.
  arXiv  Detail & Related papers  (2020-07-31T17:25:12Z)

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.