Unifying Quantum Verification and Error-Detection: Theory and Tools for Optimisations
IACR Cryptology ePrint Archive(2022)
摘要
With the advent of cloud-based quantum computing, it has become vital to
provide strong guarantees that computations delegated by clients to quantum
service providers have been executed faithfully. Secure - blind and verifiable
- Delegated Quantum Computing (SDQC) has emerged as one of the key approaches
to address this challenge, yet current protocols lack at least one of the
following three ingredients: composability, noise-robustness and modularity.
To tackle this question, our paper lays out the fundamental structure of SDQC
protocols, namely mixing two components: the computation which the client would
like the server to perform and tests that are designed to detect a server's
malicious behaviour. Using this abstraction, our main technical result is a set
of sufficient conditions on these components which imply the security and
noise-robustness of generic SDQC protocols in the composable Abstract
Cryptography framework. This is done by establishing a correspondence between
these security properties and the error-detection capabilities of the test
computations. Changing the types of tests and how they are mixed with the
client's computation automatically yields new SDQC protocols with different
security and noise-robustness capabilities.
This approach thereby provides the desired modularity as our sufficient
conditions on test computations simplify the steps required to prove the
security of the protocols and allows to focus on the design and optimisation of
test rounds to specific situations. We showcase this by systematising the
search for improved SDQC protocols for Bounded-error Quantum Polynomial-time
computations. The resulting protocols do not require more hardware on the
server's side than what is necessary to blindly delegate the computation
without verification, and they outperform all previously known results.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要