Protocol for computing polynomial on real value encoded in quantum state
ORAL
Abstract
The constructive Escher-Hands protocol provides a method for encoding real numbers onto a quantum computer and applying gate-based quantum algorithms to compute a degree-d polynomial, P(x; d). The Escher-Hands quantum circuits are compact enough to yield meaningful and accurate results on today’s noisy quantum computers. We discuss in details implementation of P(x; 4) and present results for polynomial approximation of several commonly used functions, obtained from both the ideal Qiskit simulator and the IBM Torino quantum processor.
–
Presenters
-
Jan Balewski
Lawrence Berkeley National Laboratory
Authors
-
Jan Balewski
Lawrence Berkeley National Laboratory
-
Mercy Amankwah
Department of Mathematics, Applied Mathematics and Statistics, Case Western Reserve University, Cleveland, OH 44106, USA
-
E.Wes Bethel
Computer Science Department, San Francisco State University, San Francisco, CA 94132, USA
-
Talita Perciano
Lawrence Berkeley National Laboratory
-
Roel Van Beeumen
Lawrence Berkeley National Laboratory