Verification of quantum computation and the price of trust

DOI10.1007/978-3-319-58747-9_3zbMath1423.68280OpenAlexW2611732016MaRDI QIDQ2399359

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)

Related Items (1)

Verification of quantum computation and the price of trust

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Verification of quantum computation and the price of trust
• Optimised resource construction for verifiable quantum computation
• BLIND QUANTUM COMPUTATION
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• How to Verify a Quantum Computation
• Universal Blind Quantum Computation
• A polynomial quantum algorithm for approximating the Jones polynomial

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