Decompositions of \(n\)-qubit Toffoli gates with linear circuit complexity

DOI10.1007/s10773-017-3389-4zbMath1383.81056OpenAlexW2609567360MaRDI QIDQ1701223

Peng Zhang

Publication date: 22 February 2018

Published in: International Journal of Theoretical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10773-017-3389-4

zbMATH Keywords

circuit complexityquantum circuitToffoli gateClifford gates

Mathematics Subject Classification ID

Quantum computation (81P68) Analytic circuit theory (94C05) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items

A fault-tolerant and scalable column-wise reversible quantum multiplier with a reduced size, Implementation of quantum walks on IBM quantum computers, Quantum string matching unfolded and extended, Improved quantum analysis of SPECK and LowMC, Robust quantum arithmetic operations with intermediate qutrits in the NISQ-era

Cites Work

• Synthesis and optimization of reversible circuits—a survey
• Quantum computational networks
• A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
• Universal quantum computation with ideal Clifford gates and noisy ancillas
• Rapid solution of problems by quantum computation
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Unnamed Item
• Unnamed Item
• Unnamed Item