Liking cljdoc? Tell your friends :D
Clojure only.

org.soulspace.qclojure.application.algorithm.quantum-fourier-transform

inverse-quantum-fourier-transform-circuitclj

(inverse-quantum-fourier-transform-circuit n)

Create an Inverse Quantum Fourier Transform (IQFT) circuit.

The IQFT undoes the QFT and is critical for quantum phase estimation in Shor's algorithm and other quantum algorithms.

Parameters:

  • n: Number of qubits

Returns: Quantum circuit implementing the complete IQFT

Example: (def iqft-circuit (inverse-quantum-fourier-transform-circuit 3))

Create an Inverse Quantum Fourier Transform (IQFT) circuit.

The IQFT undoes the QFT and is critical for quantum phase estimation
in Shor's algorithm and other quantum algorithms.

Parameters:
- n: Number of qubits

Returns:
Quantum circuit implementing the complete IQFT

Example:
(def iqft-circuit (inverse-quantum-fourier-transform-circuit 3))
sourceraw docstring

quantum-fourier-transform-circuitclj

(quantum-fourier-transform-circuit n)

Create a Quantum Fourier Transform (QFT) circuit.

Creates a complete QFT circuit that transforms computational basis states into their quantum Fourier transformed states. The QFT is the quantum analog of the discrete Fourier transform and is essential for many quantum algorithms including Shor's factoring algorithm and quantum phase estimation.

The QFT algorithm consists of:

  1. Apply Hadamard gate to each qubit
  2. Apply controlled rotation gates with angles π/2^k
  3. Reverse qubit order with SWAP gates

Parameters:

  • n: Number of qubits

Returns: Quantum circuit implementing the complete QFT

Example: (def qft-circuit (quantum-fourier-transform-circuit 3)) ;=> Complete 3-qubit QFT circuit

Create a Quantum Fourier Transform (QFT) circuit.

Creates a complete QFT circuit that transforms computational basis states
into their quantum Fourier transformed states. The QFT is the quantum
analog of the discrete Fourier transform and is essential for many quantum
algorithms including Shor's factoring algorithm and quantum phase estimation.

The QFT algorithm consists of:
1. Apply Hadamard gate to each qubit
2. Apply controlled rotation gates with angles π/2^k
3. Reverse qubit order with SWAP gates

Parameters:
- n: Number of qubits

Returns:
Quantum circuit implementing the complete QFT

Example:
(def qft-circuit (quantum-fourier-transform-circuit 3))
;=> Complete 3-qubit QFT circuit
sourceraw docstring

cljdoc is a website building & hosting documentation for Clojure/Script libraries

Keyboard shortcutsReport a problemcljdoc on GitHub
× close