Quantum algorithms and circuits for scientific computing

Mihir K. Bhaskar, Stuart Hadfield, Anargyros Papageorgiou, Iasonas Petras

Research output: Contribution to journalArticle

10 Scopus citations

Abstract

Quantum algorithms for scientific computing require modules implementing fundamental functions, such as the square root, the logarithm, and others. We require algorithms that have a well-controlled numerical error, that are uniformly scalable and reversible (unitary), and that can be implemented efficiently. We present quantum algorithms and circuits for computing the square root, the natural logarithm, and arbitrary fractional powers. We provide performance guarantees in terms of their worst-case accuracy and cost. We further illustrate their performance by providing tests comparing them to the respective floating point implementations found in widely used numerical software.

Original languageEnglish (US)
Pages (from-to)197-236
Number of pages40
JournalQuantum Information and Computation
Volume16
Issue number3-4
StatePublished - Mar 1 2016

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Statistical and Nonlinear Physics
  • Nuclear and High Energy Physics
  • Mathematical Physics
  • Physics and Astronomy(all)
  • Computational Theory and Mathematics

Keywords

  • Quantum algorithms
  • Reversible circuits
  • Scientific computing

Fingerprint Dive into the research topics of 'Quantum algorithms and circuits for scientific computing'. Together they form a unique fingerprint.

  • Cite this

    Bhaskar, M. K., Hadfield, S., Papageorgiou, A., & Petras, I. (2016). Quantum algorithms and circuits for scientific computing. Quantum Information and Computation, 16(3-4), 197-236.