ABSTRACT
Blind quantum computation allows a user to delegate a computation to an untrusted server while keeping the computation hidden. A number of recent works have sought to establish bounds on the communication requirements necessary to implement blind computation, and a bound based on the no-programming theorem of Nielsen and Chuang has emerged as a natural limiting factor. Here we show that this constraint only holds in limited scenarios, and show how to overcome it using a novel method of iterated gate teleportations. This technique enables drastic reductions in the communication required for distributed quantum protocols, extending beyond the blind computation setting. Applied to blind quantum computation, this technique offers significant efficiency improvements, and in some scenarios offers an exponential reduction in communication requirements.
ABSTRACT
Blind quantum computation allows a client with limited quantum capabilities to interact with a remote quantum computer to perform an arbitrary quantum computation, while keeping the description of that computation hidden from the remote quantum computer. While a number of protocols have been proposed in recent years, little is currently understood about the resources necessary to accomplish the task. Here, we present general techniques for upper and lower bounding the quantum communication necessary to perform blind quantum computation, and use these techniques to establish concrete bounds for common choices of the client's quantum capabilities. Our results show that the universal blind quantum computation protocol of Broadbent, Fitzsimons, and Kashefi, comes within a factor of 8/3 of optimal when the client is restricted to preparing single qubits. However, we describe a generalization of this protocol which requires exponentially less quantum communication when the client has a more sophisticated device.
ABSTRACT
Quantum imaging promises increased imaging performance over classical protocols. However, there are a number of aspects of quantum imaging that are not well understood. In particular, it has been unknown so far how to compare classical and quantum imaging procedures. Here, we consider classical and quantum imaging in a single theoretical framework and present general fundamental limits on the resolution and the deposition rate for classical and quantum imaging. The resolution can be estimated from the image itself. We present a utility function that allows us to compare imaging protocols in a wide range of applications.
Subject(s)
Image Processing, Computer-Assisted , Models, Theoretical , Quantum TheoryABSTRACT
Quantum metrology promises improved sensitivity in parameter estimation over classical procedures. However, there is a debate over the question of how the sensitivity scales with the resources and the number of queries that are used in estimation procedures. Here, we reconcile the physical definition of the relevant resources used in parameter estimation with the information-theoretical scaling in terms of the query complexity of a quantum network. This leads to a completely general optimality proof of the Heisenberg limit for quantum metrology. We give an example of how our proof resolves paradoxes that suggest sensitivities beyond the Heisenberg limit, and we show that the Heisenberg limit is an information-theoretic interpretation of the Margolus-Levitin bound, rather than Heisenberg's uncertainty relation.
ABSTRACT
We analyze a conceptual approach to single-spin measurement. The method uses techniques from the theory of quantum cellular automata to correlate a large number of ancillary spins to the one to be measured. It has the distinct advantage of being efficient: under ideal conditions, it requires the application of only O((3)square root N)) steps (each requiring a constant number of rf pulses) to create a system of N correlated spins. Numerical simulations suggest that it is also, to a certain extent, robust against pulse errors, and imperfect initial polarization of the ancilla spin system.