Decompositions of n-qubit Toffoli Gates with Linear Circuit Complexity

2017/04/26 by Yong He, Ming-Xing Luo, M. X. Luo +4 · 9 citations
Computer Science · #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum-Dot Cellular Automata

paper · doi:10.1007/s10773-017-3389-4

Citations

• Simulating physics with computers

Cited by

• Feature Encoding in Quantum Machine Learning: A Survey and Practical Guidelines
• A measurement-driven quantum algorithm for SAT: Performance guarantees via spectral gaps and measurement parallelization
• Reducing the Complexity of Matrix Multiplication to O(N²log₂N) by an Asymptotically Optimal Quantum Algorithm
• Polylogarithmic-depth controlled-NOT gates without ancilla qubits
• Decomposing Quantum Generalized Toffoli with an Arbitrary Number of Ancilla
• First-Quantized Quantum Simulation of Non-Relativistic QED with Emergent Topologically Protected Coulomb Interactions
• Space and Time Cost of Continuous Rotations in Surface Codes
• Solving reaction dynamics with quantum computing algorithms
• Logarithmic Depth Decomposition of Approximate Multi-Controlled Single-Qubit Gates Without Ancilla Qubits