共 50 条
Experimental Realization of a One-Way Quantum Computer Algorithm Solving Simon's Problem
被引:23
|作者:
Tame, M. S.
[1
,2
]
Bell, B. A.
[3
]
Di Franco, C.
[4
]
Wadsworth, W. J.
[5
]
Rarity, J. G.
[3
]
机构:
[1] Univ KwaZulu Natal, Sch Chem & Phys, ZA-4001 Durban, South Africa
[2] Univ KwaZulu Natal, Natl Inst Theoret Phys, ZA-4001 Durban, South Africa
[3] Univ Bristol, Dept Elect & Elect Engn, Photon Grp, Bristol BS8 1UB, Avon, England
[4] Univ London Imperial Coll Sci Technol & Med, Quantum Opt & Laser Sci Grp, London SW7 2AZ, England
[5] Univ Bath, Dept Phys, CPPM, Bath BA2 7AY, Avon, England
基金:
英国工程与自然科学研究理事会;
关键词:
COMPUTATION;
STATE;
D O I:
10.1103/PhysRevLett.113.200501
中图分类号:
O4 [物理学];
学科分类号:
0702 ;
摘要:
We report an experimental demonstration of a one-way implementation of a quantum algorithm solving Simon's problem-a black-box period-finding problem that 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.
引用
下载
收藏
页数:6
相关论文