Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Wiley eBooks

Delegating Quantum Computations

Seng W. Loke

Published Dec 1, 2023• 0 citations
Publisher

Abstract

This chapter discusses the idea of a client, with limited resources, delegating quantum computations to a more powerful quantum computer or server, in the style of what the readers see with cloud computing today. It looks at how to delegate quantum computations to a quantum server in such a way as to protect the privacy of the client's inputs. The chapter also looks at how the client can verify the server's computations, or at least detect if the server really performed the delegated computations correctly. An implementation of verifiable blind quantum computing is described in Drmota et al., where the server is a trapped-ion quantum computer and the client is a photonic detection system, with the client and server networked using a fiber-optic quantum link. Finally, the chapter looks briefly at the idea of quantum computing as a service.

DOI
10.1002/9781394185542.ch5

Related papers

Measurement-only verifiable blind quantum computing with quantum input verification

Tomoyuki Morimae

Verifiable blind quantum computing is a secure delegated quantum computing where a client with a limited quantum technology delegates her quantum computing to a server who has a universal quantum computer. The client's privacy is protected (blindness), and the correctness of the computation is verifiable by the client despite her limited quantum technology (verifiability). There are mainly two types of protocols for verifiable blind quantum computing: the protocol where the client has only to generate single-qubit states and the protocol where the client needs only the ability of single-qubit measurements. The latter is called the measurement-only verifiable blind quantum computing. If the input of the client's quantum computing is a quantum state, whose classical efficient description is not known to the client, there was no way for the measurement-only client to verify the correctness of the input. Here we introduce a protocol of measurement-only verifiable blind quantum computing where the correctness of the quantum input is also verifiable.

arXiv:1606.06467•Physical Review A•Oct 3, 2016•35 citations

Sustainable Blind Quantum Computing

Srinjoy Ganguly, Saurav Mohanty, Sanjay Kumar Vishwakarma +3 more

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 eBooks•Apr 23, 2025•0 citations

Client-friendly continuous variable blind and verifiable quantum computing (Conference Presentation)

Nana Liu, Tommaso F. Demarie, Si-Hui Tan +2 more

Limitations due to high costs and technological requirements will require users to access the first quantum processors through the cloud. Delegating a computation, however, raises privacy issues about the clients' data and poses questions about the verifiability of computations in high complexity regimes. These concerns have inspired a plethora of blind and verifiable quantum computation protocols, which allow a client with limited quantum capabilities to delegate a quantum computation to a remote server while hiding her data and preserving the integrity of the computation. The majority of these protocols are constrained to discrete quantum systems, but quantum information can also be processed by continuous-variable architectures. These offer a competitive alternative to their discrete-variable counterparts for numerous practical benefits: They rely on well-established quantum optical techniques, allow for the generation of very large optical resource states, offer higher detection efficiencies, and can be integrated into existing optical-fibre networks, all of which are highly desirable features for cloud quantum computing. In this work we fill this gap by presenting a blind and verifiable quantum computing protocol tailored to the unique features of continuous-variable systems. One such feature is the experimental accessibility of Gaussian operations. Our protocol is then based on the delegation of the experimentally challenging non-Gaussian operations. In this sense, it is experimentally friendly to the client, who only needs to perform Gaussian operations. Furthermore, unlike previous schemes, this protocol does not require repeated interactions between the client and server because it only involves the server sending the client non-Gaussian states. We prove universality and blindness using standard techniques, and we introduce an efficient fidelity test - based on homodyne detection - that allows the client to verify the correctness of the computation. This test is interesting in its own right because it could be employed in the context of state-certification of optical systems. The division of quantum hardware between client and server assumed here is typical of the experimental constraints expected in realistic, commercially useful schemes for continuous-variable cloud quantum computing. As such, we believe our protocol constitutes a significant advance towards their actual realisation.

SPIE Quantum Information Science and Technology•Oct 11, 2018•2 citations

Demonstration of Blind Quantum Computing

Stefanie Barz, Elham Kashefi, Anne Broadbent +3 more

Quantum computers, besides offering substantial computational speedups, are also expected to preserve the privacy of a computation. We present an experimental demonstration of blind quantum computing in which the input, computation, and output all remain unknown to the computer. We exploit the conceptual framework of measurement-based quantum computation that enables a client to delegate a computation to a quantum server. Various blind delegated computations, including one- and two-qubit gates and the Deutsch and Grover quantum algorithms, are demonstrated. The client only needs to be able to prepare and transmit individual photonic qubits. Our demonstration is crucial for unconditionally secure quantum cloud computing and might become a key ingredient for real-life applications, especially when considering the challenges of making powerful quantum computers widely available.

arXiv:1110.1381•Science•Jan 19, 2012•484 citations

Verifiable Blind Quantum Computing with Trapped Ions and Single Photons

P. Drmota, D. P. Nadlinger, D. Main +9 more

We report the first hybrid matter-photon implementation of verifiable blind quantum computing. We use a trapped-ion quantum server and a client-side photonic detection system networked via a fiber-optic quantum link. The availability of memory qubits and deterministic entangling gates enables interactive protocols without postselection-key requirements for any scalable blind server, which previous realizations could not provide. We quantify the privacy at ≲0.03 leaked classical bits per qubit. This experiment demonstrates a path to fully verified quantum computing in the cloud.

arXiv:2305.02936•Physical Review Letters•Apr 10, 2024•71 citations

Multiparty Delegated Quantum Computing

Elham Kashefi, Anna Pappa

Quantum computing has seen tremendous progress in the past few years. However, due to limitations in the scalability of quantum technologies, it seems that we are far from constructing universal quantum computers for everyday users. A more feasible solution is the delegation of computation to powerful quantum servers on the network. This solution was proposed in previous studies of blind quantum computation, with guarantees for both the secrecy of the input and of the computation being performed. In this work, we further develop this idea of computing over encrypted data, to propose a multiparty delegated quantum computing protocol in the measurement-based quantum computing framework. We prove the security of the protocol against a dishonest server and against dishonest clients, under the assumption of common classical cryptographic constructions.

arXiv:1606.09200•Cryptography•Jul 30, 2017•78 citations
This chapter discusses the idea of a client, with limited resources, delegating quantum computations to a more powerful quantum computer or server, in the style of what the readers see with cloud computing today. It looks at how to delegate quantum computations to a quantum server in such a way as to protect the privacy of the client's inputs. The chapter also looks at how the client can verify the server's computations, or at least detect if the server really performed the delegated computations correctly. An implementation of verifiable blind quantum computing is described in Drmota et al., where the server is a trapped-ion quantum computer and the client is a photonic detection system, with the client and server networked using a fiber-optic quantum link. Finally, the chapter looks briefly at the idea of quantum computing as a service.
Verifiable blind quantum computing is a secure delegated quantum computing where a client with a limited quantum technology delegates her quantum computing to a server who has a universal quantum computer. The client's privacy is protected (blindness), and the correctness of the computation is verifiable by the client despite her limited quantum technology (verifiability). There are mainly two types of protocols for verifiable blind quantum computing: the protocol where the client has only to generate single-qubit states and the protocol where the client needs only the ability of single-qubit measurements. The latter is called the measurement-only verifiable blind quantum computing. If the input of the client's quantum computing is a quantum state, whose classical efficient description is not known to the client, there was no way for the measurement-only client to verify the correctness of the input. Here we introduce a protocol of measurement-only verifiable blind quantum computing where the correctness of the quantum input is also verifiable.
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.
Limitations due to high costs and technological requirements will require users to access the first quantum processors through the cloud. Delegating a computation, however, raises privacy issues about the clients' data and poses questions about the verifiability of computations in high complexity regimes. These concerns have inspired a plethora of blind and verifiable quantum computation protocols, which allow a client with limited quantum capabilities to delegate a quantum computation to a remote server while hiding her data and preserving the integrity of the computation. The majority of these protocols are constrained to discrete quantum systems, but quantum information can also be processed by continuous-variable architectures. These offer a competitive alternative to their discrete-variable counterparts for numerous practical benefits: They rely on well-established quantum optical techniques, allow for the generation of very large optical resource states, offer higher detection efficiencies, and can be integrated into existing optical-fibre networks, all of which are highly desirable features for cloud quantum computing. In this work we fill this gap by presenting a blind and verifiable quantum computing protocol tailored to the unique features of continuous-variable systems. One such feature is the experimental accessibility of Gaussian operations. Our protocol is then based on the delegation of the experimentally challenging non-Gaussian operations. In this sense, it is experimentally friendly to the client, who only needs to perform Gaussian operations. Furthermore, unlike previous schemes, this protocol does not require repeated interactions between the client and server because it only involves the server sending the client non-Gaussian states. We prove universality and blindness using standard techniques, and we introduce an efficient fidelity test - based on homodyne detection - that allows the client to verify the correctness of the computation. This test is interesting in its own right because it could be employed in the context of state-certification of optical systems. The division of quantum hardware between client and server assumed here is typical of the experimental constraints expected in realistic, commercially useful schemes for continuous-variable cloud quantum computing. As such, we believe our protocol constitutes a significant advance towards their actual realisation.
Quantum computers, besides offering substantial computational speedups, are also expected to preserve the privacy of a computation. We present an experimental demonstration of blind quantum computing in which the input, computation, and output all remain unknown to the computer. We exploit the conceptual framework of measurement-based quantum computation that enables a client to delegate a computation to a quantum server. Various blind delegated computations, including one- and two-qubit gates and the Deutsch and Grover quantum algorithms, are demonstrated. The client only needs to be able to prepare and transmit individual photonic qubits. Our demonstration is crucial for unconditionally secure quantum cloud computing and might become a key ingredient for real-life applications, especially when considering the challenges of making powerful quantum computers widely available.
We report the first hybrid matter-photon implementation of verifiable blind quantum computing. We use a trapped-ion quantum server and a client-side photonic detection system networked via a fiber-optic quantum link. The availability of memory qubits and deterministic entangling gates enables interactive protocols without postselection-key requirements for any scalable blind server, which previous realizations could not provide. We quantify the privacy at ≲0.03 leaked classical bits per qubit. This experiment demonstrates a path to fully verified quantum computing in the cloud.
Quantum computing has seen tremendous progress in the past few years. However, due to limitations in the scalability of quantum technologies, it seems that we are far from constructing universal quantum computers for everyday users. A more feasible solution is the delegation of computation to powerful quantum servers on the network. This solution was proposed in previous studies of blind quantum computation, with guarantees for both the secrecy of the input and of the computation being performed. In this work, we further develop this idea of computing over encrypted data, to propose a multiparty delegated quantum computing protocol in the measurement-based quantum computing framework. We prove the security of the protocol against a dishonest server and against dishonest clients, under the assumption of common classical cryptographic constructions.