Information Theoretically Secure Hypothesis Test for Temporally Unstructured Quantum Computation (Extended 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 c...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2018-03
Main Authors: Mills, Daniel, Pappa, Anna, Kapourniotis, Theodoros, Kashefi, Elham
Format: Article
Language:English
Subjects:
Certification
Computer simulation
Quantum computers
Quantum computing
Quantum phenomena
Qubits (quantum computing)
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:2331-8422
DOI:10.48550/arxiv.1803.00706