Abstract
We present and experimentally realize a quantum algorithm for efficiently solving the following problem: given an matrix , an -dimensional vector , and an initial vector , obtain a target vector as a function of time according to the constraint . We show that our algorithm exhibits an exponential speedup over its classical counterpart in certain circumstances. In addition, we demonstrate our quantum algorithm for a linear differential equation using a 4-qubit nuclear magnetic resonance quantum information processor. Our algorithm provides a key technique for solving many important problems which rely on the solutions to linear differential equations.