Abstract
Blind quantum computation protocols allow a user to delegate a computation to a remote quantum computer in such a way that the privacy of their computation is preserved, even from the device implementing the computation. To date, such protocols are only known for settings involving at least two quantum devices: either a user with some quantum capabilities and a remote quantum server or two or more entangled but noncommunicating servers. In this work, we take the first step towards the construction of a blind quantum computing protocol with a completely classical client and single quantum server. Specifically, we show how a classical client can exploit the ambiguity in the flow of information in measurement-based quantum computing to construct a protocol for hiding critical aspects of a computation delegated to a remote quantum computer. This ambiguity arises due to the fact that, for a fixed graph, there exist multiple choices of the input and output vertex sets that result in deterministic measurement patterns consistent with the same fixed total ordering of vertices. This allows a classical user, computing only measurement angles, to drive a measurement-based computation performed on a remote device while hiding critical aspects of the computation.
Highlights
Large-scale quantum computers offer the promise of quite extreme computational advantages over conventional computing technologies for a range of problems spanning cryptanalysis [1], simulation of physical systems [2], and machine learning [3]
We show how a classical client can exploit the ambiguity in the flow of information in measurement-based quantum computing to construct a protocol for hiding critical aspects of a computation delegated to a remote quantum computer
Our overall motivation in this work has been to explore the possibility of classically driven blind quantum computation
Summary
Large-scale quantum computers offer the promise of quite extreme computational advantages over conventional computing technologies for a range of problems spanning cryptanalysis [1], simulation of physical systems [2], and machine learning [3]. We focus on the question of blind computation with a completely classical client, but given the historic links between progress in blindness and verification, it is natural to expect that progress in either direction will likely be reflected in the other While it is presently unknown if such a protocol can exist, a negative result in this context is a schemedependent impossibility proof presented in Ref. The server performs a quantum computation using the received data and returns the classical output to the client, who decrypts the result using her encryption key For this setting, it was shown that secure blind quantum computing cannot be achieved unless BPP 1⁄4 BQP (i.e., unless a classical computer can efficiently simulate a quantum computer).
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
