Polylogarithmic-depth controlled-NOT gates without ancilla qubits.

ABSTRACT: Controlled operations are fundamental building blocks of quantum algorithms. Decomposing n-control-NOT gates (Cⁿ(X)) into arbitrary single-qubit and CNOT gates, is a crucial but non-trivial task. This study introduces Cⁿ(X) circuits outperforming previous methods in the asymptotic and non-asymptotic regimes. Three distinct decompositions are presented: an exact one using one borrowed ancilla with a circuit depth Θ(log(n)3) , an approximating one without ancilla qubits with a circuit depth O(log(n)3log(1/ϵ)) and an exact one with an adjustable-depth circuit which decreases with the number m≤n of ancilla qubits available as O(log(n/⌊m/2⌋)3+log(⌊m/2⌋)) . The resulting exponential speedup is likely to have a substantial impact on fault-tolerant quantum computing by improv

SUBMITTER: Claudon B 

PROVIDER: S-EPMC11246449 | biostudies-literature | 2024 Jul

REPOSITORIES: biostudies-literature