Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Synthesis of quantum logic circuits

Synthesis of quantum logic circuits 3A-4s Synthesis of Quantum Logic Circuits Vivek V. Shende1 vshende@eecs.umich.edu 1 Dept. Stephen S. Bullock2 stephen.bullock@nist.gov Igor L. Markov1 imarkov@eecs.umich.edu 2 Mathematical of Electrical Engineering and Computer Science, The University of Michigan, Ann Arbor, MI 48109-2212, USA and Computational Sciences Division, Natl. Inst. of Standards and Technology, Gaithersburg, MD 20899-8910, USA Abstract ” The pressure of fundamental limits on classical computation and the promise of exponential speedups from quantum effects have recently brought quantum circuits to the attention of the EDA community [10, 17, 4, 16, 9]. We discuss ef cient circuits to initialize quantum registers and implement generic quantum computations. Our techniques yield circuits that are twice as small as the best previously published technique. Moreover, a theoretical lower bound shows that our new circuits can be improved by at most a factor of two. Further, the circuits grow by at most a factor of nine under severe architectural restrictions. commercially available from MagiQ Technologies in the U.S. and IdQuantique in Europe. Quantum bit data states differ from classical states in two important ways. First, a single quantum bit may take on a continuum of values z1 |0 + z2 |1 for z1 , z2 complex numbers. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png

Synthesis of quantum logic circuits

Association for Computing Machinery — Jan 18, 2005

Loading next page...
/lp/association-for-computing-machinery/synthesis-of-quantum-logic-circuits-FOfYn0bDmA

References (40)

Datasource
Association for Computing Machinery
Copyright
Copyright © 2005 by ACM Inc.
ISBN
0-7803-8737-6
doi
10.1145/1120725.1120847
Publisher site
See Article on Publisher Site

Abstract

3A-4s Synthesis of Quantum Logic Circuits Vivek V. Shende1 vshende@eecs.umich.edu 1 Dept. Stephen S. Bullock2 stephen.bullock@nist.gov Igor L. Markov1 imarkov@eecs.umich.edu 2 Mathematical of Electrical Engineering and Computer Science, The University of Michigan, Ann Arbor, MI 48109-2212, USA and Computational Sciences Division, Natl. Inst. of Standards and Technology, Gaithersburg, MD 20899-8910, USA Abstract ” The pressure of fundamental limits on classical computation and the promise of exponential speedups from quantum effects have recently brought quantum circuits to the attention of the EDA community [10, 17, 4, 16, 9]. We discuss ef cient circuits to initialize quantum registers and implement generic quantum computations. Our techniques yield circuits that are twice as small as the best previously published technique. Moreover, a theoretical lower bound shows that our new circuits can be improved by at most a factor of two. Further, the circuits grow by at most a factor of nine under severe architectural restrictions. commercially available from MagiQ Technologies in the U.S. and IdQuantique in Europe. Quantum bit data states differ from classical states in two important ways. First, a single quantum bit may take on a continuum of values z1 |0 + z2 |1 for z1 , z2 complex numbers.

There are no references for this article.