ABSTRACT
Quantum computing's power comes from new algorithms that exploit quantum mechanical phenomena for computation. Quantum algorithms are different from their classical counterparts in that quantum algorithms rely on algorithmic structures that are simply not present in classical computing. Just as classical program transformations and architectures have been designed for common classical algorithm structures, quantum program transformations and quantum architectures should be designed with quantum algorithms in mind. Because quantum algorithms come with these new algorithmic structures, resultant quantum program transformations and architectures may look very different from their classical counterparts.This paper focuses on uncomputation, a critical and prevalent structure in quantum algorithms, and considers how program transformations, and architecture support should be designed to accommodate uncomputation. In this paper,we show a simple quantum program transformation that exposes independence between uncomputation and later computation. We then propose a multicore architecture tailored to this exposed parallelism and propose a scheduling policy that efficiently maps such parallelism to the multicore architecture. Our policy achieves parallelism between uncomputation and later computation while reducing cumulative communication distance. Our scheduling and architecture allows significant speedup of quantum programs (between 1.8x and 2.8x speedup in Shor's factoring algorithm), while reducing cumulative communication distance 26%.
- W.C. Athas and L.J. Svensson. Reversible logic issues in adiabatic CMOS. In Proceedings of Physics and Computation, 1994.Google Scholar
Cross Ref
- S. Balensiefer, L. Kreger-Stickles, and M. Oskin. An evaluation framework and instruction set architecture for ion-trap based quantum micro-architectures. In Proceedings of the 32nd ISCA, 2005. Google Scholar
Digital Library
- C. Bennett. Logical reversibility of computation. IBM Journal of Research and Design, 1973.Google Scholar
Digital Library
- R.V. Meter and K.M. Itoh. Fast quantum modular exponentiation. Physical Review A, 71:052320, 2005.Google Scholar
- T.S. Metodiev, D. Thaker, A. Cross, F.T. Chong, and I.L. Chuang. A quantum logic array microarchitecture: Scalable quantum data movement and computation. In Proceedings of the 38th Micro, 2005. Google Scholar
Digital Library
- M.A. Nielsen and I.L. Chuang. Quantum Computation and Quantum Information. Cambridge University Press, 2000. Google Scholar
Digital Library
- B. Omer. A Procedural Formalism for Quantum Computing. Ph.D. thesis, Technical University of Vienna, 1998.Google Scholar
- M. Oskin, F.T. Chong, I.L. Chuang, and J. Kubiatowicz. Building quantum wires: the long and the short of it. In Proceedings of the 30th ISCA, June 2003. Google Scholar
Digital Library
- P.W. Shor. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. In Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994.Google Scholar
Digital Library
- P.W. Shor. Why haven't more quantum algorithms been found? J. ACM, 50(1), 2003. Google Scholar
Digital Library
- R.R. Tucci. A rudimentary quantum compiler(2nd ed.), 1999.Google Scholar
- C. Vieri. Pendulum: A reversible computer architecture. Master's thesis, MIT, 1995.Google Scholar
Index Terms
A program transformation and architecture support for quantum uncomputation
Recommendations
A program transformation and architecture support for quantum uncomputation
Proceedings of the 2006 ASPLOS ConferenceQuantum computing's power comes from new algorithms that exploit quantum mechanical phenomena for computation. Quantum algorithms are different from their classical counterparts in that quantum algorithms rely on algorithmic structures that are simply ...
A program transformation and architecture support for quantum uncomputation
Proceedings of the 2006 ASPLOS ConferenceQuantum computing's power comes from new algorithms that exploit quantum mechanical phenomena for computation. Quantum algorithms are different from their classical counterparts in that quantum algorithms rely on algorithmic structures that are simply ...
A program transformation and architecture support for quantum uncomputation
Proceedings of the 2006 ASPLOS ConferenceQuantum computing's power comes from new algorithms that exploit quantum mechanical phenomena for computation. Quantum algorithms are different from their classical counterparts in that quantum algorithms rely on algorithmic structures that are simply ...








Comments