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

Springer theses

Summary and Discussion

Yu Watanabe

Published Dec 17, 2013• 0 citations
Publisher
DOI
10.1007/978-4-431-54493-7_10

Related papers

Summary and Discussion

Fei Yan, Salvador Elías Venegas-Andraca

Springer eBooks•Jan 1, 2020•0 citations

Summary and Conclusions

Manuel Gessner

Springer theses•Oct 3, 2016•1 citation

A summary on two new algorithms for Grover's unsorted database search problem

Shang Bin

In this summary we discuss two new algorithms for Grover's unsorted database search problem that claimed to have reached exponential speedup over Grover's original algorithm. One is in the quantum setting with "power queries" that allow for exponential reduction in the number of queries over Grover's original algorithm with "bit queries". The other is to use "dubit queries" on a duality computer - a new computing model uses a quantum system's wave-particle duality, which is able to achieve even greater computing power and better capability than existent quantum computers we have been discussing. We discuss the shortages and difficulties of both schemes as well.

arXiv:quant-ph/0603210•Mar 23, 2006•2 citations

Belavkin-Kolokoltsov Watch-Dog Effects in Interactively Controlled Stochastic Computer-Graphic Dynamical Systems. A Summary of Mathematical Researches

Denis V. Juriev

This paper contains a summary of mathematical researches of stochastic properties of the long time behavior of a continuously observed (and interactively controlled) quantum--field top. Applications to interactively controlled stochastic computer-graphic dynamical systems are also discussed.

arXiv:adap-org/9410001•Oct 10, 1994•1 citation

Conclusion and Discussion

Osamu Fukushima

Springer theses•Jan 1, 2025•0 citations

Letter to Dr. Dirac, January 15, 1928

Summary: Letter from N. Bohr to Dr. Dirac discussing his work and requesting a copy of his recent paper.

•Jan 15, 1928•0 citations
In this summary we discuss two new algorithms for Grover's unsorted database search problem that claimed to have reached exponential speedup over Grover's original algorithm. One is in the quantum setting with "power queries" that allow for exponential reduction in the number of queries over Grover's original algorithm with "bit queries". The other is to use "dubit queries" on a duality computer - a new computing model uses a quantum system's wave-particle duality, which is able to achieve even greater computing power and better capability than existent quantum computers we have been discussing. We discuss the shortages and difficulties of both schemes as well.