Quantum Advantage in Information Retrieval
- URL: http://arxiv.org/abs/2007.15643v2
- Date: Thu, 19 Nov 2020 19:00:19 GMT
- Title: Quantum Advantage in Information Retrieval
- Authors: Pierre-Emmanuel Emeriau, Mark Howard, Shane Mansfield
- Abstract summary: We introduce a related task - the Torpedo Game - and show that it admits greater quantum advantage than the comparable random access code.
We pinpoint a characteristic of quantum systems that enables quantum advantage in any bounded-memory information retrieval task.
Our perfect qutrit strategy for the Torpedo Game entails the strongest type of inconsistency with non-contextual hidden variables.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Random access codes have provided many examples of quantum advantage in
communication, but concern only one kind of information retrieval task. We
introduce a related task - the Torpedo Game - and show that it admits greater
quantum advantage than the comparable random access code. Perfect quantum
strategies involving prepare-and-measure protocols with experimentally
accessible three-level systems emerge via analysis in terms of the discrete
Wigner function. The example is leveraged to an operational advantage in a
pacifist version of the strategy game Battleship. We pinpoint a characteristic
of quantum systems that enables quantum advantage in any bounded-memory
information retrieval task. While preparation contextuality has previously been
linked to advantages in random access coding we focus here on a different
characteristic called sequential contextuality. It is shown not only to be
necessary and sufficient for quantum advantage, but also to quantify the degree
of advantage. Our perfect qutrit strategy for the Torpedo Game entails the
strongest type of inconsistency with non-contextual hidden variables, revealing
logical paradoxes with respect to those assumptions.
Related papers
- Characterizing Contextuality via Rank Separation with Applications to Cloning [0.0]
Quantum contextuality is a key nonclassical feature essential for understanding advantages in quantum computation and communication.
We introduce a new framework to study contextuality based solely on information processing statistics.
We show that quantum contextuality provides the resource in optimal phase-covariant and universal cloning schemes.
arXiv Detail & Related papers (2024-06-27T17:56:04Z) - 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) - A Cryptographic Perspective on the Verifiability of Quantum Advantage [5.857929080874288]
This paper investigates the verification of quantum advantage from a cryptographic perspective.
We establish a strong connection between the verifiability of quantum advantage and cryptographic and complexity primitives.
Our work shows that the quest for verifiable quantum advantages may lead to applications of quantum cryptography.
arXiv Detail & Related papers (2023-10-23T00:31:51Z) - 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) - Quantum contextuality provides communication complexity advantage [0.683495465775299]
We show that for any quantum state and observables of sufficiently small dimension producing contextuality, there exists a communication task with quantum advantage.
We show how to convert each of these communication tasks into a semi-device independent protocol for quantum key distribution.
arXiv Detail & Related papers (2022-05-06T15:40:57Z) - Probably approximately correct quantum source coding [0.0]
Holevo's and Nayak's bounds give an estimate of the amount of classical information that can be stored in a quantum state.
We show two novel applications in quantum learning theory and delegated quantum computation with a purely classical client.
arXiv Detail & Related papers (2021-12-13T17:57:30Z) - 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) - Secure Two-Party Quantum Computation Over Classical Channels [63.97763079214294]
We consider the setting where the two parties (a classical Alice and a quantum Bob) can communicate only via a classical channel.
We show that it is in general impossible to realize a two-party quantum functionality with black-box simulation in the case of malicious quantum adversaries.
We provide a compiler that takes as input a classical proof of quantum knowledge (PoQK) protocol for a QMA relation R and outputs a zero-knowledge PoQK for R that can be verified by classical parties.
arXiv Detail & Related papers (2020-10-15T17:55:31Z) - 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) - Quantum noise protects quantum classifiers against adversaries [120.08771960032033]
Noise in quantum information processing is often viewed as a disruptive and difficult-to-avoid feature, especially in near-term quantum technologies.
We show that by taking advantage of depolarisation noise in quantum circuits for classification, a robustness bound against adversaries can be derived.
This is the first quantum protocol that can be used against the most general adversaries.
arXiv Detail & Related papers (2020-03-20T17:56:14Z)
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.