Abstract
We present two recursive schemes which generally simulate N-qubit controlled gates with standard one-qubit rotation and CNOT gates respectively using exponential and polynomial complexity simulations. Explicit circuits and decomposition expressions are deduced. We compare exact numbers of basic operations required in these two approaches using a gate counting technique.
© 2007 IEEE
PDF ArticleMore Like This
Patrick Huber, Patrick Barthel, Sougato Bose, Juan José García-Ripoll, Johann Haber, Yasser Omar, Sagar Pratapsi, Erik Torrontegui, and Christof Wunderlich
QM3A.6 Quantum 2.0 (QUANTUM) 2023
N. Timoney, V. Elman, C. Weiss, M. Johanning, Chr. Wunderlich, and W. Neuhauser
IC3_1 International Quantum Electronics Conference (IQEC) 2007
J. Fulconis, A. Clark, J.G. Rarity, J. L. O’Brien, and W.J. Wadsworth
QME3 Quantum Electronics and Laser Science Conference (CLEO:FS) 2008