Securing Quantum Computations in the NISQ Era
- URL: http://arxiv.org/abs/2011.10005v2
- Date: Mon, 13 Sep 2021 04:29:00 GMT
- Title: Securing Quantum Computations in the NISQ Era
- Authors: Elham Kashefi, Dominik Leichtle, Luka Music, Harold Ollivier
- Abstract summary: In light of ongoing privacy scandals, the future availability of quantum computing through remotely accessible servers pose peculiar challenges.
Clients with quantum-leaved 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.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- 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.
Related papers
- Efficient Post-Quantum Secured Blind Computation [0.0]
In the medium term, quantum computing must tackle two key challenges: fault tolerance and security.
Here we detail a verifiable circuit-based model that only requires classical communication between parties.
The server is blind to the details of the computation, which is computationally secure.
arXiv Detail & Related papers (2024-04-10T14:42:40Z) - A Thorough Study of State Leakage Mitigation in Quantum Computing with
One-Time Pad [10.353892677735212]
We study the state leakage problem in quantum computing.
We propose a solution by employing the classical and quantum one-time pads before the reset mechanism.
Our findings offer new perspectives on the design of reset mechanisms and secure quantum computing systems.
arXiv Detail & Related papers (2024-01-28T00:35:33Z) - QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum
Circuits [82.50620782471485]
QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits.
It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness.
Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
arXiv Detail & Related papers (2024-01-10T22:33:00Z) - Large-scale simulation of Shor's quantum factoring algorithm [0.0]
We show how large GPU-based supercomputers can be used to assess the performance of Shor's algorithm.
We find average success probabilities above 50 %, due to a high frequency of "lucky" cases.
We find that the quantum factoring algorithm exhibits a particular form of universality and resilience against the different types of errors.
arXiv Detail & Related papers (2023-08-09T16:19:52Z) - Iterative Qubits Management for Quantum Index Searching in a Hybrid
System [56.39703478198019]
IQuCS aims at index searching and counting in a quantum-classical hybrid system.
We implement IQuCS with Qiskit and conduct intensive experiments.
Results demonstrate that it reduces qubits consumption by up to 66.2%.
arXiv Detail & Related papers (2022-09-22T21:54:28Z) - Verifying BQP Computations on Noisy Devices with Minimal Overhead [0.0]
We introduce the first blind and verifiable protocol for delegating BQP computations to a powerful server with repetition as the only overhead.
It is composable and statistically secure with exponentially-low bounds and can tolerate a constant amount of global noise.
arXiv Detail & Related papers (2021-09-09T05:20:56Z) - Hardware-Efficient, Fault-Tolerant Quantum Computation with Rydberg
Atoms [55.41644538483948]
We provide the first complete characterization of sources of error in a neutral-atom quantum computer.
We develop a novel and distinctly efficient method to address the most important errors associated with the decay of atomic qubits to states outside of the computational subspace.
Our protocols can be implemented in the near-term using state-of-the-art neutral atom platforms with qubits encoded in both alkali and alkaline-earth atoms.
arXiv Detail & Related papers (2021-05-27T23:29:53Z) - Delegating Multi-Party Quantum Computations vs. Dishonest Majority in
Two Quantum Rounds [0.0]
Multi-Party Quantum Computation (MPQC) has attracted a lot of attention as a potential killer-app for quantum networks.
We present a composable protocol achieving blindness and verifiability even in the case of a single honest client.
arXiv Detail & Related papers (2021-02-25T15:58:09Z) - 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) - Fault-tolerant Coding for Quantum Communication [71.206200318454]
encode and decode circuits to reliably send messages over many uses of a noisy channel.
For every quantum channel $T$ and every $eps>0$ there exists a threshold $p(epsilon,T)$ for the gate error probability below which rates larger than $C-epsilon$ are fault-tolerantly achievable.
Our results are relevant in communication over large distances, and also on-chip, where distant parts of a quantum computer might need to communicate under higher levels of noise.
arXiv Detail & Related papers (2020-09-15T15:10:50Z) - Quantum noise protects quantum classifiers against adversaries [120.08771960032033]
Noise in quantum information processing is often viewed as a disruptive and difficult-to-avoid feature, especially in near-term quantum technologies.
We show that by taking advantage of depolarisation noise in quantum circuits for classification, a robustness bound against adversaries can be derived.
This is the first quantum protocol that can be used against the most general adversaries.
arXiv Detail & Related papers (2020-03-20T17:56:14Z)
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.