Circuit for the inverse quantum Fourier transform

Click For Summary
SUMMARY

The discussion centers on the inverse quantum Fourier transform (IQFT) and its circuit representation. The correct formulation of the IQFT involves a change in the signs of the exponentials in the quantum state transformation. Participants identified that simply reversing the quantum Fourier transform circuit does not yield the correct IQFT circuit without adjusting the gates, particularly the R_k gates. The resolution involved exchanging the inputs and outputs of the R_k gates, leading to the correct inverse operation.

PREREQUISITES
  • Understanding of quantum states and notation, specifically |k⟩ and |j⟩.
  • Familiarity with quantum gates, particularly the Hadamard gate and R_k gates.
  • Knowledge of quantum circuit reversibility principles.
  • Basic grasp of complex exponentials in quantum mechanics.
NEXT STEPS
  • Study the mathematical formulation of the inverse quantum Fourier transform in detail.
  • Learn about the implementation and significance of the Hadamard gate in quantum circuits.
  • Explore the concept of quantum circuit reversibility and its implications for quantum algorithms.
  • Investigate the role of R_k gates in quantum computing and their transformations.
USEFUL FOR

Quantum computing enthusiasts, researchers in quantum algorithms, and students studying quantum mechanics and circuit design will benefit from this discussion.

Haorong Wu
Messages
419
Reaction score
90
Homework Statement
Give a quantum circuit to perform the inverse quantum Fourier
Relevant Equations
The quantum Fourier transform is defined as ##\left | j \right > =\frac 1 {\sqrt {2^n}} \sum_{j=0}^{2^n-1} e^{2 \pi ijk / 2^n} \left | k \right >##, and it is equal to ##\left | j_1 , j_2 , \dots , j_n \right > \rightarrow \frac { \left ( \left | 0 \right > + e^{2 \pi i 0.j_n} \left | 1 \right > \right ) \left ( \left | 0 \right > + e^{2 \pi i 0. j_{n-1} j_n} \left | 1 \right > \right ) \dots \left ( \left | 0 \right > + e^{2 \pi i 0. j_1 j_2 \dots j_n} \left | 1 \right > \right ) } {2^{n/2}}##
First, the inverse quantum Fourier transform is ##\left | k \right > =\frac 1 {\sqrt {2^n}} \sum_{j=0}^{2^n-1} e^{-2 \pi ijk / 2^n} \left | j \right >##, and it is equal to ##\left | k_1 , k_2 , \dots , k_n \right > \rightarrow \frac { \left ( \left | 0 \right > + e^{-2 \pi i 0.k_n} \left | 1 \right > \right ) \left ( \left | 0 \right > + e^{-2 \pi i 0. k_{n-1} k_n} \left | 1 \right > \right ) \dots \left ( \left | 0 \right > + e^{-2 \pi i 0. k_1 k_2 \dots k_n} \left | 1 \right > \right ) } {2^{n/2}}##
where I merely change the signs in the exponentials.

Second, since the quantum circuits are reversible, then I think if I reverse the quantum Fourier transform circuit, then I should have the circuit for the inverse quantum Fourier transform as I did in the picture:
微信图片_20190621093246.jpg


Then, I tried to calculate the outcome of the circuit:
## \left | k_n \dots k_1 \right > \\ \rightarrow \left | k_n \dots k_2 \right > \frac {\left | 0 \right > + e^{2\pi i 0.k_1} \left | 1 \right >} {\sqrt 2} \\ \rightarrow \left | k_n \dots k_3 \right > \frac {\left | k_2 , 0 \right > + e^{2\pi i 0.k_1 k_2} \left |k_2, 1 \right >} {\sqrt 2} =\left | k_n \dots k_2 \right > \frac {\left | 0 \right > + e^{2\pi i 0.k_1 k_2} \left | 1 \right >} {\sqrt 2} \\ \rightarrow \left | k_n \dots k_3 \right > \frac {\left | 0 \right > + e^{2\pi i 0.k_2} \left | 1 \right >} {\sqrt 2} \frac {\left | 0 \right > + e^{2\pi i 0.k_1 k_2} \left | 1 \right >} {\sqrt 2} \\ \dots \\ \rightarrow \frac { \left ( \left | 0 \right > + e^{2\pi i 0.k_n} \left | 1 \right > \right ) \left ( \left | 0 \right > + e^{2\pi i 0. k_{n-1} k_n } \left | 1 \right > \right ) \dots \left ( \left | 0 \right > + e^{2\pi i 0.k_1 k_2 \dots k_n} \left | 1 \right > \right ) } {2^{n/2}}##
which does not match the previous equation. The signs in the exponentials are positive instead of negative.

I think there may be some possible mistakes:
1. I got the wrong inverse quantum Fourier transform, or
2. though quantum circuits are reversible, merely reversing the circuit of quantum Fourier transform will not yield the proper circuit for inverse quantum Fourier transform, or
3. (most probably) I miscalculate the changes in the circuits.

Also, I know that Hadamard gate can be expressed as ## \left | k \right > \rightarrow \frac {\left | 0 \right > + e^{2 \pi i 0.k} \left | 1 \right > } {\sqrt 2} = \frac {\left | 0 \right > + e^{-2 \pi i 0.k} \left | 1 \right > } {\sqrt 2}## where the negative sign appears in the exponential. Then how can I get other negative signs out? Should I change ##R_k=\begin{pmatrix} 1 & 0 \\ 0 & e^{2 \pi i/2^k} \end{pmatrix} ## to ##R_k=\begin{pmatrix} 1 & 0 \\ 0 & e^{-2 \pi i/2^k} \end{pmatrix} ##? If so, I believe the origin circuit is right for the inverse quantum Fourier transform.

Thanks!
 
Physics news on Phys.org
Haorong Wu said:
Should I change ##R_k=\begin{pmatrix} 1 & 0 \\ 0 & e^{2 \pi i/2^k} \end{pmatrix} ## to ##R_k=\begin{pmatrix} 1 & 0 \\ 0 & e^{-2 \pi i/2^k} \end{pmatrix} ##? If so, I believe the origin circuit is right for the inverse quantum Fourier transform.
Yes, I believe so. To reverse the circuit, you would need to reverse the action of each gate.
 
  • Like
Likes   Reactions: Haorong Wu
tnich said:
Yes, I believe so. To reverse the circuit, you would need to reverse the action of each gate.
Hi, tnich. Sorry to get back to you this late.

I forgot to exchange the inputs and outputs of the ##R_k## gates. After the exchange, ##R_k^{-1}= R_k^{\dagger}=\begin{pmatrix} 1 & 0 \\ 0 & e^{-2 \pi i/2^k} \end{pmatrix} ##. Then everything works out.

Thanks!
 

Similar threads

Replies
2
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
Replies
4
Views
2K
  • · Replies 5 ·
Replies
5
Views
807
  • · Replies 5 ·
Replies
5
Views
4K
  • · Replies 1 ·
Replies
1
Views
2K
Replies
24
Views
3K
Replies
4
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K