arXiv Analytics

Sign in

arXiv:quant-ph/0108110AbstractReferencesReviewsResources

Polynomial-Time Simulation of Pairing Models on a Quantum Computer

L. -A. Wu, M. S. Byrd, D. A. Lidar

Published 2001-08-23, updated 2002-06-19Version 2

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 ground and first excited states, and provides a test of the applicability of the BCS Hamiltonian to mesoscopic superconducting systems, such as ultra-small metallic grains.

Comments: 5 pages, RevTeX, Latest, modified version to appear in Phys. Rev. Lett
Journal: Phys. Rev. Lett. 89, 057904 (2002), Due to a proofs mix up there is also an Erratum: 89, 139901 (2002).
Related articles: Most relevant | Search more
arXiv:quant-ph/0410007 (Published 2004-10-01, updated 2005-04-20)
Proposal of Quantum Simulation of Pairing Model on an NMR Quantum Computer
arXiv:quant-ph/0410143 (Published 2004-10-19, updated 2004-10-28)
Experimental Simulation of a Pairing Hamiltonian on an NMR Quantum Computer
arXiv:quant-ph/9910015 (Published 1999-10-04)
Implementation of the refined Deutsch-Jozsa algorithn on a 3-bit NMR quantum computer