Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Chinese Science Bulletin

Deleting a marked state in quantum database in a duality computing mode

Yang Liu

Published Jun 7, 2013• 42 citations
Publisher
DOI
10.1007/s11434-013-5925-9

Related papers

A quantum algorithm that deletes marked states from an arbitrary database

Yang Liu, Xiaoping Ouyang

Chinese Science Bulletin•Jul 1, 2013•19 citations

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

Yang Liu, Long, Gui Lu

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.

arXiv:0710.3301•Oct 17, 2007•4 citations

Impossibility of deleting an unknown quantum state

Arun Kumar Pati, Samuel L. Braunstein

arXiv:quant-ph/9911090•Nature•Mar 9, 2000•383 citations

Duality quantum computing and its application

pXiangyu Kong, Gui Lu Longp

Journal of Physical Chemistry & Biophysics•Nov 29, 2018•0 citations

Quantum Query Complexity for Searching Multiple Marked States from an Unsorted Database

Shang Bin

An important and usual sort of search problems is to find all marked states from an unsorted database with a large number of states. Grover's original quantum search algorithm is for finding single marked state with uncertainty, and it has been generalized to the case of multiple marked states, as well as been modified to find single marked state with certainty. However, the query complexity for finding all multiple marked states has not been addressed. We use a generalized Long's algorithm with high precision to solve such a problem. We calculate the approximate query complexity, which increases with the number of marked states and with the precision that we demand. In the end we introduce an algorithm for the problem on a ``duality computer'' and show its advantage over other algorithms.

arXiv:quant-ph/0604059•Communications in Theoretical Physics•Aug 1, 2007•3 citations

The first iteration of Grover's algorithm using classical light with orbital angular momentum

Benjamin Perez-García, Raúl I. Hernández-Aranda, Andrew Forbes +1 more

We present an experimental realization of the first iteration in Grover's quantum algorithm using classical light and linear optical elements. The algorithm serves to find an entry marked by an oracle in an unstructured database. In our scheme, the quantum states encoding the database are represented by helical modes generated by means of a Spatial Light Modulator, while the marking corresponds to a π phase shift of the hidden mode. The optical implementation of Grover's algorithm then selectively amplifies the intensity of the marked mode such that it can be revealed by a modal decomposition. The core of the algorithm – a geometrical reflection of the point representing all database entries – is implemented in a single step independent of the size of the database. Moreover, we demonstrate experimentally that one iteration of the algorithm is enough to identify the marked entry, as a consequence of using classical states of light.

Journal of Modern Optics•May 29, 2018•24 citations
In this Letter we present a quantum deletion algorithm that deletes a marked state from an unsorted database of NNN 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.
An important and usual sort of search problems is to find all marked states from an unsorted database with a large number of states. Grover's original quantum search algorithm is for finding single marked state with uncertainty, and it has been generalized to the case of multiple marked states, as well as been modified to find single marked state with certainty. However, the query complexity for finding all multiple marked states has not been addressed. We use a generalized Long's algorithm with high precision to solve such a problem. We calculate the approximate query complexity, which increases with the number of marked states and with the precision that we demand. In the end we introduce an algorithm for the problem on a ``duality computer'' and show its advantage over other algorithms.
We present an experimental realization of the first iteration in Grover's quantum algorithm using classical light and linear optical elements. The algorithm serves to find an entry marked by an oracle in an unstructured database. In our scheme, the quantum states encoding the database are represented by helical modes generated by means of a Spatial Light Modulator, while the marking corresponds to a π phase shift of the hidden mode. The optical implementation of Grover's algorithm then selectively amplifies the intensity of the marked mode such that it can be revealed by a modal decomposition. The core of the algorithm – a geometrical reflection of the point representing all database entries – is implemented in a single step independent of the size of the database. Moreover, we demonstrate experimentally that one iteration of the algorithm is enough to identify the marked entry, as a consequence of using classical states of light.