Parallel remote state preparation for fully device-independent verifiable blind quantum computation

• URL: http://arxiv.org/abs/2212.05442v1
• Date: Sun, 11 Dec 2022 08:17:43 GMT
• Title: Parallel remote state preparation for fully device-independent verifiable blind quantum computation
• Authors: Sean A. Adamson
• Abstract summary: 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.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We introduce a device-independent two-prover scheme in which a classical verifier is able to use a simple untrusted quantum measurement device (the client device) to securely delegate a quantum computation to an untrusted quantum server. To do this, we construct a parallel self-testing protocol to perform device-independent remote state preparation of $n$ qubits and compose this with the unconditionally secure universal verifiable blind quantum computation (VBQC) scheme of J. F. Fitzsimons and E. Kashefi [Phys. Rev. A 96, 012303 (2017)]. Our self-test achieves a multitude of desirable properties for the application we consider, giving rise to practical and fully device-independent VBQC. It certifies parallel measurements of all cardinal and intercardinal directions in the $XY$-plane as well as the computational basis, uses few input questions (of size logarithmic in $n$ for the client and a constant number communicated to the server), and requires only single-qubit measurements to be performed by the client device.

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)
• Verification of Quantum Computations without Trusted Preparations or Measurements [0.6249768559720122]
  We present a modular, composable, and efficient way to turn known verification schemes into protocols that rely only on trusted gates. Our first contribution is an extremely lightweight reduction of the problem of quantum verification for BQP to the trusted application of single-qubit rotations around the Z axis and bit flips. The second construction shows that it is generally possible to information-theoretically verify arbitrary quantum computations with quantum output without trusted preparations or measurements.
  arXiv  Detail & Related papers  (2024-03-15T16:54:28Z)
• 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)
• 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)
• Delegated variational quantum algorithms based on quantum homomorphic encryption [69.50567607858659]
  Variational quantum algorithms (VQAs) are one of the most promising candidates for achieving quantum advantages on quantum devices. The private data of clients may be leaked to quantum servers in such a quantum cloud model. A novel quantum homomorphic encryption (QHE) scheme is constructed for quantum servers to calculate encrypted data.
  arXiv  Detail & Related papers  (2023-01-25T07:00:13Z)
• 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)
• QSAN: A Near-term Achievable Quantum Self-Attention Network [73.15524926159702]
  Self-Attention Mechanism (SAM) is good at capturing the internal connections of features. A novel Quantum Self-Attention Network (QSAN) is proposed for image classification tasks on near-term quantum devices.
  arXiv  Detail & Related papers  (2022-07-14T12:22:51Z)
• Parallel self-testing of EPR pairs under computational assumptions [12.847847919343646]
  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.
  arXiv  Detail & Related papers  (2022-01-31T18:42:45Z)
• 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)
• 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.