Deterministic and verifiable blind quantum computing with trapped ions
ORAL
Abstract
Delegating quantum computations to a server usually comes at the cost of waiving privacy and security. Blind quantum computing addresses this issue through interactive protocols.
In this experiment, we enable a client with limited resources to delegate algorithms to a trapped-ion quantum computer via a photonic link. Using the test-or-compute strategy, we perform verifiable blind single-qubit rotations in both the measurement-based model and the circuit model of quantum computing.
We discuss the impact of noisy hardware on the security and robustness of the computation. Our implementation does not depend on the computational model, is scalable without hardware modifications, and does not require post-selection due to the adaptive nature of the protocol.
In this experiment, we enable a client with limited resources to delegate algorithms to a trapped-ion quantum computer via a photonic link. Using the test-or-compute strategy, we perform verifiable blind single-qubit rotations in both the measurement-based model and the circuit model of quantum computing.
We discuss the impact of noisy hardware on the security and robustness of the computation. Our implementation does not depend on the computational model, is scalable without hardware modifications, and does not require post-selection due to the adaptive nature of the protocol.
–
Publication: Planned paper
Presenters
-
Peter Drmota
University of Oxford
Authors
-
Peter Drmota
University of Oxford
-
David P Nadlinger
University of Oxford
-
Dougal Main
University of Oxford, The University of Oxford
-
bethan C nichol
University of Oxford
-
Ellis Ainley
University of Oxford
-
Dominik Leichtle
Laboratoire d'Informatique de Paris 6
-
Chris J Ballance
University of Oxford, University of Oxford/Oxford Ionics, Department of Physics, University of Oxford
-
Gabriel Araneda
University of Oxford
-
Raghavendra Srinivas
University of Oxford/Oxford Ionics, University of Oxford
-
David M Lucas
University of Oxford