"Quantum computational approaches improve upon classical methods for a number of specialized tasks. The extent of quantum computing’s applicability is still being determined. It does not provide efficient solutions to all problems; neither does it provide a universal way of circumventing the slowing of Moore’s law. Strong limitations on the power of quantum computation are known; for many problems, it has been proven that quantum computation provides no significant advantage over classical computation. Grover’s algorithm, the other major algorithm of the mid- 1990s, provides a small speedup for unstructured search algorithms. But it is also known that this small speedup is the most that quantum algorithms can attain. Grover’s search algorithm applies to unstructured search. For other search problems, such as searching an ordered list, quantum computation provides no significant advantage over classical computation. Simulation of quantum systems is the other significant application of quantum computation known in the mid-1990s. Of interest in its own right, the simulation of increasingly larger quantum systems may provide a bootstrap that will ultimately lead to the building of a scalable quantum computer. After Grover’s algorithm, there was a hiatus of more than five years before a significantly new algorithm was discovered. During that time, other areas of quantum information processing, such as quantum error correction, advanced significantly. In the early 2000s, several new algorithms were discovered. Like Shor’s algorithm, these algorithms solve specific problems with narrow, if important, applications. Novel approaches to constructing quantum algorithms also developed. Investigations of quantum simulation from a quantum-information-processing point of view have led to improved classical techniques for simulating quantum systems, as well as novel quantum approaches. Similarly, the quantum-information-processing point of view has led to novel insights into classical computing, including new classical algorithms. Furthermore, alternatives to the standard circuit model of quantum computation have been developed that have led to new quantum algorithms, breakthroughs in building quantum computers, new approaches to robustness, and significant insights into the key elements of quantum computation."
Quote Details
Added by wikiquote-import-bot
Unverified quote
0 likes
Original Language: English
Available Languages (1)
Sources
Eleanor Rieffel and Wolfgang Polak, Quantum Computing: A Gentle Introduction (2011), 1. Introduction
https://en.wikiquote.org/wiki/Grover's_algorithm
Revision History
No revisions have been submitted for this quote.
Categories
Grover's algorithm
1 quote on TrueQuotesView all quotes by Grover's algorithm →
Related Quotes
"... was formalized by a number of authors ... as the requirement that the wave function of a multi-electron system is…"
"What is the empirical content of quantum mechanics? Or how does the wave function assigned to a relate to the results…"
"… what is the wave function? Is it a complete and comprehensive representation of the world? Or do we need additional…"
"It has been known for some time that the Yang-Baxter equations can be solved using s. More recently it was discovered…"
"At an early stage the Yang-Baxter equation (YBE) appeared in several different guises in the literature, and sometime…"
"The origins of es is one of the biggest mysteries in modern physics since they are beyond the realm of the Standard M…"
"... Roughly speaking, in renormalizable theories no coupling constants can have the dimensions of negative powers of …"
"That the pion-nucleon (πN) coupling constant is fundamental in our understanding of the Cosmos has been adequately em…"
"About 40 years ago, in the study of quantum s … , in particular in the framework of the … , new algebraic structures …"
"… The relied not on the detection of photon pairs with a certain energy but on the detection of more of those pairs t…"