Unconditionally verifiable blind quantum computation
TLDR
It is rigorously proved that the probability of failing to detect an incorrect output is exponentially small in a security parameter, while resource overhead remains polynomial in this parameter, which allows entangling gates to be performed between arbitrary pairs of logical qubits with only constant overhead.Abstract:
Blind quantum computing (BQC) allows a client to have a server carry out a quantum computation for them such that the client's input, output, and computation remain private. A desirable property for any BQC protocol is verification, whereby the client can verify with high probability whether the server has followed the instructions of the protocol or if there has been some deviation resulting in a corrupted output state. A verifiable BQC protocol can be viewed as an interactive proof system leading to consequences for complexity theory. We previously proposed [A. Broadbent, J. Fitzsimons, and E. Kashefi, in Proceedings of the 50th Annual Symposium on Foundations of Computer Science, Atlanta, 2009 (IEEE, Piscataway, 2009), p. 517] a universal and unconditionally secure BQC scheme where the client only needs to be able to prepare single qubits in separable states randomly chosen from a finite set and send them to the server, who has the balance of the required quantum computational resources. In this paper we extend that protocol with additional functionality allowing blind computational basis measurements, which we use to construct another verifiable BQC protocol based on a different class of resource states. We rigorously prove that the probability of failing to detect an incorrect output is exponentially small in a security parameter, while resource overhead remains polynomial in this parameter. This resource state allows entangling gates to be performed between arbitrary pairs of logical qubits with only constant overhead. This is a significant improvement on the original scheme, which required that all computations to be performed must first be put into a nearest-neighbor form, incurring linear overhead in the number of qubits. Such an improvement has important consequences for efficiency and fault-tolerance thresholds.read more
Citations
More filters
Journal ArticleDOI
Advances in quantum cryptography
Stefano Pirandola,Ulrik L. Andersen,Leonardo Banchi,Mario Berta,Darius Bunandar,Roger Colbeck,Dirk Englund,Tobias Gehring,Cosmo Lupo,Carlo Ottaviani,Jason Pereira,Mohsen Razavi,Jesni Shamsul Shaari,Marco Tomamichel,Vladyslav C. Usenko,Giuseppe Vallone,Paolo Villoresi,Petros Wallden +17 more
TL;DR: This review begins by reviewing protocols of quantum key distribution based on discrete variable systems, and considers aspects of device independence, satellite challenges, and high rate protocols based on continuous variable systems.
Journal ArticleDOI
Photonic quantum information processing: a review
TL;DR: A comprehensive review of the state of the art in this active field, with a due balance between theoretical, experimental and technological results, can be found in this article, where significant achievements are presented in tables or in schematic figures, in order to convey a global perspective of the several horizons that fall under the name of photonic quantum information.
Journal ArticleDOI
Classical command of quantum systems
TL;DR: A scheme is described that can be used to determine the initial state and to classically command the system to evolve according to desired dynamics, and makes it possible to test whether a claimed quantum computer is truly quantum.
Journal ArticleDOI
Advances in Quantum Cryptography
Stefano Pirandola,Ulrik L. Andersen,Leonardo Banchi,Mario Berta,Darius Bunandar,Roger Colbeck,Dirk Englund,Tobias Gehring,Cosmo Lupo,Carlo Ottaviani,Jason Pereira,Mohsen Razavi,Jesni Shamsul Shaari,Marco Tomamichel,Vladyslav C. Usenko,Giuseppe Vallone,Paolo Villoresi,Petros Wallden +17 more
TL;DR: Quantum cryptography is arguably the fastest growing area in quantum information science as mentioned in this paper, and many quantum key distribution protocols have been proposed, both theoretically and experimentally, over the last few decades.
Journal ArticleDOI
Photonic quantum information processing: a review
TL;DR: The goal of this manuscript is to provide the reader with a comprehensive review of the state of the art in this active field with a due balance between theoretical, experimental and technological results.
References
More filters
Journal ArticleDOI
A method for obtaining digital signatures and public-key cryptosystems
TL;DR: An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key.
Proceedings ArticleDOI
Fully homomorphic encryption using ideal lattices
TL;DR: This work proposes a fully homomorphic encryption scheme that allows one to evaluate circuits over encrypted data without being able to decrypt, and describes a public key encryption scheme using ideal lattices that is almost bootstrappable.
Journal ArticleDOI
A one-way quantum computer.
TL;DR: A scheme of quantum computation that consists entirely of one-qubit measurements on a particular class of entangled states, the cluster states, which are thus one-way quantum computers and the measurements form the program.
Journal ArticleDOI
Quantum Simulation
TL;DR: The main theoretical and experimental aspects of quantum simulation have been discussed in this article, and some of the challenges and promises of this fast-growing field have also been highlighted in this review.