RSS icon
Twitter icon
Facebook icon
Vimeo icon
YouTube icon

Quantum Algorithms and Circuits for Scientific Computing

March 18, 2016 - 11:00am
Stuart Hadfield
Columbia University

Quantum algorithms for scientific computing require modules implementing fundamental functions, such as inverses, logarithms, trigonometric functions, and others. We require modules that have a well-controlled numerical error, that are uniformly scalable and reversible (unitary), and that can be implemented efficiently. Such modules are an important first step in the development of quantum libraries and standards for numerical computation.

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 comparing to floating point implementations found in widely used numerical software.

Joint work with Mihir K. Bhaskar, Anargyros Papageorgiou, and Iasonas Petras

Paper available at

3100A Computer and Space Sciences
College Park, MD 20742

Subscribe to A Quantum Bit 

Quantum physics began with revolutionary discoveries in the early twentieth century and continues to be central in today’s physics research. Learn about quantum physics, bit by bit. From definitions to the latest research, this is your portal. Subscribe to receive regular emails from the quantum world. Previous Issues...

Sign Up Now

Sign up to receive A Quantum Bit in your email!

 Have an idea for A Quantum Bit? Submit your suggestions to