Verification of quantum computation and the price of trust

DOI10.1007/978-3-319-58747-9_3MaRDI QIDQ2399359zbMATH OpenOpenAlexFDO

Authors Alexandru Gheorghiu, Theodoros Kapourniotis, Elham Kashefi

Publication date 22 August 2017

Full work available at URL https://www.pure.ed.ac.uk/ws/files/38871779/extended_abstract_3.pdf

Mathematics Subject Classification ID

Quantum computation (81P68) Specification and verification (program logics, model checking, etc.) (68Q60) Quantum cryptography (quantum-theoretic aspects) (81P94)

Recommendations

• Classical verification of quantum computations
• How to Verify a Quantum Computation
• Verifying quantum computations at scale: a cryptographic leash on quantum devices
• Verification of quantum computation: an overview of existing approaches
• Verifier-on-a-leash: new schemes for verifiable delegated quantum computation, with quasilinear resources

Cites work

• A polynomial quantum algorithm for approximating the Jones polynomial
• BLIND QUANTUM COMPUTATION
• Blindness and verification of quantum computation with one pure qubit
• How to Verify a Quantum Computation
• Interactive proofs for \(\mathsf{BQP}\) via self-tested graph states
• Optimised resource construction for verifiable quantum computation
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Secure assisted quantum computation
• Universal Blind Quantum Computation
• Verification of quantum computation and the price of trust

Cited in

(3)

• Verification of quantum computation: an overview of existing approaches
• How to Verify a Quantum Computation
• Verification of quantum computation and the price of trust

This page was built for publication: Verification of quantum computation and the price of trust

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