Information Theoretically Secure Hypothesis Test for Temporally Unstructured Quantum Computation (Extended Abstract)

Abstract

The efficient certification of classically intractable quantum devices has been a central research question for some time. However, to observe a "quantum advantage", it is believed that one does not need to build a large scale universal quantum computer, a task which has proven extremely challenging. Intermediate quantum models that are easier to implement, but which also exhibit this quantum advantage over classical computers, have been proposed. In this work, we present a certification technique for such a sub-universal quantum server which only performs commuting gates and requires very limited quantum memory. By allowing a verifying client to manipulate single qubits, we exploit properties of measurement based blind quantum computing to give them the tools to test the "quantum superiority" of the server.

In Proceedings QPL 2017, arXiv:1802.09737

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