Securing Quantum Computations in the NISQ Era

Abstract

Recent experimental achievements motivate an ever-growing interest from companies starting to feel the limitations of classical computing. Yet, in light of ongoing privacy scandals, the future availability of quantum computing through remotely accessible servers pose peculiar challenges: Clients with quantum-limited capabilities want their data and algorithms to remain hidden, while being able to verify that their computations are performed correctly. Research in blind and verifiable delegation of quantum computing attempts to address this question. However, available techniques suffer not only from high overheads but also from over-sensitivity: When running on noisy devices, imperfections trigger the same detection mechanisms as malicious attacks, resulting in perpetually aborted computations. Hence, while malicious quantum computers are rendered harmless by blind and verifiable protocols, inherent noise severely limits their usability. We address this problem with an efficient, robust, blind, verifiable scheme to delegate deterministic quantum computations with classical inputs and outputs. We show that: 1) a malicious Server can cheat at most with an exponentially small success probability; 2) in case of sufficiently small noise, the protocol succeeds with a probability exponentially close to 1; 3) the overhead is barely a polynomial number of repetitions of the initial computation interleaved with test runs requiring the same physical resources in terms of memory and gates; 4) the amount of tolerable noise, measured by the probability of failing a test run, can be as high as 25% for some computations and will be generally bounded by 12.5% when using a planar graph resource state. The key points are that security can be provided without universal computation graphs and that, in our setting, full fault-tolerance is not needed to amplify the confidence level exponentially close to 1.

arXiv comment18 pages, 3 figures. Results from this article have been extended to allow verification of BQP computations in arXiv:2109.04042

References in corpus (11)

• Multi-party entanglement in graph states
• Experimental Demonstration of Blind Quantum Computing
• Unconditionally verifiable blind computation
• Verification of quantum computation: An overview of existing approaches
• Experimental verification of quantum computations
• Determinism in the one-way model
• Locking of accessible information and implications for the security of quantum cryptography
• Experimental Verification of Multipartite Entanglement in Quantum Networks
• Demonstration of measurement-only blind quantum computing
• Secure entanglement distillation for double-server blind quantum computation
• Nonadaptive fault-tolerant verification of quantum supremacy with noise

Cited by in corpus (5)

• Analysis of Multipartite Entanglement Distribution using a Central Quantum-Network Node
• Requirements for a processing-node quantum repeater on a real-world fiber grid
• Unifying Quantum Verification and Error-Detection: Theory and Tools for Optimisations
• Divide-and-conquer verification method for noisy intermediate-scale quantum computation
• Parallel remote state preparation for fully device-independent verifiable blind quantum computation