Experimental Realization of a One-way Quantum Computer Algorithm Solving Simon's Problem

TL;DR

This paper reports the first experimental demonstration of a one-way quantum algorithm solving Simon's Problem using an all-optical setup, showcasing the potential of measurement-based quantum computing to explore quantum advantages.

Contribution

It presents the first experimental realization of a one-way quantum algorithm for Simon's Problem, demonstrating practical implementation and analyzing scalability.

Findings

Experimental implementation matches theoretical predictions.

Successfully solves Simon's Problem with a five-qubit cluster state.

Highlights scalability considerations for larger qubit systems.

Abstract

We report an experimental demonstration of a one-way implementation of a quantum algorithm solving Simon's Problem - a black box period-finding problem which has an exponential gap between the classical and quantum runtime. Using an all-optical setup and modifying the bases of single-qubit measurements on a five-qubit cluster state, key representative functions of the logical two-qubit version's black box can be queried and solved. To the best of our knowledge, this work represents the first experimental realization of the quantum algorithm solving Simon's Problem. The experimental results are in excellent agreement with the theoretical model, demonstrating the successful performance of the algorithm. With a view to scaling up to larger numbers of qubits, we analyze the resource requirements for an n-qubit version. This work helps highlight how one-way quantum computing provides a practical route to experimentally investigating the quantum-classical gap in the query complexity model.