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 correlations which imply causation
This work introduces the concept of a pseudo-density matrix (PDM) which treats space and time indiscriminately and defines a measure of causality that discriminates between spatial and temporal correlations.
Unconditionally verifiable blind quantum computation
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.
Composable Security of Delegated Quantum Computation
- V. Dunjko, J. Fitzsimons, C. Portmann, R. Renner
- Computer Science, MathematicsInternational Conference on the Theory and…
- 16 January 2013
This work defines composable security for delegated quantum computation, and distinguishes between protocols which provide only blindness – the computation is hidden from the server – and those that are also verifiable – the client can check that it has received the correct result.
Private quantum computation: an introduction to blind quantum computing and related protocols
- J. Fitzsimons
- Computer ScienceArXiv
- 30 November 2016
A review of the progress to date in quantum cryptography protocols addressing the task of securely delegating quantum computation to an untrusted device while maintaining the privacy, and in some instances the integrity, of the computation.
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.
Freely Scalable Quantum Technologies using Cells of 5-to-50 Qubits with Very Lossy and Noisy Photonic Links
It is shown that loss-tolerant entanglement purification makes quantum computing feasible with the noisy and lossy links that are realistic today: with a modestly complex cell design, and using a surface code protocol with a network noise threshold of 13.3%.
Post hoc verification of quantum computation
It is demonstrated that the verification can be achieved independently from the blindness, and it is shown that a constant round protocol with a single prover and a completely classical verifier is not possible, unless bounded error quantum polynomial time (BQP) is contained in the third level of thePolynomial hierarchy.
Device-Independent Verifiable Blind Quantum Computation
This work presents a novel approach based on a combination of verified blind quantum computation and Bell state self-testing that has dramatically reduced overhead, with resources scaling as only O(m4lnm) in the number of gates.
Limitations on information theoretically secure quantum homomorphic encryption
It is shown, via an information localization argument, that deterministic fully homomorphic encryption necessarily incurs exponential overhead if perfect security is required.