Deleting a Marked Basis-State From an Even Superposition of All Basis-States With a Single Query

Liu, Yang; Long, Gui Lu

doi:10.1142/s0219749909005201

Cited by 8 publications

(12 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…0 < β π 3 , then J = 1 and φ = 2 arcsin 1 2 cos β , this algorithm only requires a single query in deleting processing. The case with an even superposition of N = 2 n basis states and a unique marked state is a special case of this general scenario [17], where sin β = 1 N , φ = 2 arcsin 1 2 N N−1…”

Section: Generalized Deletion Algorithm On Quantum Computermentioning

confidence: 99%

“…is satisfied in generic initial conditions, for example the problem in [17]. Then a single query is required in this deletion algorithm.…”

Section: Properties Of Generalized Quantum Deletion Algorithmmentioning

confidence: 99%

“…This could arise in situations where the deletion is used as a subroutine in a large quantum computation. Another example would be the given that initial distribution is intrinsically non-uniform and the marked solution is not unique.In this article, we generalize a quantum deletion algorithm [17] to the case that the number of marked items is more than one, the initial amplitudes are complex and follow an arbitrary distribution. Moreover we analyze the general behavior of deletion operator and give analytic results.…”

mentioning

confidence: 99%

“…In this article, we generalize a quantum deletion algorithm [17] to the case that the number of marked items is more than one, the initial amplitudes are complex and follow an arbitrary distribution. Moreover we analyze the general behavior of deletion operator and give analytic results.…”

mentioning

confidence: 99%

“…Some certain items do not satisfy the computing demands, then one should delete them. We have proposed quantum deletion algorithm [17] that deletes a marked item from unsorted N = 2 n item database. However, in a variety of practical cases, it would be desirable to apply it to deleting multiple number of marked items and non-uniform initial distribution, where N is not essentially the power of 2.…”

mentioning

confidence: 99%

See 4 more Smart Citations

A quantum algorithm that deletes marked states from an arbitrary database

Liu

Ouyang

2013

Chin. Sci. Bull.

Self Cite

View full text Add to dashboard Cite

We present a general quantum deletion algorithm that deletes M marked states from an N-item quantum database with arbitrary initial distribution. The general behavior of this algorithm is analyzed, and analytic result is given. When the number of marked states is no more than 3N 4 , this algorithm requires just a single query, and this achieves exponential speedup over classical algorithm. [6][7][8][9][10], recent interests have been focused on quantum algorithms using duality mode in a quantum register [11,12]. Deleting an item from a database is a routine task in database processing. In classical computing, deleting operation is an essential method to preserve data structure for convenient searching and visiting. For instance, in the basis technique of well-known Google search engine -PageRank algorithm [13,14], the most frequently clicked N items are selected from the magnanimity of information. Then the first N nodes form a heap structure and web pages with respect to the marked nodes are deleted to preserve the first N nodes Deleting items in a database is a widely met scientific problem in quantum computing. Some certain items do not satisfy the computing demands, then one should delete them. We have proposed quantum deletion algorithm [17] that deletes a marked item from unsorted N = 2 n item database. However, in a variety of practical cases, it would be desirable to apply it to deleting multiple number of marked items and non-uniform initial distribution, where N is not essentially the power of 2. This could arise in situations where the deletion is used as a subroutine in a large quantum computation. Another example would be the given that initial distribution is intrinsically non-uniform and the marked solution is not unique.In this article, we generalize a quantum deletion algorithm [17] to the case that the number of marked items is more than one, the initial amplitudes are complex and follow an arbitrary distribution. Moreover we analyze the general behavior of deletion operator and give analytic results. Finally, we

show abstract

Section: Generalized Deletion Algorithm On Quantum Computermentioning

confidence: 99%

“…is satisfied in generic initial conditions, for example the problem in [17]. Then a single query is required in this deletion algorithm.…”

Section: Properties Of Generalized Quantum Deletion Algorithmmentioning

confidence: 99%

mentioning

confidence: 99%

mentioning

confidence: 99%

mentioning

confidence: 99%

See 3 more Smart Citations

A quantum algorithm that deletes marked states from an arbitrary database

Liu

Ouyang

2013

Chin. Sci. Bull.

Self Cite

View full text Add to dashboard Cite

show abstract

Implementing of Quantum Cloning with Spatially Separated Quantum Dot Spins

Wen

Yeon

et al. 2016

Int J Theor Phys

View full text Add to dashboard Cite

We propose some schemes for implementing optimal symmetric (asymmetric) 1 → 2 universal quantum cloning, optimal symmetric (asymmetric) 1 → 2 phase-covariant cloning, optimal symmetric 1 → 3 economical phase-covariant cloning and optimal symmetric 1 → 3 economical real state cloning with spatially separated quantum dot spins by choosing the single-qubit rotation angles appropriately. The decoherences of the spontaneous emission of QDs, cavity decay and fiber loss are suppressed since the effective long-distance off-resonant interaction between two distant QDs is mediated by the vacuum fields of the fiber and cavity, and during the whole process no system is excited.

show abstract