Qfactory: classically-instructed remote secret qubits preparation

DOI10.1007/978-3-030-34578-5_22zbMATH Open1456.94066arXiv1904.06303OpenAlexW2990616282MaRDI QIDQ2181900FDOQ2181900

Authors: Alexandru Cojocaru, Léo Colisson, Elham Kashefi, Petros Wallden 

Publication date: 20 May 2020

Abstract: The functionality of classically-instructed remotely prepared random secret qubits was introduced in (Cojocaru et al 2018) as a way to enable classical parties to participate in secure quantum computation and communications protocols. The idea is that a classical party (client) instructs a quantum party (server) to generate a qubit to the server's side that is random, unknown to the server but known to the client. Such task is only possible under computational assumptions. In this contribution we define a simpler (basic) primitive consisting of only BB84 states, and give a protocol that realizes this primitive and that is secure against the strongest possible adversary (an arbitrarily deviating malicious server). The specific functions used, were constructed based on known trapdoor one-way functions, resulting to the security of our basic primitive being reduced to the hardness of the Learning With Errors problem. We then give a number of extensions, building on this basic module: extension to larger set of states (that includes non-Clifford states); proper consideration of the abort case; and verifiablity on the module level. The latter is based on "blind self-testing", a notion we introduced, proved in a limited setting and conjectured its validity for the most general case.

Full work available at URL: https://arxiv.org/abs/1904.06303

Recommendations

• Security limitations of classical-client delegated quantum computing
• Secure quantum computation with classical communication
• BLIND QUANTUM COMPUTATION
• Composing Quantum Protocols in a Classical Environment
• Remote Preparation of Quantum States

zbMATH Keywords

learning with errorsprovable securityclassical delegated quantum computation

Mathematics Subject Classification ID

Cryptography (94A60) Quantum computation (81P68)

Cited In (8)

• Semi-quantum money
• Multi-agent blind quantum computation without universal cluster states
• Semi-quantum copy-protection and more
• Classical homomorphic encryption for quantum circuits
• Classical Homomorphic Encryption for Quantum Circuits
• Sumcheck-based delegation of quantum computing to rational server
• Quantum encryption with certified deletion, revisited: public key, attribute-based, and classical communication
• Security limitations of classical-client delegated quantum computing

This page was built for publication: Qfactory: classically-instructed remote secret qubits preparation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2181900)