Parallel self-testing of EPR pairs under computational assumptions
- URL: http://arxiv.org/abs/2201.13430v3
- Date: Mon, 5 Feb 2024 07:08:15 GMT
- Title: Parallel self-testing of EPR pairs under computational assumptions
- Authors: Honghao Fu, Daochen Wang, Qi Zhao
- Abstract summary: We show that a single EPR pair of a single quantum device can be self-tested under computational assumptions.
We show that our protocol can be passed with probability negligibly close to $1$ by an honest quantum device.
A simplified version of our protocol is the first that can efficiently certify an arbitrary number of qubits of a single cloud quantum computer.
- Score: 12.847847919343646
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Self-testing is a fundamental feature of quantum mechanics that allows a
classical verifier to force untrusted quantum devices to prepare certain states
and perform certain measurements on them. The standard approach assumes at
least two spatially separated devices. Recently, Metger and Vidick [Quantum,
2021] showed that a single EPR pair of a single quantum device can be
self-tested under computational assumptions. In this work, we generalize their
results to give the first parallel self-test of $N$ EPR pairs and measurements
on them in the single-device setting under the same computational assumptions.
We show that our protocol can be passed with probability negligibly close to
$1$ by an honest quantum device using poly$(N)$ resources. Moreover, we show
that any quantum device that fails our protocol with probability at most
$\epsilon$ must be poly$(N,\epsilon)$-close to being honest in the appropriate
sense. In particular, our protocol can test any distribution over tensor
products of computational or Hadamard basis measurements, making it suitable
for applications such as device-independent quantum key distribution under
computational assumptions. Moreover, a simplified version of our protocol is
the first that can efficiently certify an arbitrary number of qubits of a
single cloud quantum computer using only classical communication.
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) - Certifying classes of $d$-outcome measurements with quantum steering [49.1574468325115]
We provide a construction of a family of steering inequalities tailored to large classes of $d$-outcomes projective measurements.
We prove that the maximal quantum violation of those inequalities can be used for certification of those measurements and the maximally entangled state of two qudits.
arXiv Detail & Related papers (2024-10-27T15:32:53Z) - Single-Round Proofs of Quantumness from Knowledge Assumptions [41.94295877935867]
A proof of quantumness is an efficiently verifiable interactive test that an efficient quantum computer can pass.
Existing single-round protocols require large quantum circuits, whereas multi-round ones use smaller circuits but require experimentally challenging mid-circuit measurements.
We construct efficient single-round proofs of quantumness based on existing knowledge assumptions.
arXiv Detail & Related papers (2024-05-24T17:33:10Z) - Simulation of IBM's kicked Ising experiment with Projected Entangled
Pair Operator [71.10376783074766]
We perform classical simulations of the 127-qubit kicked Ising model, which was recently emulated using a quantum circuit with error mitigation.
Our approach is based on the projected entangled pair operator (PEPO) in the Heisenberg picture.
We develop a Clifford expansion theory to compute exact expectation values and use them to evaluate algorithms.
arXiv Detail & Related papers (2023-08-06T10:24:23Z) - Quantum delegation with an off-the-shelf device [3.3766484312332303]
We show how to delegate-time quantum computations in the OTS model.
This provides the first relativistic (one-round), two-prover zero-knowledge proof system for QMA.
As a proof approach, we provide a new self-test for n EPR pairs using only constant-sized Pauli measurements.
arXiv Detail & Related papers (2023-04-07T02:43:06Z) - Parallel remote state preparation for fully device-independent
verifiable blind quantum computation [0.0]
We construct a parallel self-testing protocol to perform device-independent remote state preparation of $n$ qubits.
We compose this with the unconditionally secure universal verifiable blind quantum computation scheme of J. F. Fitzsimons and E. Kashefi.
arXiv Detail & Related papers (2022-12-11T08:17:43Z) - Validation tests of GBS quantum computers give evidence for quantum
advantage with a decoherent target [62.997667081978825]
We use positive-P phase-space simulations of grouped count probabilities as a fingerprint for verifying multi-mode data.
We show how one can disprove faked data, and apply this to a classical count algorithm.
arXiv Detail & Related papers (2022-11-07T12:00:45Z) - 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) - Preparation of excited states for nuclear dynamics on a quantum computer [117.44028458220427]
We study two different methods to prepare excited states on a quantum computer.
We benchmark these techniques on emulated and real quantum devices.
These findings show that quantum techniques designed to achieve good scaling on fault tolerant devices might also provide practical benefits on devices with limited connectivity and gate fidelity.
arXiv Detail & Related papers (2020-09-28T17:21:25Z) - Quantum Gram-Schmidt Processes and Their Application to Efficient State
Read-out for Quantum Algorithms [87.04438831673063]
We present an efficient read-out protocol that yields the classical vector form of the generated state.
Our protocol suits the case that the output state lies in the row space of the input matrix.
One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
arXiv Detail & Related papers (2020-04-14T11:05:26Z) - Self-testing of a single quantum device under computational assumptions [7.716156977428555]
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.
arXiv Detail & Related papers (2020-01-24T19:00:15Z)
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.