Robustness and device independence of verifiable blind quantum computing
From MaRDI portal
Publication:5151595
DOI10.1088/1367-2630/17/8/083040zbMath1454.81050arXiv1502.02571OpenAlexW3105135005WikidataQ62099863 ScholiaQ62099863MaRDI QIDQ5151595
Petros Wallden, Alexandru Gheorghiu, Elham Kashefi
Publication date: 19 February 2021
Published in: New Journal of Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1502.02571
Quantum computation (81P68) Quantum coding (general) (81P70) Quantum state tomography, quantum state discrimination (81P18)
Related Items (15)
Constant-round blind classical verification of quantum sampling ⋮ Rigidity of quantum steering and one-sided device-independent verifiable quantum computation ⋮ Unnamed Item ⋮ Universal blind quantum computation for hybrid system ⋮ A hybrid universal blind quantum computation ⋮ Optimised resource construction for verifiable quantum computation ⋮ Simple and Tight Device-Independent Security Proofs ⋮ Blind quantum computation with hybrid model ⋮ Single-server blind quantum computation with quantum circuit model ⋮ Unnamed Item ⋮ Sumcheck-based delegation of quantum computing to rational server ⋮ Verification of quantum computation: an overview of existing approaches ⋮ Measurement-based universal blind quantum computation with minor resources ⋮ The brickwork state with fewer qubits in blind quantum computation ⋮ Multiparty blind quantum computation protocol with deterministic mutual identity authentication
Cites Work
- Unnamed Item
- Unnamed Item
- Quantum One-Time Programs
- Actively Secure Two-Party Evaluation of Any Quantum Operation
- Composable Security of Delegated Quantum Computation
- Generalized Self-testing and the Security of the 6-State Protocol
- The measurement calculus
- Universally Composable Quantum Multi-party Computation
- The Knowledge Complexity of Interactive Proof Systems
- Universal Blind Quantum Computation
- Classical Cryptographic Protocols in a Quantum World
- Proposed Experiment to Test Local Hidden-Variable Theories
- The computational complexity of linear optics
- Theory of Cryptography
- Theory of Cryptography
This page was built for publication: Robustness and device independence of verifiable blind quantum computing