Entanglement-assisted quantum communication with simple measurements

• URL: http://arxiv.org/abs/2205.09602v3
• Date: Sat, 20 May 2023 11:01:05 GMT
• Title: Entanglement-assisted quantum communication with simple measurements
• Authors: Am\'elie Piveteau, Jef Pauwels, Emil H{\aa}kansson, Sadiq Muhammad, Mohamed Bourennane, Armin Tavakoli
• Abstract summary: 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.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Dense coding is the seminal example of how entanglement can boost qubit communication, from sending one bit to sending two bits. This is made possible by projecting separate particles onto a maximally entangled basis. We investigate more general communication tasks, in both theory and experiment, and show that simpler measurements enable strong and sometimes even optimal entanglement-assisted qubit communication protocols. Using only partial Bell state analysers for two qubits, we demonstrate quantum correlations that cannot be simulated with two bits of classical communication. Then, we show that there exists an established and operationally meaningful task for which product measurements are sufficient for the strongest possible quantum predictions based on a maximally entangled two-qubit state. 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.

Related papers

• Quantum networks using counterfactual quantum communication [0.0]
  We propose a new counterfactual quantum communication protocol for transmitting an entangled state from a pair of electrons to two independent photons. We show that the protocol finds uses in building quantum repeaters leading to a counterfactual quantum network.
  arXiv  Detail & Related papers  (2024-01-30T19:27:09Z)
• Neural Network Approach to the Simulation of Entangled States with One Bit of Communication [0.0]
  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.
  arXiv  Detail & Related papers  (2023-05-31T15:19:00Z)
• Weak entanglement improves quantum communication using only product measurements [0.0]
  We introduce a communication task corresponding to the cryptographic primitive known as secret sharing. We show that all steerable two-qubit isotropic states provide a quantum advantage in the success rate using only product measurements. We then consider a variant of secret sharing based on more sophisticated, yet standard, partial Bell state analysers.
  arXiv  Detail & Related papers  (2023-03-14T13:48:19Z)
• Robust certification of unsharp instruments through sequential quantum advantages in a prepare-measure communication game [1.7205106391379026]
  We propose a specific two-party communication game in the prepare-measure scenario that relies on an encoding-decoding task of specific information. We first demonstrate that quantum theory outperforms the classical preparation non-contextual theory, and the optimal quantum success probability of such a communication game enables the semi-device-independent certification of qubit states and measurements.
  arXiv  Detail & Related papers  (2022-12-29T07:54:45Z)
• Oblivious Quantum Computation and Delegated Multiparty Quantum Computation [61.12008553173672]
  We propose a new concept, oblivious computation quantum computation, where secrecy of the input qubits and the program to identify the quantum gates are required. Exploiting quantum teleportation, we propose a two-server protocol for this task. Also, we discuss delegated multiparty quantum computation, in which, several users ask multiparty quantum computation to server(s) only using classical communications.
  arXiv  Detail & Related papers  (2022-11-02T09:01:33Z)
• 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)
• 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)
• Information Scrambling in Computationally Complex Quantum Circuits [56.22772134614514]
  We experimentally investigate the dynamics of quantum scrambling on a 53-qubit quantum processor. We show that while operator spreading is captured by an efficient classical model, operator entanglement requires exponentially scaled computational resources to simulate.
  arXiv  Detail & Related papers  (2021-01-21T22:18:49Z)
• 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)
• Experimental characterisation of unsharp qubit observables and sequential measurement incompatibility via quantum random access codes [0.0]
  We report an experimental implementation of unsharp qubit measurements in a sequential communication protocol. The protocol involves three parties; the first party prepares a qubit system, the second party performs operations which return a classical and quantum outcome, and the latter is measured by the third party.
  arXiv  Detail & Related papers  (2020-01-14T13:37:04Z)

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.