Subspace projection method for unstructured searches with noisy quantum oracles using a signal-based quantum emulation device

详细信息    查看全文

• 作者：Brian R. La Cour ; Corey I. Ostrove
• 关键词：Quantum computing ; Quantum search ; Grover’s algorithm ; Analog electronics
• 刊名：Quantum Information Processing
• 出版年：2017
• 出版时间：January 2017
• 年：2017
• 卷：16
• 期：1
• 全文大小：614KB
• 刊物类别：Physics and Astronomy
• 刊物主题：Quantum Information Technology, Spintronics; Quantum Computing; Data Structures, Cryptology and Information Theory; Quantum Physics; Mathematical Physics;
• 出版者：Springer US
• ISSN：1573-1332
• 卷排序：16

文摘

This paper describes a novel approach to solving unstructured search problems using a classical, signal-based emulation of a quantum computer. The classical nature of the representation allows one to perform subspace projections in addition to the usual unitary gate operations. Although bandwidth requirements will limit the scale of problems that can be solved by this method, it can nevertheless provide a significant computational advantage for problems of limited size. In particular, we find that, for the same number of noisy oracle calls, the proposed subspace projection method provides a higher probability of success for finding a solution than does an single application of Grover’s algorithm on the same device.