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

Secure quantum cloud computing with fault-tolerant verification

Yuki Takeuchi, Keisuke Fujii, Tomoyuki Morimae, Nobuyuki Imoto

Published Jul 6, 2016• 0 citations
OpenAlex

Related papers

Verification of secure cloud quantum computing

Tomoyuki Morimae

IEICE Technical Report; IEICE Tech. Rep.•May 2, 2014•0 citations

Applying quantum error-correcting codes for fault-tolerant blind quantum cloud computation

Qiang Zhao, John C. S. Lui

arXiv:2301.01960•Future Generation Computer Systems•Feb 24, 2026•1 citation

Plugging Leaks in Fault-Tolerant Quantum Computation and Verification

Theodoros Kapourniotis, Dominik Leichtle, Luka Music +1 more

With the advent of quantum cloud computing, the security of delegated quantum computation has become of utmost importance. While multiple statistically secure blind verification schemes in the prepare-and-send model have been proposed, none of them achieves full quantum fault-tolerance, a prerequisite for useful verification on scalable quantum computers. In this paper, we present the first fault-tolerant blind verification scheme for universal quantum computations able to handle secret-dependent noise on the verifier's quantum device. Composable security of the proposed protocol is proven in the Abstract Cryptography framework. Our main tools are two novel distillation protocols that turn secret-dependent noise into secret-independent noise. The first one is run by the verifier and acts on its noisy gates, while the second and more complex one is run entirely on the prover's device and acts on states provided by the verifier. Both are required to overcome the leakage induced by secret-dependent noise. We use these protocols to prepare states in the X-Y-plane whose noise is overwhelmingly secret-independent, which then allows us to verify with exponential confidence arbitrary fault-tolerant BQP computations.

arXiv:2510.03227•Oct 3, 2025•0 citations

Secure Quantum Cloud Computing

Ming‐Xing Luo

Springer eBooks•Jan 1, 2024•0 citations

Efficient Post-Quantum Secured Blind Computation

Davies, Ethan, Alastair Kay

In the medium term, quantum computing must tackle two key challenges: fault tolerance and security. Fault tolerance will be solved with sufficiently high quality experiments on large numbers of qubits, but the scale and complexity of these devices means that a cloud-based access model is likely to dominate. How can we risk evaluating valuable computations on an untrusted server? Here we detail a verifiable circuit-based model that only requires classical communication between parties. The server is blind to the details of the computation, which is computationally secure.

arXiv:2404.07052•Apr 10, 2024•0 citations

Towards quantum cloud computing

Xiaogang Qiang, Xiao Qi Zhou, Kanin Aungskunsiri +1 more

European Quantum Electronics Conference (EQEC)•Jul 21, 2014•0 citations
With the advent of quantum cloud computing, the security of delegated quantum computation has become of utmost importance. While multiple statistically secure blind verification schemes in the prepare-and-send model have been proposed, none of them achieves full quantum fault-tolerance, a prerequisite for useful verification on scalable quantum computers. In this paper, we present the first fault-tolerant blind verification scheme for universal quantum computations able to handle secret-dependent noise on the verifier's quantum device. Composable security of the proposed protocol is proven in the Abstract Cryptography framework. Our main tools are two novel distillation protocols that turn secret-dependent noise into secret-independent noise. The first one is run by the verifier and acts on its noisy gates, while the second and more complex one is run entirely on the prover's device and acts on states provided by the verifier. Both are required to overcome the leakage induced by secret-dependent noise. We use these protocols to prepare states in the X-Y-plane whose noise is overwhelmingly secret-independent, which then allows us to verify with exponential confidence arbitrary fault-tolerant BQP computations.
In the medium term, quantum computing must tackle two key challenges: fault tolerance and security. Fault tolerance will be solved with sufficiently high quality experiments on large numbers of qubits, but the scale and complexity of these devices means that a cloud-based access model is likely to dominate. How can we risk evaluating valuable computations on an untrusted server? Here we detail a verifiable circuit-based model that only requires classical communication between parties. The server is blind to the details of the computation, which is computationally secure.