Eigenvalue Estimation of Differential Operators

Abstract

We demonstrate how linear differential operators could be emulated by a quantum processor, should one ever be built, using the Abrams-Lloyd algorithm. Given a linear differential operator of order 2S, acting on functions psi(x_1,x_2,...,x_D) with D arguments, the computational cost required to estimate a low order eigenvalue to accuracy Theta(1/N^2) is Theta((2(S+1)(1+1/nu)+D)log N) qubits and O(N^{2(S+1)(1+1/nu)} (D log N)^c) gate operations, where N is the number of points to which each argument is discretized, nu and c are implementation dependent constants of O(1). Optimal classical methods require Theta(N^D) bits and Omega(N^D) gate operations to perform the same eigenvalue estimation. The Abrams-Lloyd algorithm thereby leads to exponential reduction in memory and polynomial reduction in gate operations, provided the domain has sufficiently large dimension D > 2(S+1)(1+1/nu). In the case of Schrodinger's equation, ground state energy estimation of two or more particles can in principle be performed with fewer quantum mechanical gates than classical gates.

significant content revisions: more algorithm details and brief analysis of convergence

References in corpus (2)

• Higher Order Methods for Simulations on Quantum Computers
• Eigenvector Approximation Leading to Exponential Speedup of Quantum Eigenvalue Calculation

Cited by in corpus (5)

• Quantum Fourier Transform in Computational Basis
• Long-range coupling and scalable architecture for superconducting flux qubits
• Quantum phase estimation for a class of generalized eigenvalue problems
• Measurement-based quantum phase estimation algorithm for finding eigenvalues of non-unitary matrices
• Improved quantum algorithm for calculating eigenvalues of differential operators and its application to estimating the decay rate of the perturbation distribution tail in stochastic inflation