Optimised resource construction for verifiable quantum computation
From MaRDI portal
Abstract: Recent developments make the possibility of achieving scalable quantum networks and quantum devices closer. From the computational point of view these emerging technologies become relevant when they are no longer classically simulatable. Hence a pressing challenge is the construction of practical methods to verify the correctness of the outcome produced by universal or non-universal quantum devices. A promising approach that has been extensively explored is the scheme of verification via encryption through blind quantum computing initiated by Fitzsimons and Kashefi. We present here a new construction that simplifies the required resources for any such verifiable blind quantum computating protocol. We obtain an overhead that is linear in the size of the input, while the security parameter remains independent of the size of the computation and can be made exponentially small. Furthermore our construction is generic and could be applied to any non-universal scheme with a given underlying graph.
Recommendations
- Robustness and device independence of verifiable blind quantum computing
- 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
- How to Verify a Quantum Computation
- Blindness and verification of quantum computation with one pure qubit
Cites work
- A polynomial quantum algorithm for approximating the Jones polynomial
- Blindness and verification of quantum computation with one pure qubit
- Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy.
- Composable security of delegated quantum computation
- Interactive proofs for \(\mathsf{BQP}\) via self-tested graph states
- Multiparty entanglement in graph states
- Practical sharing of quantum secrets over untrusted channels
- Quantum one-time programs. (Extended abstract)
- Robustness and device independence of verifiable blind quantum computing
- The computational complexity of linear optics
- The measurement calculus
- Universal Blind Quantum Computation
Cited in
(8)- Verification of quantum computation: an overview of existing approaches
- Verification of quantum computation and the price of trust
- Blindness and verification of quantum computation with one pure qubit
- Information theoretically secure hypothesis test for temporally unstructured quantum computation (extended abstract)
- How to Verify a Quantum Computation
- scientific article; zbMATH DE number 7561499 (Why is no real title available?)
- Robustness and device independence of verifiable blind quantum computing
- Rigidity of quantum steering and one-sided device-independent verifiable quantum computation
This page was built for publication: Optimised resource construction for verifiable quantum computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2988006)
