Quantum computation capability verification protocol for NISQ devices with dihedral coset problem

TL;DR

This paper introduces a protocol for verifying the quantum computational power of NISQ devices using the dihedral coset problem, serving as both a verification and benchmarking tool for current quantum hardware.

Contribution

It proposes a novel interactive verification protocol based on the dihedral coset problem and demonstrates its practical implementation on IBM Q devices.

Findings

Verification protocol is sensitive to hardware errors.

Protocol can benchmark locally fully connected quantum architectures.

Successful 4-qubit experiment on IBM Q device.

Abstract

In this article, we propose an interactive protocol for one party (the verifier) holding a quantum computer to verify the quantum computation power of another party's (the prover) device via a one-way quantum channel. This protocol is referred to as the dihedral coset problem (DCP) challenge. The verifier needs to prepare quantum states encoding secrets (DCP samples) and send them to the prover. The prover is then tasked with recovering those secrets with a certain accuracy. Numerical simulation demonstrates that this accuracy is sensitive to errors in quantum hardware. Additionally, the DCP challenge serves as benchmarking protocol for locally fully connected (LFC) quantum architecture and aims to be performed on current and near-future quantum resources. We conduct a 4-qubit experiment on one of IBM Q devices.