COMPUTATIONAL SCIENCES, SEMINAR ANNOUNCEMENT
“Quantum Simulation of Time-Dependent Hamiltonians with Superconducting Qubits”
Phillip Stancil, University of Georgia
Wednesday, September 15, 2010 at 3:30 p.m.
(Refreshments at 3:00 pm)
327 McVey Hall
An original motivation by Feynman for proposing a quantum computer was the simulation of one quantum system by another quantum system. As computations of n-dimensional systems scale exponentially on a classical computer, exact simulations which involve non-local interactions quickly become intractable as the system size increases. Quantum computers, on the other hand, are expected to have a more favorable polynomial scaling.
However, current algorithms for quantum simulations typically require excessive numbers of qubits (2n) and elementary gate operations (22n) that far exceed today's quantum computing technology. In this talk, I'll outline an alternate analog quantum simulation approach for the fast simulation of n-dimensional, time-dependent quantum systems on n-qubit quantum computers.
Unlike classical algorithms which require n3 elementary operations per time step, the proposed approach is independent of the system size, but requires the computation to be completed within the qubit coherence time. The approach is theoretically demonstrated for a quantum computer composed of just three superconducting phase qubits for the simulation of a three-channel atomic collision problem.