Multiparty Delegated Quantum Computing
arXiv:1606.09200 · doi:10.3390/cryptography1020012
Abstract
Quantum computing has seen tremendous progress in the past years. However, due to limitations in scalability of quantum technologies, it seems that we are far from constructing universal quantum computers for everyday users. A more feasible solution is the delegation of computation to powerful quantum servers on the network. This solution was proposed in previous studies of Blind Quantum Computation, with guarantees for both the secrecy of the input and of the computation being performed. In this work, we further develop this idea of computing over encrypted data, to propose a multiparty delegated quantum computing protocol in the measurement-based quantum computing framework.
22 pages
References in corpus (1)
Cited by in corpus (28)
- Advances in Quantum Cryptography
- Machine learning \& artificial intelligence in the quantum domain
- Secure Multi-party Quantum Computation with a Dishonest Majority
- Multi-client distributed blind quantum computation with the Qline architecture
- On the possibility of classical client blind quantum computing
- Garbled Quantum Computation
- Reducing resources for verification of quantum computations
- Composable security in relativistic quantum cryptography
- Quantum leakage detection using a model-independent dimension witness
- Quantum cryptography beyond key distribution: theory and experiment
- QEnclave -- A practical solution for secure quantum cloud computing
- Verification of graph states in an untrusted network
- Quantum Searchable Encryption for Cloud Data Based on Full-Blind Quantum Computation
- Security Limitations of Classical-Client Delegated Quantum Computing
- Experimental verifiable multi-client blind quantum computing on a Qline architecture
- Modular Quantum-to-Quantum Bernoulli Factory in an Integrated Photonic Processor
- Communication Cost of Quantum Processes
- Measurement-based universal blind quantum computation with minor resources
- An Overview of CV-MDI-QKD
- Oblivious Transfer from Zero-Knowledge Proofs, or How to Achieve Round-Optimal Quantum Oblivious Transfer and Zero-Knowledge Proofs on Quantum States
- Composable Security for Multipartite Entanglement Verification
- Optimal allocation of quantum resources
- Representation matching for delegated quantum computing
- Practical parallel self-testing of Bell states via magic rectangles
- Asymmetric Quantum Secure Multi-Party Computation With Weak Clients Against Dishonest Majority
- Secure Two-Party Quantum Computation Over Classical Channels
- Unifying communication paradigms in measurement-based delegated quantum computing
- Complexity and multi-functional variants of the Quantum-to-Quantum Bernoulli Factories