A Polylogarithmic-Time Quantum Algorithm for the Laplace Transform
Akash Kumar Singh, Ashish Kumar Patra, Anurag K.S.V., Sai Shankar P., Ruchika Bhat, Jaiganesh G

TL;DR
This paper presents a quantum algorithm for the Laplace transform that achieves a superpolynomial speedup over classical methods, enabling efficient quantum computations in the Laplace domain for various applications.
Contribution
It introduces a novel quantum algorithm for the Laplace transform using Quantum Eigenvalue Transformation, achieving logarithmic circuit width and exponential speedup over classical algorithms.
Findings
Gate complexity of O((log N)^3), ignoring state preparation
Circuit width grows as O(log N)
Potential applications in solving differential equations and spectral estimation
Abstract
We introduce a quantum algorithm to perform the Laplace transform on quantum computers. Already, the quantum Fourier transform (QFT) is the cornerstone of many quantum algorithms, but the Laplace transform or its discrete version has not seen any efficient implementation on quantum computers due to its dissipative nature and hence non-unitary dynamics. However, a recent work has shown an efficient implementation for certain cases on quantum computers using the Taylor series. Unlike previous work, our work provides a completely different algorithm for doing Laplace Transform using Quantum Eigenvalue Transformation and Lap-LCHS, very efficiently at points which form an arithmetic progression. Our algorithm can implement discrete Laplace transform in gate complexity that grows as , ignoring the state preparation cost, where and is the number of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Polynomial and algebraic computation
