How to Verify a Quantum Computation
From MaRDI portal
Publication:4568113
DOI10.4086/toc.2018.v014a011zbMath1395.68142arXiv1509.09180OpenAlexW2201916012MaRDI QIDQ4568113
Publication date: 15 June 2018
Published in: Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1509.09180
cryptographyquantum computingquantum cryptographyinteractive proofscomplexity theoryquantum interactive proofs
Analysis of algorithms and problem complexity (68Q25) Quantum computation (81P68) Quantum algorithms and complexity in the theory of computing (68Q12) Quantum cryptography (quantum-theoretic aspects) (81P94)
Related Items (8)
Verification of quantum computation and the price of trust ⋮ Secure two-party computation based on blind quantum computation ⋮ A hybrid universal blind quantum computation ⋮ The Road to Quantum Computational Supremacy ⋮ An automated deductive verification framework for circuit-building quantum programs ⋮ Unnamed Item ⋮ Verification of quantum computation: an overview of existing approaches ⋮ Measurement-based universal blind quantum computation with minor resources
Cites Work
- Unnamed Item
- Unnamed Item
- A new universal and fault-tolerant quantum basis
- Using entanglement in quantum multi-prover interactive proofs
- Minimum disclosure proofs of knowledge
- PSPACE has constant-round quantum interactive proof systems
- Interactive proof systems with polynomially bounded strategies
- Composable Security of Delegated Quantum Computation
- Optimised resource construction for verifiable quantum computation
- Delegating Computation
- Quantum Homomorphic Encryption for Circuits of Low T-gate Complexity
- Cryptography in the Bounded-Quantum-Storage Model
- The Knowledge Complexity of Interactive Proof Systems
- Algebraic methods for interactive proof systems
- Universal Blind Quantum Computation
- A polynomial quantum algorithm for approximating the Jones polynomial
This page was built for publication: How to Verify a Quantum Computation
