Polynomial-time simulation of pairing models on a quantum computer.
We propose a polynomial-time algorithm for simulation of the class of pairing Hamiltonians, e.g., the BCS Hamiltonian, on an NMR quantum computer. The algorithm adiabatically finds the low-lying spectrum in the vicinity of the gap between the ground and the first excited states and provides a test of the applicability of the BCS Hamiltonian to mesoscopic superconducting systems, such as ultrasmall metallic grains.
Wu
L-A
LA
Chemical Physics Theory Group, University of Toronto, 80 St. George Street, Toronto, Ontario M5S 3H6, Canada.
Byrd
M S
MS
Lidar
D A
DA