Quantum search in a possible three-dimensional complex subspace

Quantum search in a possible three-dimensional complex subspace Suppose we are given an unsorted database with N items and N is sufficiently large. By using a simpler approximate method, we re-derive the approximate formula cos2 Φ, which represents the maximum success probability of Grover’s algorithm corresponding to the case of identical rotation angles $${\phi=\theta}$$ for any fixed deflection angle $${\Phi \in\left[0,\pi/2\right)}$$ . We further show that for any fixed $${\Phi \in\left[0,\pi/2\right)}$$ , the case of identical rotation angles $${\phi=\theta}$$ is energetically favorable compared to the case $${\left|{\theta - \phi}\right|\gg 0}$$ for enhancing the probability of measuring a unique desired state. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Quantum Information Processing Springer Journals

Quantum search in a possible three-dimensional complex subspace

Loading next page...
 
/lp/springer_journal/quantum-search-in-a-possible-three-dimensional-complex-subspace-sqMVW0RQpo
Publisher
Springer US
Copyright
Copyright © 2011 by Springer Science+Business Media, LLC
Subject
Physics; Computer Science, general; Theoretical, Mathematical and Computational Physics; Quantum Physics; Mathematics, general; Physics, general
ISSN
1570-0755
eISSN
1573-1332
D.O.I.
10.1007/s11128-011-0230-5
Publisher site
See Article on Publisher Site

Abstract

Suppose we are given an unsorted database with N items and N is sufficiently large. By using a simpler approximate method, we re-derive the approximate formula cos2 Φ, which represents the maximum success probability of Grover’s algorithm corresponding to the case of identical rotation angles $${\phi=\theta}$$ for any fixed deflection angle $${\Phi \in\left[0,\pi/2\right)}$$ . We further show that for any fixed $${\Phi \in\left[0,\pi/2\right)}$$ , the case of identical rotation angles $${\phi=\theta}$$ is energetically favorable compared to the case $${\left|{\theta - \phi}\right|\gg 0}$$ for enhancing the probability of measuring a unique desired state.

Journal

Quantum Information ProcessingSpringer Journals

Published: Feb 11, 2011

References

  • Experimental NMR realization of a generalized quantum search algorithm
    Long, G.L.; Yan, H.Y.; Li, Y.S.; Tu, C.C.; Tao, J.X.; Chen, H.M.; Liu, M.L.; Zhang, X.; Luo, J.; Xiao, L.; Zeng, X.Z.

You’re reading a free preview. Subscribe to read the entire article.


DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Search

Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly

Organize

Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.

Access

Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

DeepDyve

Freelancer

DeepDyve

Pro

Price

FREE

$49/month
$360/year

Save searches from
Google Scholar,
PubMed

Create lists to
organize your research

Export lists, citations

Read DeepDyve articles

Abstract access only

Unlimited access to over
18 million full-text articles

Print

20 pages / month

PDF Discount

20% off