Undergrad They physics of phase inversion in Grover's algorithm

Click For Summary
Phase inversion in Grover's algorithm is a crucial operator that alters the phase of specific states while leaving others unchanged, facilitating the search for solutions in a quantum superposition. Implementing this operator physically on a quantum computer typically involves using a "solution checker" that verifies whether a given input meets the problem's criteria, often utilizing a Z gate for phase inversion. The complexity of the implementation can vary significantly depending on the specific problem, such as 3-SAT, where multiple clauses must be satisfied. For more intricate problems, circuit generation tools may be necessary to create the required quantum circuits. Understanding the physical implementation of phase inversion is essential for optimizing Grover's algorithm in practical quantum computing applications.
dreamspy
Messages
41
Reaction score
3
How would this operator be implemented physically if we had a quantum computer?

In Grover's algorithm this magical operator is often called "phase inversion". Here is the operator from wiki:

https://wikimedia.org/api/rest_v1/media/math/render/svg/07fb23bffa787430b084971c6a108a8f6ff6c2b3

It’s an operator that does nothing to most of the states, except it inverts the phase of the states we’re looking for. (for all states x where f(x) = 1).

I assume we are using the feature of quantum mechanics that we can input a superposition of all possible states, and acting upon them all at the same time with our operators, then at the end, measuring the state of the system, giving us the state we're looking for with high probability (p > 1/2).

So I repeat my question:

How would this operator be implemented physically if we had a quantum computer?

Thanks
Frímann Kjerúlf
BSc Physics - University of Iceland
 
Physics news on Phys.org
dreamspy said:
Here is the operator from wiki:

You need to give a lot more context. Please give a link to the full article. Or, even better, to a textbook or peer-reviewed paper that discusses this operator.
 
The black box in Grover's algorithm depends on the problem you're trying to solve. But generally it's just a "solution checker" that checks if a given input is correct, hits the "is it correct?" bit with a Z gate, then uncomputes all the junk it created while doing that.

A simple example is searching for a 3-SAT solution. Suppose we want to find boolean values for x, y, and z that satisfy:

$$(x \lor y \lor z) \land (\lnot x \lor \lnot y \lor \lnot z) \land (\lnot x \lor y \lor \lnot z)$$

To check a solution, you need to check if each clause is satisfied then combine those answers into one big 'all clauses satisfied' answer. Which, combined with the Z gate and uncomputation, looks something like exactly this:

3sat-grover.png


Of course this is a very simple case. In more complicated cases, like checking if the input encodes a valid proof of a theorem, the circuit can get very complicated. You would want to use a tool to generate the circuit, based on some C code or whatever.
 
Last edited:
Time reversal invariant Hamiltonians must satisfy ##[H,\Theta]=0## where ##\Theta## is time reversal operator. However, in some texts (for example see Many-body Quantum Theory in Condensed Matter Physics an introduction, HENRIK BRUUS and KARSTEN FLENSBERG, Corrected version: 14 January 2016, section 7.1.4) the time reversal invariant condition is introduced as ##H=H^*##. How these two conditions are identical?

Similar threads

  • · Replies 1 ·
Replies
1
Views
2K
Replies
4
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 11 ·
Replies
11
Views
2K
  • · Replies 11 ·
Replies
11
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 2 ·
Replies
2
Views
975
  • · Replies 2 ·
Replies
2
Views
2K