skip to main content
10.1145/1168857.1168889acmconferencesArticle/Chapter ViewAbstractPublication PagesasplosConference Proceedingsconference-collections
Article

A program transformation and architecture support for quantum uncomputation

Published:20 October 2006Publication History

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%.

References

  1. W.C. Athas and L.J. Svensson. Reversible logic issues in adiabatic CMOS. In Proceedings of Physics and Computation, 1994.Google ScholarGoogle ScholarCross RefCross Ref
  2. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  3. C. Bennett. Logical reversibility of computation. IBM Journal of Research and Design, 1973.Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. R.V. Meter and K.M. Itoh. Fast quantum modular exponentiation. Physical Review A, 71:052320, 2005.Google ScholarGoogle Scholar
  5. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  6. M.A. Nielsen and I.L. Chuang. Quantum Computation and Quantum Information. Cambridge University Press, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. B. Omer. A Procedural Formalism for Quantum Computing. Ph.D. thesis, Technical University of Vienna, 1998.Google ScholarGoogle Scholar
  8. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  9. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  10. P.W. Shor. Why haven't more quantum algorithms been found? J. ACM, 50(1), 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. R.R. Tucci. A rudimentary quantum compiler(2nd ed.), 1999.Google ScholarGoogle Scholar
  12. C. Vieri. Pendulum: A reversible computer architecture. Master's thesis, MIT, 1995.Google ScholarGoogle Scholar

Index Terms

  1. A program transformation and architecture support for quantum uncomputation

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader
        About Cookies On This Site

        We use cookies to ensure that we give you the best experience on our website.

        Learn more

        Got it!