Quantum computers can search arbitrarily large databases by a single query

Lov K. Grover

备注：: Several enhancements to the original paper
DOI：: 10.1103/PhysRevLett.79.4709

英文摘要：

This paper shows that a quantum mechanical algorithm that can query information relating to multiple items of the database, can search a database in a single query (a query is defined as any question to the database to which the database has to return a (YES/NO) answer). A classical algorithm will be limited to the information theoretic bound of at least O(log N) queries (which it would achieve by using a binary search).

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Deleting a marked item from an unsorted database with a single query

In this Letter we present a quantum deletion algorithm that deletes a marked state from an unsorted database of $N$ items with only a single query. This algorithm achieves exponential speedup compared with classical algorithm where O(N) number of query is required. General property of this deleting algorithm is also studied.

2007-10-17quant-ph

Quantum Database Searching by a Single Query

In this paper we give a quantum mechanical algorithm that can search a database by a single query, when the number of solutions is more than a quarter. It utilizes modified Grover operator of arbitrary phase.

1997-08-03quant-ph

Query complexity for searching multiple marked states from an unsorted database

An important and usual problem is to search all states we want from a database with a large number of states. In such, recall is vital. Grover's original quantum search algorithm has been generalized to the case of multiple solutions, but no one has calculated the query complexity in this case. We will use a generalized algorithm with higher precision to solve such a search problem that we should find all marked states and show that the practical query complexity increases with the number of marked states. In the end we will introduce an algorithm for the problem on a ``duality computer'' and …

2006-04-10quant-ph

Single quantum querying of a database

We present a class of fast quantum algorithms, based on Bernstein and Vazirani's parity problem, that retrieve the entire contents of a quantum database $Y$ in a single query. The class includes binary search problems and coin-weighing problems. Our methods far exceed the efficiency of classical algorithms which are bounded by the classical information-theoretic bound. We show the connection between classical algorithms based on several compression codes and our quantum-mechanical method.

1997-11-14quant-ph

A generic construction of quantum-oblivious-key-transfer-based private query with ideal database security and zero failure

Higher security and lower failure probability have always been people's pursuits in quantum-oblivious-key-transfer-based private query (QOKT-PQ) protocols since Jacobi \emph{et al}. [Phys. Rev. A 83, 022301 (2011)] proposed the first protocol of this kind. However, higher database security generally has to be obtained at the cost of a higher failure probability, and vice versa. Recently, based on a round-robin differential-phase-shift quantum key distribution protocol, Liu \emph{et al}. [Sci. China-Phys. Mech. Astron.58, 100301 (2015)] presented a private query protocol (RRDPS-PQ protocol) uti…

2017-06-23quant-ph

Quantum Private Queries: security analysis

We present a security analysis of the recently introduced Quantum Private Query (QPQ) protocol. It is a cheat sensitive quantum protocol to perform a private search on a classical database. It allows a user to retrieve an item from the database without revealing which item was retrieved, and at the same time it ensures data privacy of the database (the information that the user can retrieve in a query is bounded and does not depend on the size of the database). The security analysis is based on information-disturbance tradeoffs which show that whenever the provider tries to obtain information …

2008-09-11quant-ph

更多相关论文收起更多论文

云环境中用于隐私保护的基于量子的数据库查询方案

A Quantum-based Database Query Scheme for Privacy Preservation in Cloud Environment

针对云数据库查询中的双方隐私与通信开销问题，提出结合不经意传输、oracle、改进Grover迭代和偏移加密的量子查询方案，并验证其正确性、隐私性与效率。

2020-02-01cs.CRquant-ph