Grover's Algorithm/Superposition?

  • Thread starter Bonham
  • Start date
In summary, the conversation discusses the potential use of Grover's Algorithm in quantum computers to search for specific entries in a large database. This involves manipulating laser pulses and superposition to find the desired entry with high accuracy. It is noted that measurement would cause the superposition to collapse, but with enough qubits and multiple computations, the desired state can be identified with high probability. The process is complex and requires more than 20 qubits.
  • #1
Bonham
1
0
Hello everyone. I'm only just starting to look into degree programs for physics, so this question may not be worded well, or make much sense. Hopefully it does.

According to a couple of books I've read, you could theoretically search a large database for specific entries in a quantum computer using Grover's Algorithm. This involves using laser pulses to find the correct entry, inverting it's wavelets, and then inverting the system about the average until the correct entry's amplitude is high enough for the system to collapse from superposition into it with high accuracy.

It's my understanding that if an atom in superposition is measured or observed in any way, the superposition will collapse immediately. My question is, how is it possible to search for the correct entry using laser pulses without causing to superposition to collapse?
 
Physics news on Phys.org
  • #2
Yo uare right in that the superposition will collapse upon measurement, but bear in mind that you need many qubits to perform the search. As a very simplified example, let's say that you want to search a database with 1 million posts in it. Then you need 20 qubits just to be able to represent a million different states (classical states, as 2^20 > 10^6). During the quantum information processing, all the 20 qubits will be in a large superposition, where all are entangled with each other. After the processing is complete, you do your read out, and the state with the highest probability amplitude should be your desired state.

Though note that the quantum computer is probabilistic and that you in general do not have a 100% chance of finding the right state, but rather that as you measure and collapse the superposition, the right state has the highest probability of being measured after the collapse. One would then have to redo the computation several times in order to gain statistics of which state has the highest probability.

Also note that this picture is greatly simplified, for example to actually do the computation you would need a lot more than 20 qubits, because you also need temporary qubits during the computation, but that's another story.

Hope that helped.
 

FAQ: Grover's Algorithm/Superposition?

What is Grover's Algorithm?

Grover's Algorithm is a quantum algorithm developed by Lov Grover in 1996. It is used to search an unsorted database with a quadratic speedup compared to classical algorithms.

How does Grover's Algorithm work?

Grover's Algorithm uses superposition and interference to search through an unsorted database of N items in O(√N) time. It does this by applying a series of quantum operations on the database, including an oracle function and a diffusion operator.

What is superposition in quantum computing?

Superposition is a fundamental principle in quantum mechanics that states that a quantum system can exist in multiple states simultaneously. This allows quantum computers to perform calculations on multiple inputs at the same time, leading to a massive speedup over classical computers.

What is the difference between superposition and entanglement?

Superposition and entanglement are both concepts in quantum mechanics, but they are distinct from each other. Superposition refers to the ability of a quantum system to exist in multiple states simultaneously, while entanglement refers to the correlation between two or more quantum systems.

What are some applications of Grover's Algorithm?

Grover's Algorithm has potential applications in searching through large databases, solving NP-complete problems, and optimizing machine learning algorithms. It is also used in the development of quantum error correction codes and quantum cryptography protocols.

Similar threads

Replies
1
Views
1K
Replies
2
Views
1K
Replies
2
Views
1K
Replies
2
Views
2K
Replies
1
Views
2K
Replies
2
Views
1K
Replies
1
Views
830
Replies
24
Views
2K
Back
Top