arXiv:1608.04633 · Physical Review X

Flow Ambiguity: A Path Towards Classically Driven Blind Quantum Computation

Atul Mantri, Tommaso F. Demarie, Nicolas C. Menicucci, Joseph F. Fitzsimons

Published Jul 11, 2017• 25 citations

Abstract

Current protocols for securely delegating computation to remote quantum computers require some form of quantum communication, thus limiting secure access to future cloud-based quantum computing resources. A new analysis shows that it is possible to hide critical aspects of a computation delegated to a quantum computer using only classical communication.

DOI: 10.1103/physrevx.7.031004

Related papers

Flow ambiguity: A path towards classically driven blind quantum computation

Atul Mantri (20053800), Tommaso F. Demarie, Nicolas C. Menicucci +1 more

Blind quantumcomputation protocols allowa 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 quantumdevices: 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 flowof information inmeasurement-based quantumcomputing 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 existmultiple 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.

Nov 23, 202424 citations

Sustainable Blind Quantum Computing

Quantum computing systems are powerful for allowing a client to perform any quantum computations from a remote quantum server while concealing the structure and content of the computation fall under the category of blind quantum computing (BQC). In BQC, the client delegates the quantum processing to one or more powerful quantum servers while retaining privacy over the input, computation and output. This makes it suitable for secure quantum cloud computing. This feature is powerful to ensure that even untrusted servers cannot learn the details of the user's computation. With quantum computing, there is a fast-growing need to transition from general-purpose quantum systems to customized architectures tailored to specific application requirements. This transition is critical while considering sustainability goals and financial limitations. With this advanced computing architecture, a custom system can optimize energy use, hardware complexity, and resource allocation to better serve individual user needs while staying within budgetary boundaries.

De Gruyter eBooksApr 23, 20250 citations

On the Security of Two Blind Quantum Computations

Shih-Min Hung, Tzonelih Hwang

Blind quantum computation (BQC) protocol allows a client having partial quantum ability to delegate his quantum computation to a remote quantum server without leaking any information about the input, the output and the intended computation to the server. Several BQC protocols have been proposed, e.g., Li et al. in [1] proposed a triple-server BQC protocol and Xu et al. in [2] proposed a single-server BQC protocol. Though both papers claimed that their protocols can satisfy the requirement of privacy, this paper points out a security loophole in their protocols. With that the server can reveal the private information of the client.

arXiv:1508.07478Aug 29, 20152 citations

Impossibility of perfectly-secure one-round delegated quantum computing for classical client

Tomoyuki Morimae, Takeshi Koshiba

Blind quantum computing protocols enable a client, who can generate or measure single-qubit states, to delegate quantum computing to a remote quantum server protecting the client's privacy (i.e., input, output, and program). With current technologies, generations or measurements of single-qubit states are not too much burden for the client. In other words, secure delegated quantum computing is possible for ``almost classical" clients. However, is it possible for a ``completely classical" client? Here we consider a one-round perfectly-secure delegated quantum computing, and show that the protocol cannot satisfy both the correctness (i.e., the correct result is obtained when the server is honest) and the perfect blindness (i.e., the client's privacy is completely protected) simultaneously unless BQP is in NP. Since BQP is not believed to be in NP, the result suggests the impossibility of the one-round perfectly-secure delegated quantum computing.

arXiv:1407.1636Quantum Information and ComputationMar 1, 201915 citations

QEnclave - A practical solution for secure quantum cloud computing

Yao Ma, Elham Kashefi, Myrto Arapinis +2 more

Abstract We introduce a secure hardware device named a QEnclave that can secure the remote execution of quantum operations while only using classical controls. This device extends to quantum computing from the classical concept of a secure enclave that isolates a computation from its environment to provide privacy and tamper-resistance. Remarkably, our QEnclave only performs single qubit rotations but can nevertheless be used to secure an arbitrary quantum computation even if the qubit source is controlled by an adversary. More precisely, by attaching a QEnclave to a quantum computer, a remote client controlling the QEnclave can securely delegate its computation to the server solely using classical communication. We investigate the security of our QEnclave by modeling it as an ideal functionality named remote state rotation (RSR). We show that this resource, similar to the previously introduced functionality of remote state preparation, allows blind delegated quantum computing with perfect security. Our proof under the Abstract Cryptography framework shows the construction of remote state preparation from remote state rotation while preserving security. An immediate consequence is the weakening of the requirements for blind delegated computation. While previous delegated protocols relied on a client that can either generate or measure quantum states, we show that this same functionality can be achieved with a client that only transforms quantum states without generating or measuring them.

arXiv:2109.02952npj Quantum InformationNov 5, 202218 citations

Selectively Blind Quantum Computation

Abbas Poshtvan, Oleksandra Lapiha, Mina Doosti +3 more

Known protocols for secure delegation of quantum computations from a client to a server in an information theoretic setting require quantum communication. In this work, we investigate methods to reduce communication overhead. First, we establish an impossibility result by proving that server-side local processes cannot decrease quantum communication requirements of secure delegation protocols. We develop no-go results that prohibit such processes within an information theoretic framework. Second, we present a possibility result by introducing Selectively Blind Quantum Computing (SBQC), a novel functionality that allows the client to hide one among a known set of possible computations. We characterize how differences between computations in the protected set influence the number of qubits sent during our SBQC implementation, yielding a communication-optimal protocol. This approach reduces qubit communication drastically and demonstrates the trade-off between information leaked to the server and communication cost.

arXiv:2504.17612Apr 24, 20250 citations