Verification of quantum computation: an overview of existing approaches
From MaRDI portal
Publication:2311888
DOI10.1007/s00224-018-9872-3zbMath1423.68281arXiv1709.06984OpenAlexW2758002822MaRDI QIDQ2311888
Elham Kashefi, Theodoros Kapourniotis, Alexandru Gheorghiu
Publication date: 4 July 2019
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1709.06984
quantum cryptographydelegated quantum computationblind quantum computingverification of quantum computation
Quantum computation (81P68) Specification and verification (program logics, model checking, etc.) (68Q60) Quantum cryptography (quantum-theoretic aspects) (81P94)
Related Items (9)
Graphic lattices made by graph felicitous-type labelings and colorings of topological coding ⋮ \texttt{tqix}: a toolbox for quantum in \texttt{x}. \texttt{x}: quantum measurement, quantum tomography, quantum metrology, and others ⋮ Various matching keys for asymmetric topology encryption ⋮ Direct state measurements under state-preparation-and-measurement errors ⋮ Security limitations of classical-client delegated quantum computing ⋮ An automated deductive verification framework for circuit-building quantum programs ⋮ Quantum spin half algebra and generalized Megrelishvili protocol for confidentiality of digital images ⋮ Unnamed Item ⋮ Verifying quantum computations at scale: A cryptographic leash on quantum devices
Cites Work
- Einstein, incompleteness, and the epistemic view of quantum states
- Verifier-on-a-leash: new schemes for verifiable delegated quantum computation, with quasilinear resources
- Quantum fully homomorphic encryption with verification
- A fault-tolerant one-way quantum computer
- (Leveled) fully homomorphic encryption without bootstrapping
- Quantum Homomorphic Encryption for Polynomial-Sized Circuits
- Quantum One-Time Programs
- Composable Security of Delegated Quantum Computation
- Demonstration of Blind Quantum Computing
- Optimised resource construction for verifiable quantum computation
- A Multiprover Interactive Proof System for the Local Hamiltonian Problem
- Quantum Computation and Quantum Information
- Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
- Classical Homomorphic Encryption for Quantum Circuits
- Fault-Tolerant Quantum Computation with Constant Error Rate
- BLIND QUANTUM COMPUTATION
- Quantum Homomorphic Encryption for Circuits of Low T-gate Complexity
- Temporally unstructured quantum computation
- Fully Homomorphic Encryption over the Integers
- Exponential algorithmic speedup by a quantum walk
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- IP = PSPACE
- Quantum Complexity Theory
- Simple unified form for the major no-hidden-variables theorems
- How to Verify a Quantum Computation
- Realizable Hamiltonians for universal adiabatic quantum computers
- Robust self-testing of the singlet
- Beitrag zur Theorie des Ferromagnetismus
- Robustness and device independence of verifiable blind quantum computing
- Universal Blind Quantum Computation
- Fully homomorphic encryption using ideal lattices
- Computational Complexity
- Classical verification of quantum proofs
- Proposed Experiment to Test Local Hidden-Variable Theories
- The computational complexity of linear optics
- The Complexity of the Local Hamiltonian Problem
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Rigidity of quantum steering and one-sided device-independent verifiable quantum computation
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Verification of quantum computation: an overview of existing approaches
