Self-testing of a single quantum device under computational assumptions
- URL: http://arxiv.org/abs/2001.09161v4
- Date: Tue, 17 May 2022 15:07:50 GMT
- Title: Self-testing of a single quantum device under computational assumptions
- Authors: Tony Metger, Thomas Vidick
- Abstract summary: Self-testing is a method to characterise an arbitrary quantum system based only on its classical input-output correlations.
We replace the setting of multiple non-communicating parties, which is difficult to enforce in practice, by a single computationally bounded party.
- Score: 7.716156977428555
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Self-testing is a method to characterise an arbitrary quantum system based
only on its classical input-output correlations, and plays an important role in
device-independent quantum information processing as well as quantum complexity
theory. Prior works on self-testing require the assumption that the system's
state is shared among multiple parties that only perform local measurements and
cannot communicate. Here, we replace the setting of multiple non-communicating
parties, which is difficult to enforce in practice, by a single computationally
bounded party. Specifically, we construct a protocol that allows a classical
verifier to robustly certify that a single computationally bounded quantum
device must have prepared a Bell pair and performed single-qubit measurements
on it, up to a change of basis applied to both the device's state and
measurements. This means that under computational assumptions, the verifier is
able to certify the presence of entanglement, a property usually closely
associated with two separated subsystems, inside a single quantum device. To
achieve this, we build on techniques first introduced by Brakerski et al.
(2018) and Mahadev (2018) which allow a classical verifier to constrain the
actions of a quantum device assuming the device does not break post-quantum
cryptography.
Related papers
- Self-testing memory-bounded quantum computers [0.1874930567916036]
In a single-device setup, we propose a protocol called quantum system quizzing.
This protocol achieves self-testing of an entire quantum model given by state preparation, gates, and measurement in a black-box scenario.
We identify sets of instructions which self-test multi-qubit universal gate sets for arbitrary numbers of qubits, delivering the first sound certification tool for memory-bounded quantum computers.
arXiv Detail & Related papers (2024-11-06T19:23:45Z) - 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) - Measurement-Device-Independent Detection of Beyond-Quantum State [53.64687146666141]
We propose a measurement-device-independent (MDI) test for beyond-quantum state detection.
We discuss the importance of tomographic completeness of the input sets to the detection.
arXiv Detail & Related papers (2023-12-11T06:40:13Z) - Simple Tests of Quantumness Also Certify Qubits [69.96668065491183]
A test of quantumness is a protocol that allows a classical verifier to certify (only) that a prover is not classical.
We show that tests of quantumness that follow a certain template, which captures recent proposals such as (Kalai et al., 2022) can in fact do much more.
Namely, the same protocols can be used for certifying a qubit, a building-block that stands at the heart of applications such as certifiable randomness and classical delegation of quantum computation.
arXiv Detail & Related papers (2023-03-02T14:18:17Z) - Certification of entangled quantum states and quantum measurements in
Hilbert spaces of arbitrary dimension [0.0]
Device-independent (DI) certification of composite quantum systems has attracted considerable attention lately.
In this thesis, we construct schemes to device-independently certify quantum states and quantum measurements in Hilbert spaces of arbitrary dimension.
arXiv Detail & Related papers (2023-02-02T18:54: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) - 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) - Certification of incompatible measurements using quantum steering [0.0]
We consider the problem of certification of quantum measurements with an arbitrary number of outcomes.
We propose a simple scheme for certifying any set of $d$-outcome projective measurements which do not share any common invariant proper subspace.
arXiv Detail & Related papers (2021-07-01T13:04:47Z) - Sample-efficient device-independent quantum state verification and
certification [68.8204255655161]
Authentication of quantum sources is a crucial task in building reliable and efficient protocols for quantum-information processing.
We develop a systematic approach to device-independent verification of quantum states free of IID assumptions in the finite copy regime.
We show that device-independent verification can be performed with optimal sample efficiency.
arXiv Detail & Related papers (2021-05-12T17:48: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.