文章基本信息

标题：Quantum parity algorithms as oracle calls, and application in Grover Database search
本地全文：下载
作者：M. Z. Rashad
期刊名称：Advanced Computing : an International Journal
印刷版ISSN：2229-726X
电子版ISSN：2229-6727
出版年度：2012
卷号：3
期号：2
DOI：10.5121/acij.2012.3201
出版社：Academy & Industry Research Collaboration Center (AIRCC)
摘要：This paper discusses the determination of the parity of a string of N binary digits, the well-known problem in classical as well as quantum information processing. It can be formulated as an oracle problem. It has been established that quantum algorithms require at least N /2 oracle calls. We present an algorithm that reaches this lower bound and is also optimal in terms of additional gate operations required.
关键词：parity; quantum computing; oracle.