Skip to main content

Implementing NChooseK on IBM Q Quantum Computer Systems

  • Conference paper
  • First Online:
Reversible Computation (RC 2019)

Abstract

This work contributes a generalized model for quantum computation called NChooseK. NChooseK is based on a single parametrized primitive suitable to express a variety of problems that cannot be solved efficiently using classical computers but may admit an efficient quantum solution. We implement a code generator that, given arbitrary parameters for N and K, generates code suitable for execution on IBM Q quantum hardware. We assess the performance of the code generator, limitations in the size of circuit depth and number of gates, and propose optimizations. We identify future work to improve efficiency and applicability of the NChooseK model.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 49.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 64.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Bettelli, S., Calarco, T., Serafini, L.: Toward an architecture for quantum programming. Eur. Phys. J. D At. Mol. Opt. Plasma Phys. 25(2), 181–200 (2003)

    Google Scholar 

  2. Brennen, G.K., Caves, C.M., Jessen, P.S., Deutsch, I.H.: Quantum logic gates in optical lattices. Phys. Rev. Lett. 82(5), 1060 (1999)

    Article  Google Scholar 

  3. Cincio, Ł., Subaşı, Y., Sornborger, A.T., Coles, P.J.: Learning the quantum algorithm for state overlap. arXiv preprint arXiv:1803.04114 (2018)

  4. Cirac, J.I., Zoller, P.: Quantum computations with cold trapped ions. Phys. Rev. Lett. 74(20), 4091 (1995)

    Article  Google Scholar 

  5. Clarke, J., Wilhelm, F.K.: Superconducting quantum bits. Nature 453(7198), 1031 (2008)

    Article  Google Scholar 

  6. Cook, S.A.: The complexity of theorem-proving procedures. In: Proceedings of the Third Annual ACM Symposium on Theory of Computing, pp. 151–158. ACM (1971)

    Google Scholar 

  7. Cross, A.: The IBM Q experience and QISKit open-source quantum computing software. Bull. Am. Phys. Soc. 63(1) (2018). BAPS.2018.MAR.L58.3

    Google Scholar 

  8. Cross, A.W., Bishop, L.S., Smolin, J.A., Gambetta, J.M.: Open quantum assembly language. arXiv:1707.03429 (2017). http://arxiv.org/abs/1707.03429

  9. D-Wave Systems Inc: qbsolv. https://docs.ocean.dwavesys.com/projects/qbsolv/

  10. Dahl, E.D.: Programming with D-Wave: Map coloring problem. D-Wave Official Whitepaper (2013)

    Google Scholar 

  11. Deutsch, D.: Quantum theory, the Church-Turing principle and the universal quantum computer. Proc. R. Soc. Lond. A Math. Phys. Sci. 400(1818), 97–117 (1985)

    Article  MathSciNet  Google Scholar 

  12. Feynman, R.P.: Simulating physics with computers. Int. J. Theor. Phys. 21(6–7), 467–488 (1982)

    Article  MathSciNet  Google Scholar 

  13. Gay, S.J.: Quantum programming languages: survey and bibliography. Math. Struct. Comput. Sci. 16(4), 581–600 (2006)

    Article  MathSciNet  Google Scholar 

  14. Gidney, C.: Quirk: a drag-and-drop quantum circuit simulator. http://algassert.com/quirk

  15. Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, pp. 212–219. ACM (1996)

    Google Scholar 

  16. IBM: IBM Q Experience. https://quantumexperience.ng.bluemix.net/qx

  17. IBM: IBM Qiskit (2019). https://qiskit.org/

  18. Knill, E.: Conventions for quantum pseudocode. Technical report LA-UR-96-2724, Los Alamos National Laboratory, June 1996

    Google Scholar 

  19. Microsoft Research: Microsoft quantum development kit samples (2019). https://github.com/Microsoft/Quantum

  20. Ömer, B.: A Procedural Formalism for Quantum Computing. Master’s thesis, Department of Theoretical Physics, Technical University of Vienne, July 1998

    Google Scholar 

  21. Schneider, S., Milburn, G.J.: Decoherence and fidelity in ion traps with fluctuating trap parameters. Phys. Rev. A 59(5), 3766 (1999)

    Article  Google Scholar 

  22. Shende, V.V., Markov, I.L.: On the CNOT-cost of TOFFOLI gates. arXiv preprint arXiv:0803.2316 (2008)

  23. Shor, P.W.: Algorithms for quantum computation: Discrete logarithms and factoring. In: 35th Annual Symposium on Foundations of Computer Science, Proceedings, pp. 124–134. IEEE (1994)

    Google Scholar 

  24. Younes, A.: Using Reed-Muller expansions in the synthesis and optimization of Boolean quantum circuits. In: Stepney, S., Adamatzky, A. (eds.) Inspired by Nature. ECC, vol. 28, pp. 113–141. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-67997-6_5

    Chapter  Google Scholar 

Download references

Acknowledgments

Research presented in this article was supported in part by NSF grants 1525609 and 1813004 and by the Laboratory Directed Research and Development program of Los Alamos National Laboratory under project numbers 20160069DR and 20190065DR. This work was also supported by the U.S. Department of Energy through Los Alamos National Laboratory. Los Alamos National Laboratory is operated by Triad National Security, LLC for the National Nuclear Security Administration of the U.S. Department of Energy (contract no. 89233218CNA000001).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Frank Mueller .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Khetawat, H., Atrey, A., Li, G., Mueller, F., Pakin, S. (2019). Implementing NChooseK on IBM Q Quantum Computer Systems. In: Thomsen, M., Soeken, M. (eds) Reversible Computation. RC 2019. Lecture Notes in Computer Science(), vol 11497. Springer, Cham. https://doi.org/10.1007/978-3-030-21500-2_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-21500-2_13

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-21499-9

  • Online ISBN: 978-3-030-21500-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics