Skip to main content

Device-independent verifiable blind quantum computation

Hajdusek, Michal, Pérez-Delgado, Carlos A, Fitzsimons, Joseph F (2015) Device-independent verifiable blind quantum computation. arXiv preprint arXiv:1502.02563, . (Unpublished) (KAR id:58189)

PDF Pre-print
Language: English
Download (544kB) Preview
[thumbnail of 1502.02563v2.pdf]
This file may not be suitable for users of assistive technology.
Request an accessible format
Official URL:


As progress on experimental quantum processors continues to advance, the problem of verifying the correct operation of such devices is becoming a pressing concern. The recent discovery of protocols for verifying computation performed by entangled but non-communicating quantum processors holds the promise of certifying the correctness of arbitrary quantum computations in a fully device-independent manner. Unfortunately, all known schemes have prohibitive overhead, with resources scaling as extremely high degree polynomials in the number of gates constituting the computation. Here we present a novel approach based on a combination of verified blind quantum computation and Bell state self-testing. This approach has dramatically reduced overhead, with resources scaling as only O(m4lnm) in the number of gates.

Item Type: Article
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 75 Electronic computers. Computer science
Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Q Science > QC Physics > QC174.12 Quantum theory
Divisions: Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
Depositing User: Carlos Perez Delgado
Date Deposited: 28 Oct 2016 15:15 UTC
Last Modified: 06 Dec 2022 11:54 UTC
Resource URI: (The current URI for this page, for reference purposes)
Pérez-Delgado, Carlos A:
  • Depositors only (login required):


Downloads per month over past year