Robustness and device independence of verifiable blind quantum computing
From MaRDI portal
Abstract: Recent advances in theoretical and experimental quantum computing bring us closer to scalable quantum computing devices. This makes the need for protocols that verify the correct functionality of quantum operations timely and has led to the field of quantum verification. In this paper we address key challenges to make quantum verification protocols applicable to experimental implementations. We prove the robustness of the single server verifiable universal blind quantum computing protocol of Fitzsimons and Kashefi (2012) in the most general scenario. This includes the case where the purification of the deviated input state is in the hands of an adversarial server. The proved robustness property allows the composition of this protocol with a device-independent state tomography protocol that we give, which is based on the rigidity of CHSH games as proposed by Reichardt, Unger and Vazirani (2013). The resulting composite protocol has lower round complexity for the verification of entangled quantum servers with a classical verifier and, as we show, can be made fault tolerant.
Recommendations
- Optimised resource construction for verifiable quantum computation
- Verifier-on-a-leash: new schemes for verifiable delegated quantum computation, with quasilinear resources
- Verifying quantum computations at scale: a cryptographic leash on quantum devices
- Blindness and verification of quantum computation with one pure qubit
- Public verifiable measurement-only blind quantum computation based on entanglement witnesses
Cites work
- Actively secure two-party evaluation of any quantum operation
- Blindness and verification of quantum computation with one pure qubit
- Classical cryptographic protocols in a quantum world
- Composable security of delegated quantum computation
- Generalized self-testing and the security of the 6-state protocol
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- Proposed experiment to test local hidden-variable theories
- Quantum one-time programs. (Extended abstract)
- The computational complexity of linear optics
- The Knowledge Complexity of Interactive Proof Systems
- The measurement calculus
- Theory of Cryptography
- Theory of Cryptography
- Universal Blind Quantum Computation
- Universally composable quantum multi-party computation
Cited in
(25)- Universal blind quantum computation for hybrid system
- Single-server blind quantum computation with quantum circuit model
- Finite-data-size study on practical universal blind quantum computation
- 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
- Constant-round blind classical verification of quantum sampling
- A hybrid universal blind quantum computation
- Verification of quantum computation: an overview of existing approaches
- Public verifiable measurement-only blind quantum computation based on entanglement witnesses
- Blindness and verification of quantum computation with one pure qubit
- Optimised resource construction for verifiable quantum computation
- Information theoretically secure hypothesis test for temporally unstructured quantum computation (extended abstract)
- Robust Quantum Algorithms with ε-Biased Oracles
- Simple and tight device-independent security proofs
- scientific article; zbMATH DE number 7375938 (Why is no real title available?)
- scientific article; zbMATH DE number 7561499 (Why is no real title available?)
- A simple protocol for verifiable delegation of quantum computation in one round
- Blind quantum computation with hybrid model
- Sumcheck-based delegation of quantum computing to rational server
- Rigidity of quantum steering and one-sided device-independent verifiable quantum computation
- Multi-agent blind quantum computation without universal cluster states
- Half-blind quantum computation with operation teleportation
- Blind quantum computation with fewer quantum and delegated cost of client
- Robustness verification of quantum classifiers
This page was built for publication: Robustness and device independence of verifiable blind quantum computing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5151595)
