Quantum Fourier transform

Click For Summary
SUMMARY

The Quantum Fourier Transform (QFT) is utilized in period finding algorithms, specifically for functions like f(x) ≡ a^x mod N. The input register consists of 2n qubits, while the output register is limited to n qubits. Ancilla bits are employed in the overall period finding circuit but do not contribute to the QFT's input size. The QFT effectively processes n input bits and n ancilla bits, discarding the ancilla bits as measured garbage, resulting in n outputs.

PREREQUISITES
  • Understanding of Quantum Computing principles
  • Familiarity with Quantum Fourier Transform (QFT)
  • Knowledge of qubit representation and manipulation
  • Basic concepts of period finding algorithms
NEXT STEPS
  • Study the implementation of Quantum Fourier Transform in quantum algorithms
  • Explore period finding algorithms, specifically Shor's algorithm
  • Investigate the role of ancilla bits in quantum circuits
  • Learn about qubit measurement and its implications in quantum computing
USEFUL FOR

Quantum computing enthusiasts, researchers in quantum algorithms, and professionals working on quantum circuit design.

jimmycricket
Messages
115
Reaction score
2
When using the Quantum Fourier transform to find the period of the function f(x)\equiv a^x\mod N why is it that the input register is 2n qubits in size and the output register is n qubits?
 
Physics news on Phys.org
The overall period finding circuit probably uses ancilla bits, but turns them into measured garbage along the way. The Quantum Fourier Transform doesn't need ancilla bits, or measurement, so it's not the cause for adding them.

Personally, I wouldn't count ancilla bits against the input size. The circuit takes n input bits and n ancilla bits, burns the neg-entropy in the ancilla bits, and produces n outputs.
 

Similar threads

  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 22 ·
Replies
22
Views
2K
Replies
8
Views
6K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 13 ·
Replies
13
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 16 ·
Replies
16
Views
4K
  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 2 ·
Replies
2
Views
1K