Polynomial-Time Simulation of Pairing Models on a Quantum Computer

L.-A. Wu, M. S. Byrd, and D. A. Lidar
Phys. Rev. Lett. 89, 057904 – Published 16 July 2002; Errata Phys. Rev. Lett. 89, 139901 (2002); Phys. Rev. Lett. 89, 199902 (2002)

Abstract

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.

  • Figure
  • Received 23 August 2001
  • Publisher error corrected 21 October 2002

DOI:https://doi.org/10.1103/PhysRevLett.89.057904

©2002 American Physical Society

Corrections

21 October 2002

Errata

Authors & Affiliations

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

  • Chemical Physics Theory Group, University of Toronto, 80 St. George Street, Toronto, Ontario M5S 3H6, Canada

  • *Present address: Department of Applied Sciences, Harvard University, 33 Oxford Street, Cambridge, MA 02138.

Comments & Replies

Comment on “Polynomial-Time Simulation of Pairing Models on a Quantum Computer”

J. Dukelsky, J. M. Román, and G. Sierra
Phys. Rev. Lett. 90, 249803 (2003)

Wu et al. Reply:

L.-A. Wu, M. S. Byrd, and D. A. Lidar
Phys. Rev. Lett. 90, 249804 (2003)

Article Text (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand
Issue

Vol. 89, Iss. 5 — 29 July 2002

Reuse & Permissions
Access Options
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review Letters

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×