Ability of unbounded pairs of observers to achieve quantum advantage in random access codes with a single pair of qubits

• URL: http://arxiv.org/abs/2101.01227v3
• Date: Wed, 29 Dec 2021 15:57:42 GMT
• Title: Ability of unbounded pairs of observers to achieve quantum advantage in random access codes with a single pair of qubits
• Authors: Debarshi Das, Arkaprabha Ghosal, Ananda G. Maity, Som Kanjilal, Arup Roy
• Abstract summary: Complications in preparing and preserving quantum correlations stimulate recycling of a single quantum resource. We consider a scenario involving multiple independent pairs of observers acting with unbiased inputs on a single pair of spatially separated qubits sequentially.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Complications in preparing and preserving quantum correlations stimulate recycling of a single quantum resource in information processing and communication tasks multiple times. Here, we consider a scenario involving multiple independent pairs of observers acting with unbiased inputs on a single pair of spatially separated qubits sequentially. In this scenario, we address whether more than one pair of observers can demonstrate quantum advantage in some specific $2 \rightarrow 1$ and $3 \rightarrow 1$ random access codes. Interestingly, we not only address these in the affirmative, but also illustrate that unbounded pairs can exhibit quantum advantage. Furthermore, these results remain valid even when all observers perform suitable projective measurements and an appropriate separable state is initially shared.

Related papers

• Quantum Advantage: A Single Qubit's Experimental Edge in Classical Data Storage [5.914006659564735]
  We implement an experiment on a photonic quantum processor establishing efficacy of an elementary quantum system in classical information storage. The advantage is established by considering a class of simple bipartite games played with the communication resource qubit and classical bit (c-bit) In addition to demonstrating a robust communication advantage of a single qubit our experiment also opens avenues for immediate applications in near-term quantum technologies.
  arXiv  Detail & Related papers  (2024-03-05T05:09:32Z)
• Randomness-free Test of Non-classicality: a Proof of Concept [0.0]
  Existing schemes to certify such non-classical resources in a device-independent manner require seed randomness. We propose and experimentally implement a semi-device independent certification technique for both quantum correlations and non-projective measurements without seed randomness.
  arXiv  Detail & Related papers  (2023-03-13T10:44:16Z)
• 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)
• Semi-device independent certification of multiple unsharpness parameters through sequential measurements [2.28438857884398]
  We provide semi-device independent self-testing protocols to certify multiple unsharpness parameters along with the states and the measurement settings. This is achieved through the sequential quantum advantage shared by multiple independent observers in a suitable communication game known as parity-oblivious random-access-code.
  arXiv  Detail & Related papers  (2021-12-29T14:07:18Z)
• 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)
• 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)
• Both qubits of the singlet state can be steered simultaneously by multiple independent observers via sequential measurement [10.918291217470799]
  A subsystem in entangled pairs can share nonlocality with multiple observers in sequence. It is found that the two qubits in singlet state can be simultaneously steered by two sequential observers.
  arXiv  Detail & Related papers  (2021-02-24T09:37:55Z)
• 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)
• 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)
• Quantum Advantage for Shared Randomness Generation [0.0]
  We show that quantum systems provide an advantage over their classical counterpart. In a resource theoretic set-up, this feature of quantum systems can be interpreted as an advantage in winning a two players co-operative game. Protocols presented here are noise-robust and hence should be realizable with state-of-the-art quantum devices.
  arXiv  Detail & Related papers  (2020-01-07T05:02:51Z)

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.