2007/08/24 by Yang Liu, Liu, Yang, Gui Lu Long +3
Computer Science · Physics and Astronomy · #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum-Dot Cellular Automata #quant-ph
paper · pdf · doi:10.48550/arxiv.0708.3274
4 pages 7 figures
arxiv created 2007/08/24 · arxiv updated 2009/12/01
In this Letter, we present two analytic expressions that most generally simulate n-qubit controlled-U gates with standard one-qubit gates and CNOT gates using exponential and polynomial complexity respectively. Explicit circuits and general expressions of decomposition are derived. The exact numbers of basic operations in these two schemes are given using gate counting technique.