Information Theoretically Secure Hypothesis Test for Temporally Unstructured Quantum Computation
arXiv:1704.01998 · doi:10.4204/EPTCS.266.14
Abstract
We propose a new composable and information-theoretically secure protocol to verify that a server has the power to sample from a sub-universal quantum machine implementing only commuting gates. By allowing the client to manipulate single qubits, we exploit properties of Measurement based Blind Quantum Computing to prove security against a malicious Server and therefore certify quantum supremacy without the need for a universal quantum computer.
arXiv comment27 pages, 16 figures
References in corpus (21)
- Quantum Simulation
- Measurement-based quantum computation with cluster states
- Multi-party entanglement in graph states
- On the Power of One Bit of Quantum Information
- Universal blind quantum computation
- Efficient Classical Simulation of Continuous Variable Quantum Information Processes
- Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
- Average-case complexity versus approximate simulation of commuting quantum computations
- Unconditionally verifiable blind computation
- Achieving quantum supremacy with sparse and noisy commuting quantum computations
- Instantaneous Quantum Computation
- Determinism in the one-way model
- Reconstruction of Gaussian quantum mechanics from Liouville mechanics with an epistemic restriction
- Fault-Tolerant Computing With Biased-Noise Superconducting Qubits
- On the hardness of classically simulating the one clean qubit model
- Quantum Supremacy for Simulating A Translation-Invariant Ising Spin Model
- Composable security of delegated quantum computation
- Completeness of the classical 2D Ising model and universal quantum computation
- Optimised resource construction for verifiable quantum computation
- Measurement-based classical computation
- An introduction to boson-sampling
Cited by in corpus (7)
- Verification of quantum computation: An overview of existing approaches
- Verification of Many-Qubit States
- Sample complexity of device-independently certified "quantum supremacy"
- Application-Motivated, Holistic Benchmarking of a Full Quantum Computing Stack
- Efficient verification of Boson Sampling
- Nonadaptive fault-tolerant verification of quantum supremacy with noise
- Methods for Classically Simulating Noisy Networked Quantum Architectures