Experimental Realization of a One-way Quantum Computer Algorithm Solving Simon's Problem
arXiv:1410.3859 · doi:10.1103/PhysRevLett.113.200501
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.
9 pages, 5 figures
References in corpus (12)
- Quantum Computing
- Photonic quantum technologies
- High-speed linear optics quantum computing using active feed-forward
- Detecting Genuine Multipartite Entanglement with Two Local Measurements
- Novel schemes for measurement-based quantum computation
- Measurement-based quantum computation beyond the one-way model
- Photonic crystal fibre source of photon pairs for quantum information processing
- Experimental demonstration of a graph state quantum error-correction code
- Nonclassical 2-photon interference with separate intrinsically narrowband fibre sources
- A scalable, high-speed measurement-based quantum computer using trapped ions
- Experimental Realization of the Deutsch-Jozsa Algorithm with a Six-Qubit Cluster State
- Compact Toffoli gate using weighted graph states