Skip to main content

qft_complexity_ty

oxilean_std::quantum_computing::functions

Function qft_complexity_ty 

Source 
pub fn qft_complexity_ty() -> Expr
Expand description

QFTComplexity : ∀ n : Nat, QFTGateCount n ≤ Nat.pow n 2 The QFT on n qubits requires O(n²) gates.