A Lower Bound for the Sturm-Liouville Eigenvalue Problem on a Quantum Computer

Abstract

We study the complexity of approximating the smallest eigenvalue of a univariate Sturm-Liouville problem on a quantum computer. This general problem includes the special case of solving a one-dimensional Schrodinger equation with a given potential for the ground state energy.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Dec 14, 2005
Accession Number
ADA640617

Entities

People

  • Arvid J. Bessen

Organizations

  • Columbia University

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Computers
  • Differential Equations
  • Eigenvalues
  • Eigenvectors
  • Equations
  • Frequency
  • Polynomials
  • Probability
  • Probability Distributions
  • Quantum Algorithms
  • Quantum Computers
  • Quantum Computing
  • Quantum Information Science
  • Shor'S Algorithm

Fields of Study

  • Mathematics

Readers

  • Approximation Theory.
  • Quantum spin resonance or Electron Paramagnetic Resonance spectroscopy.
  • Wave Propagation and Nonlinear Chaotic Dynamics.

Technology Areas

  • Quantum Computing