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

arXiv:1903.07862 · Physical Review Letters

Remote Blind State Preparation with Weak Coherent Pulses in the Field

Yang-Fan Jiang, Kejin Wei, Liang Huang, Ke Xu, Qi-Chao Sun, Yuzhe Zhang, Weijun Zhang, Hao Li, Lixing You, Zhen Wang, Hoi‐Kwong Lo, Feihu Xu, Qiang Zhang, Jian-Wei Pan

Published Sep 3, 2019• 24 citations
arXivHTMLPDF

Abstract

Quantum computing has seen tremendous progress in past years. Due to implementation complexity and cost, the future path of quantum computation is strongly believed to delegate computational tasks to powerful quantum servers on the cloud. Universal blind quantum computing (UBQC) provides the protocol for the secure delegation of arbitrary quantum computations, and it has received significant attention. However, a great challenge in UBQC is how to transmit a quantum state over a long distance securely and reliably. Here, we solve this challenge by proposing a resource-efficient remote blind qubit preparation (RBQP) protocol, with weak coherent pulses for the client to produce, using a compact and low-cost laser. We experimentally verify a key step of RBQP-quantum nondemolition measurement-in the field test over 100 km of fiber. Our experiment uses a quantum teleportation setup in the telecom wavelength and generates 1000 secure qubits with an average fidelity of (86.9±1.5)%, which exceeds the quantum no-cloning fidelity of equatorial qubit states. The results prove the feasibility of UBQC over long distances, and thus serves as a key milestone towards secure cloud quantum computing.

DOI
10.1103/physrevlett.123.100503

Related papers

Blind Quantum Computing with Weak Coherent Pulses

Vedran Dunjko, Elham Kashefi, Anthony Leverrier

The universal blind quantum computation (UBQC) protocol [A. Broadbent, J. Fitzsimons, and E. Kashefi, in Proceedings of the 50th Annual IEEE Symposiumon Foundations of Computer Science (IEEE Computer Society, Los Alamitos, CA, USA, 2009), pp. 517-526.] allows a client to perform quantum computation on a remote server. In an ideal setting, perfect privacy is guaranteed if the client is capable of producing specific, randomly chosen single qubit states. While from a theoretical point of view, this may constitute the lowest possible quantum requirement, from a pragmatic point of view, generation of such states to be sent along long distances can never be achieved perfectly. We introduce the concept of ϵ blindness for UBQC, in analogy to the concept of ϵ security developed for other cryptographic protocols, allowing us to characterize the robustness and security properties of the protocol under possible imperfections. We also present a remote blind single qubit preparation protocol with weak coherent pulses for the client to prepare, in a delegated fashion, quantum states arbitrarily close to perfect random single qubit states. This allows us to efficiently achieve ϵ-blind UBQC for any ϵ>0, even if the channel between the client and the server is arbitrarily lossy.

arXiv:1108.5571•Physical Review Letters•May 18, 2012•118 citations

Blind Quantum Computing with Decoy States

Xu, Ke, Hoi‐Kwong Lo

In this paper, we study the Universal Blind Quantum Computing (UBQC) protocol, which allows a client to perform quantum computation on a remote quantum server and the Remote Blind qubit state Preparation (RBSP) protocol which allows the client to prepare single qubits on the server's location with week coherent pulses. This RBSP protocol is inefficient for small $ T $, because the required number of pulses for generating one single qubit scales as $ \mbox{O}(1/T^4) $, where $ T $ is the transmittance of the quantum channe between the client and the server. Our contribution in this paper is a modified RBSP protocol with decoy states. This new protocol allows us to generate $ S $ single qubits simultaneously in a single instance. With our new rotocol, we are able to reduce the number of weak coherent pulses required for generating one single qubit from $ \mbox{O}(1/T^4) $ to nearly $ \mbox{O}(1/T) $, significantly increasing the efficiency. For a 100 km standard telecom fiber of loss 0.2 dB/km, our method gives a six orders of magnitude improvement in the speed, which is very significant.

arXiv:1508.07910•Aug 31, 2015•7 citations

Blinding quantum computation using alternative sources

Chunfeng Huang, Tianyu Huang, Qianyu Lin +1 more

Quantum computation has seen rapid progress in the past years. Due to implementation complexity and cost, cloud-based quantum computing is strongly believed to be the most feasible framework for individual users. Universal blind quantum computing (UBQC) provides the protocol for secure delegation of arbitrary quantum computations and has received significant attention. However, one of the major challenges in UBQC is a secure and reliable transmission of a quantum state over a long distance. Herein, we improve the efficiency of UBQC using alternative photon sources. Our analysis shows that a heralded single-photon source can significantly improve the transmitted distance of UBQC and a modified coherent source can reduce the required transmitted number of pulses. Furthermore, we study the finite-data-size effect, which is a crucial for real-world applications. Our proposed scheme can be a promising alternative for the future development of UBQC.

Physical Review A•Jul 26, 2021•3 citations

Fault-tolerant verifiable blind quantum computing with logical state remote preparation

Yuki Takeuchi, Keisuke Fujii, Tomoyuki Morimae +1 more

Verifiable blind quantum computing allows a client with poor quantum devices to delegate universal quantum computing to a remote quantum server in such a way that the client's privacy is protected and the honesty of the server is verified. In existing protocols, the client has to send single-qubit states to the server. These states might be decohered by the channel noise. Furthermore, the client hides some "trap" qubits in the server's register so that the client can detect the server's deviation. In reality, however, these trap qubits are disturbed by imperfect operations by the server, which reduces the probability that the client accepts the honest server. To solve these problems, we propose a new gadget that allows the client to remotely prepare encoded logical single-qubit states in the server's place. Importantly, in our fault-tolerant verifiable blind quantum computing protocol, the client needs only the ability of physical single-qubit measurements in $X$ and $Z$ bases.

arXiv:1607.01568•Jul 6, 2016•15 citations

Gate Teleportation-based Universal Blind Quantum Computation

Xiaoqian Zhang

Blind quantum computation (BQC) allows that a client who has limited quantum abilities can delegate quantum computation to a server who has advanced quantum technologies but learns nothing about the client's private information. However, it still remains a challenge to directly encrypt quantum algorithms in circuits model. To solve the problem, we propose GTUBQC, the first gate teleportation-based universal BQC protocol. In this paper, we consider a scenario where a trusted center is responsible for preparing initial states, a client with the ability to perform X, Z does not require any quantum memory, and two servers conducting UBQC (universal BQC) and Bell measurements. GTUBQC can hide the universal quantum gates by encrypting the rotation angles, because arbitrary unitary operation can be decomposed into a combination of arbitrary rotation operators. We prove the blindness and correctness of GTUBQC, and apply our approach to other types of computational tasks, such as quantum Fourier transform.

arXiv:1809.00185•Sep 1, 2018•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
Quantum computing has seen tremendous progress in past years. Due to implementation complexity and cost, the future path of quantum computation is strongly believed to delegate computational tasks to powerful quantum servers on the cloud. Universal blind quantum computing (UBQC) provides the protocol for the secure delegation of arbitrary quantum computations, and it has received significant attention. However, a great challenge in UBQC is how to transmit a quantum state over a long distance securely and reliably. Here, we solve this challenge by proposing a resource-efficient remote blind qubit preparation (RBQP) protocol, with weak coherent pulses for the client to produce, using a compact and low-cost laser. We experimentally verify a key step of RBQP-quantum nondemolition measurement-in the field test over 100 km of fiber. Our experiment uses a quantum teleportation setup in the telecom wavelength and generates 1000 secure qubits with an average fidelity of (86.9±1.5)%, which exceeds the quantum no-cloning fidelity of equatorial qubit states. The results prove the feasibility of UBQC over long distances, and thus serves as a key milestone towards secure cloud quantum computing.
The universal blind quantum computation (UBQC) protocol [A. Broadbent, J. Fitzsimons, and E. Kashefi, in Proceedings of the 50th Annual IEEE Symposiumon Foundations of Computer Science (IEEE Computer Society, Los Alamitos, CA, USA, 2009), pp. 517-526.] allows a client to perform quantum computation on a remote server. In an ideal setting, perfect privacy is guaranteed if the client is capable of producing specific, randomly chosen single qubit states. While from a theoretical point of view, this may constitute the lowest possible quantum requirement, from a pragmatic point of view, generation of such states to be sent along long distances can never be achieved perfectly. We introduce the concept of ϵ blindness for UBQC, in analogy to the concept of ϵ security developed for other cryptographic protocols, allowing us to characterize the robustness and security properties of the protocol under possible imperfections. We also present a remote blind single qubit preparation protocol with weak coherent pulses for the client to prepare, in a delegated fashion, quantum states arbitrarily close to perfect random single qubit states. This allows us to efficiently achieve ϵ-blind UBQC for any ϵ>0, even if the channel between the client and the server is arbitrarily lossy.
In this paper, we study the Universal Blind Quantum Computing (UBQC) protocol, which allows a client to perform quantum computation on a remote quantum server and the Remote Blind qubit state Preparation (RBSP) protocol which allows the client to prepare single qubits on the server's location with week coherent pulses. This RBSP protocol is inefficient for small $ T $, because the required number of pulses for generating one single qubit scales as $ \mbox{O}(1/T^4) $, where $ T $ is the transmittance of the quantum channe between the client and the server. Our contribution in this paper is a modified RBSP protocol with decoy states. This new protocol allows us to generate $ S $ single qubits simultaneously in a single instance. With our new rotocol, we are able to reduce the number of weak coherent pulses required for generating one single qubit from $ \mbox{O}(1/T^4) $ to nearly $ \mbox{O}(1/T) $, significantly increasing the efficiency. For a 100 km standard telecom fiber of loss 0.2 dB/km, our method gives a six orders of magnitude improvement in the speed, which is very significant.
Quantum computation has seen rapid progress in the past years. Due to implementation complexity and cost, cloud-based quantum computing is strongly believed to be the most feasible framework for individual users. Universal blind quantum computing (UBQC) provides the protocol for secure delegation of arbitrary quantum computations and has received significant attention. However, one of the major challenges in UBQC is a secure and reliable transmission of a quantum state over a long distance. Herein, we improve the efficiency of UBQC using alternative photon sources. Our analysis shows that a heralded single-photon source can significantly improve the transmitted distance of UBQC and a modified coherent source can reduce the required transmitted number of pulses. Furthermore, we study the finite-data-size effect, which is a crucial for real-world applications. Our proposed scheme can be a promising alternative for the future development of UBQC.
Verifiable blind quantum computing allows a client with poor quantum devices to delegate universal quantum computing to a remote quantum server in such a way that the client's privacy is protected and the honesty of the server is verified. In existing protocols, the client has to send single-qubit states to the server. These states might be decohered by the channel noise. Furthermore, the client hides some "trap" qubits in the server's register so that the client can detect the server's deviation. In reality, however, these trap qubits are disturbed by imperfect operations by the server, which reduces the probability that the client accepts the honest server. To solve these problems, we propose a new gadget that allows the client to remotely prepare encoded logical single-qubit states in the server's place. Importantly, in our fault-tolerant verifiable blind quantum computing protocol, the client needs only the ability of physical single-qubit measurements in XXX and ZZZ bases.
Blind quantum computation (BQC) allows that a client who has limited quantum abilities can delegate quantum computation to a server who has advanced quantum technologies but learns nothing about the client's private information. However, it still remains a challenge to directly encrypt quantum algorithms in circuits model. To solve the problem, we propose GTUBQC, the first gate teleportation-based universal BQC protocol. In this paper, we consider a scenario where a trusted center is responsible for preparing initial states, a client with the ability to perform X, Z does not require any quantum memory, and two servers conducting UBQC (universal BQC) and Bell measurements. GTUBQC can hide the universal quantum gates by encrypting the rotation angles, because arbitrary unitary operation can be decomposed into a combination of arbitrary rotation operators. We prove the blindness and correctness of GTUBQC, and apply our approach to other types of computational tasks, such as quantum Fourier transform.
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.