The instantaneous non-local quantum computation task requires multiple parties to jointly perform a quantum operation, using pre-shared entanglement and a single round of simultaneous communication. We study this task for its close connection to position-based quantum cryptography, but it also has natural applications in the context of foundations of quantum physics and in distributed computing. The best known general construction for instantaneous non-local quantum computation requires a pre-shared state which is exponentially large in the number of qubits involved in the operation, while efficient constructions are known for very specific cases only. We partially close this gap by presenting new schemes for efficient instantaneous non-local computation of several classes of quantum circuits, using the Clifford+T gate set. Our main result is a protocol which uses entanglement exponential in the T-depth of a quantum circuit, able to perform non-local computation of quantum circuits with a (poly-)logarithmic number of layers of T gates with quasi-polynomial entanglement. Our proofs combine ideas from blind and delegated quantum computation with the garden-hose model, a combinatorial model of communication complexity which was recently introduced as a tool for studying certain schemes for quantum position verification. As application of our results, we additionally present an efficient attack on a recently-proposed scheme for position verification by Chakraborty and Leverrier.
Additional Metadata
THEME Information (theme 2)
Publisher Cornell University Library
Persistent URL dx.doi.org/10.4230/LIPIcs.TQC.2016.9
Series arXiv.org e-Print archive
Citation
Speelman, F. (2015). Instantaneous non-local computation of low T-depth quantum circuits. arXiv.org e-Print archive. Cornell University Library . doi:10.4230/LIPIcs.TQC.2016.9