Share This Author
Universal Blind Quantum Computation
- A. Broadbent, J. Fitzsimons, E. Kashefi
- Computer Science50th Annual IEEE Symposium on Foundations of…
- 25 July 2008
The protocol is the first universal scheme which detects a cheating server, as well as the first protocol which does not require any quantum computation whatsoever on the client's side.
Quantum Homomorphic Encryption for Circuits of Low T-gate Complexity
- A. Broadbent, S. Jeffery
- Mathematics, Computer ScienceAnnual International Cryptology Conference
- 30 December 2014
This work formally defines and gives schemes for quantum homomorphic encryption, which is the encryption of quantum information such that quantum computations can be performed given the ciphertext only.
Pseudo-telepathy is a surprising application of quantum information processing to communication complexity and a survey of recent and not-so-recent work on the subject is presented.
Quantum cryptography beyond quantum key distribution
This review article, aimed primarily at cryptographers unfamiliar with the quantum world, survey the area of theoretical quantum cryptography, with an emphasis on the constructions and limitations beyond the realm of QKD.
Parallelizing quantum circuits
Quantum one-time programs
The construc-tion employs methods for computation on authenticated quantum data, and a new quantum authentication scheme called the trap scheme is presented, which establishes UC-security of a recent protocol for delegated quantum computation.
Zero-Knowledge Proof Systems for QMA
- A. Broadbent, Zhengfeng Ji, Fang Song, J. Watrous
- Computer Science, MathematicsIEEE Annual Symposium on Foundations of Computer…
- 11 April 2016
This work proves that every problem in the complexity class QMA has a quantum interactive proof system that is zero-knowledge with respect to efficient quantum computations.
Demonstration of Blind Quantum Computing
- S. Barz, E. Kashefi, A. Broadbent, J. Fitzsimons, A. Zeilinger, P. Walther
- Computer Science, PhysicsScience
- 6 October 2011
An experimental demonstration of blind quantum computing in which the input, computation, and output all remain unknown to the computer is presented and the conceptual framework of measurement-based quantum computation that enables a client to delegate a computation to a quantum server is exploited.
Quantum computing on encrypted data.
It is proved that an untrusted server can implement a universal set of quantum gates on encrypted quantum bits (qubits) without learning any information about the inputs, while the client, knowing the decryption key, can easily decrypt the results of the computation.
How to Verify a Quantum Computation
- A. Broadbent
- Computer ScienceTheory of Computing
- 30 September 2015
This work gives a new theoretical solution to a leading-edge experimental challenge, namely to the verification of quantum computations in the regime of high computational complexity, using a reduction to an entanglement-based protocol and showing that verification could be achieved at minimal cost compared to performing the computation.