Eigenvalue Estimation of Differential Operators

Details Eigenvalue Estimation of Differential Operators Eigenvalue Estimation of Differential Operators

2004-08-20

arxiv.org/abs/quant-ph/0408137v4

Phys. Rev. A 72, 062318 (2005)

Physics

Quantum Physics

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

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Eigenvalue Estimation of Differential Operators does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Eigenvalue Estimation of Differential Operators, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Eigenvalue Estimation of Differential Operators will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-713770