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

Physics Today

A blind quantum computer makes its laboratory debut

Johanna L. Miller

Published Mar 1, 2012• 0 citations
Publisher

Abstract

Quantum computing promises great efficiency advantages over classical computing. Quantum communication promises tamper-proof security. Combine them, and you get blind quantum computing.
DOI
10.1063/pt.3.1464

Related papers

A blind quantum computer's laboratory debut

Johanna L. Miller

Quantum computing promises greater efficiency than classical computing. Quantum communication promises tamper-proof security. Combine the two and you get blind quantum computing. <... Quantum computing promises greater efficiency than classical computing. Quantum communication promises tamper-proof security. Combine the two and you get blind quantum computing. <...

Physics Today•Feb 1, 2012•0 citations

A novel quantum multiparty blind signature scheme based on χ state

Xingjia Wei, Shuangshuang Luo, Depeng Meng +2 more

Quantum digital signature, as an extension of classical digital signature, has become an important research content in quantum cryptography. Quantum blind signature combines the advantages of classical blind signature and quantum signature, which can ensure the unconditional security of the scheme based on the realization of the blinded signature of the message, and can be effectively applied in many real-world scenarios. This paper uses the four-particle [Formula: see text] state as a communication channel, combined with quantum teleportation technology to propose a new quantum multi-party blind signature protocol, which has the following characteristics: First, the Toeplitz hash function based on the linear shift register is introduced to blind the message, and the length of the blinded message can be adjusted according to the actual demand to increase the flexibility of the scheme; Second, through multi-party participation, the blind signature of multi-bit messages can be realized, and the signature efficiency can be improved. Compared with other quantum blind signatures, the signature efficiency has been greatly improved; Finally, using the four-particle [Formula: see text] state as a quantum channel can make the scheme use fewer resources to transmit data and increases the security of the scheme. Through security analysis, it can be seen that the scheme has blindness, nonrepudiation and unforgeability.

International Journal of Quantum Information•Feb 18, 2024•4 citations

Establishing quantum advantage

Adam Bouland

What are quantum computers good for? This essay reviews the progress toward proving a quantum advantage over classical computing.

XRDS Crossroads The ACM Magazine for Students•Sep 20, 2016•1 citation

Secure Multi-Party Quantum Computation Based on Blind Quantum Computation

Gui-Ju Qu, Ming‐Ming Wang

International Journal of Theoretical Physics•Jul 12, 2021•11 citations

Deterministic entanglement distillation for secure double-server blind quantum computation

Yu‐Bo Sheng, Lan Zhou

Blind quantum computation (BQC) provides an efficient method for the client who does not have enough sophisticated technology and knowledge to perform universal quantum computation. The single-server BQC protocol requires the client to have some minimum quantum ability, while the double-server BQC protocol makes the client's device completely classical, resorting to the pure and clean Bell state shared by two servers. Here, we provide a deterministic entanglement distillation protocol in a practical noisy environment for the double-server BQC protocol. This protocol can get the pure maximally entangled Bell state. The success probability can reach 100% in principle. The distilled maximally entangled states can be remaind to perform the BQC protocol subsequently. The parties who perform the distillation protocol do not need to exchange the classical information and they learn nothing from the client. It makes this protocol unconditionally secure and suitable for the future BQC protocol.

arXiv:1311.2263•Scientific Reports•Jan 15, 2015•156 citations

Secure quantum fog computing model based on blind quantum computation

Zhiguo Qu, Kunyi Wang, Min Xin Zheng

Journal of Ambient Intelligence and Humanized Computing•Aug 10, 2021•19 citations
Quantum digital signature, as an extension of classical digital signature, has become an important research content in quantum cryptography. Quantum blind signature combines the advantages of classical blind signature and quantum signature, which can ensure the unconditional security of the scheme based on the realization of the blinded signature of the message, and can be effectively applied in many real-world scenarios. This paper uses the four-particle [Formula: see text] state as a communication channel, combined with quantum teleportation technology to propose a new quantum multi-party blind signature protocol, which has the following characteristics: First, the Toeplitz hash function based on the linear shift register is introduced to blind the message, and the length of the blinded message can be adjusted according to the actual demand to increase the flexibility of the scheme; Second, through multi-party participation, the blind signature of multi-bit messages can be realized, and the signature efficiency can be improved. Compared with other quantum blind signatures, the signature efficiency has been greatly improved; Finally, using the four-particle [Formula: see text] state as a quantum channel can make the scheme use fewer resources to transmit data and increases the security of the scheme. Through security analysis, it can be seen that the scheme has blindness, nonrepudiation and unforgeability.
Blind quantum computation (BQC) provides an efficient method for the client who does not have enough sophisticated technology and knowledge to perform universal quantum computation. The single-server BQC protocol requires the client to have some minimum quantum ability, while the double-server BQC protocol makes the client's device completely classical, resorting to the pure and clean Bell state shared by two servers. Here, we provide a deterministic entanglement distillation protocol in a practical noisy environment for the double-server BQC protocol. This protocol can get the pure maximally entangled Bell state. The success probability can reach 100% in principle. The distilled maximally entangled states can be remaind to perform the BQC protocol subsequently. The parties who perform the distillation protocol do not need to exchange the classical information and they learn nothing from the client. It makes this protocol unconditionally secure and suitable for the future BQC protocol.