Fast Laplace transforms on quantum computers
- URL: http://arxiv.org/abs/2412.05173v2
- Date: Wed, 11 Dec 2024 12:11:49 GMT
- Title: Fast Laplace transforms on quantum computers
- Authors: Julien Zylberman,
- Abstract summary: We introduce the Quantum Laplace Transform (QLT), which enables the implementation of $Ntimes N$ discrete Laplace transforms on quantum states encoded in $lceil log_2(N)rceil$-qubits.
In many cases, the associated quantum circuits have a depth that scales with $N$ as $O(log(N))$ and a size that scales as $O(log(N))$, requiring exponentially fewer operations and double-exponentially less computational time than their classical counterparts.
- Score: 0.0
- License:
- Abstract: While many classical algorithms rely on Laplace transforms, it has remained an open question whether these operations could be implemented efficiently on quantum computers. In this work, we introduce the Quantum Laplace Transform (QLT), which enables the implementation of $N\times N$ discrete Laplace transforms on quantum states encoded in $\lceil \log_2(N)\rceil$-qubits. In many cases, the associated quantum circuits have a depth that scales with $N$ as $O(\log(\log(N)))$ and a size that scales as $O(\log(N))$, requiring exponentially fewer operations and double-exponentially less computational time than their classical counterparts. These efficient scalings open the possibility of developing a new class of quantum algorithms based on Laplace transforms, with potential applications in physics, engineering, chemistry, machine learning, and finance.
Related papers
- Quantum simulation of Burgers turbulence: Nonlinear transformation and direct evaluation of statistical quantities [0.0]
It is still challenging to solve nonlinear equations in fluid dynamics, such as the Burgers equation, using quantum computers.
We propose a novel quantum algorithm to solve the Burgers equation.
arXiv Detail & Related papers (2024-12-23T01:17:26Z) - Classically estimating observables of noiseless quantum circuits [36.688706661620905]
We present a classical algorithm for estimating expectation values of arbitrary observables on most quantum circuits.
For non-classically-simulable input states or observables, the expectation values can be estimated by augmenting our algorithm with classical shadows of the relevant state or observable.
arXiv Detail & Related papers (2024-09-03T08:44:33Z) - Calculating response functions of coupled oscillators using quantum phase estimation [40.31060267062305]
We study the problem of estimating frequency response functions of systems of coupled, classical harmonic oscillators using a quantum computer.
Our proposed quantum algorithm operates in the standard $s-sparse, oracle-based query access model.
We show that a simple adaptation of our algorithm solves the random glued-trees problem in time.
arXiv Detail & Related papers (2024-05-14T15:28:37Z) - Hybrid Quantum-Classical Scheduling for Accelerating Neural Network Training with Newton's Gradient Descent [37.59299233291882]
We propose Q-Newton, a hybrid quantum-classical scheduler for accelerating neural network training with Newton's GD.
Q-Newton utilizes a streamlined scheduling module that coordinates between quantum and classical linear solvers.
Our evaluation showcases the potential for Q-Newton to significantly reduce the total training time compared to commonly used quantum machines.
arXiv Detail & Related papers (2024-04-30T23:55:03Z) - Towards large-scale quantum optimization solvers with few qubits [59.63282173947468]
We introduce a variational quantum solver for optimizations over $m=mathcalO(nk)$ binary variables using only $n$ qubits, with tunable $k>1$.
We analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature.
arXiv Detail & Related papers (2024-01-17T18:59:38Z) - Improving Quantum Simulation Efficiency of Final State Radiation with
Dynamic Quantum Circuits [1.3375143521862154]
We make use of a new quantum hardware capability called dynamical quantum computing to improve the scaling of the QPS algorithm.
We modify the quantum parton shower circuit to incorporate mid-circuit qubit measurements, resets, and quantum operations conditioned on classical information.
arXiv Detail & Related papers (2022-03-18T15:31:19Z) - Quantum algorithms for grid-based variational time evolution [36.136619420474766]
We propose a variational quantum algorithm for performing quantum dynamics in first quantization.
Our simulations exhibit the previously observed numerical instabilities of variational time propagation approaches.
arXiv Detail & Related papers (2022-03-04T19:00:45Z) - Quantum State Preparation with Optimal Circuit Depth: Implementations
and Applications [10.436969366019015]
We show that any $Theta(n)$-depth circuit can be prepared with a $Theta(log(nd)) with $O(ndlog d)$ ancillary qubits.
We discuss applications of the results in different quantum computing tasks, such as Hamiltonian simulation, solving linear systems of equations, and realizing quantum random access memories.
arXiv Detail & Related papers (2022-01-27T13:16:30Z) - Halving the cost of quantum multiplexed rotations [0.0]
We improve the number of $T$ gates needed for a $b$-bit approximation of a multiplexed quantum gate with $c$ controls.
Our results roughly halve the cost of state-of-art electronic structure simulations based on qubitization of double-factorized or tensor-hypercontracted representations.
arXiv Detail & Related papers (2021-10-26T06:49:44Z) - Quantum Legendre-Fenchel Transform [6.643082745560234]
We present a quantum algorithm to compute the discrete Legendre-Fenchel transform.
We show that our quantum algorithm is optimal up to polylogarithmic factors.
arXiv Detail & Related papers (2020-06-08T18:00:05Z) - Quantum Gram-Schmidt Processes and Their Application to Efficient State
Read-out for Quantum Algorithms [87.04438831673063]
We present an efficient read-out protocol that yields the classical vector form of the generated state.
Our protocol suits the case that the output state lies in the row space of the input matrix.
One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
arXiv Detail & Related papers (2020-04-14T11:05:26Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.