Resonant Quantum Search with Monitor Qubits

Wilczek, F; Hu, HY; Wu, B

This is not the latest version of this item. The latest version can be found here.

Resonant Quantum Search with Monitor Qubits

Download

Name

2002.09522.pdf

Description

Submitted version

Size

1.15 MB

Format

Adobe PDF

Checksum (MD5)

549545f14cc419b6aa7de09844abd5e1

sword-2020-11-17T14:34:18.original.xml (130 B)

Original SWORD entry document

Author(s)

Wilczek, F

•

Wilczek, F

•

Hu, HY

•

Wu, B

•

Wu, B

•

Wu, B

Journal

Chinese Physics Letters

Publisher

IOP Publishing

Version

Original manuscript

Abstract

© 2020 Chinese Physical Society and IOP Publishing Ltd. We present an algorithm for the generalized search problem (searching k marked items among N items) based on a continuous Hamiltonian and exploiting resonance. This resonant algorithm has the same time complexity as the Grover algorithm. A natural extension of the algorithm, incorporating auxiliary "monitor"qubits, can determine k precisely, if it is unknown. The time complexity of our counting algorithm is O(√N), similar to the best quantum approximate counting algorithm, or better, given appropriate physical resources.

Terms of Use

Creative Commons Attribution-Noncommercial-Share Alike

http://creativecommons.org/licenses/by-nc-sa/4.0/

Persistent DSpace Link

https://hdl.handle.net/1721.1/132573

DOI of Published Version

10.1088/0256-307X/37/5/050304