Polynomial-Time Simulation of Pairing Models on a Quantum Computer

Details Polynomial-Time Simulation of Pairing Models on a Quantum Computer Polynomial-Time Simulation of Pairing Models on a Quantum Computer

2001-08-23

arxiv.org/abs/quant-ph/0108110v2

Phys. Rev. Lett. 89, 057904 (2002), Due to a proofs mix up there is also an Erratum: 89, 139901 (2002).

Physics

Quantum Physics

5 pages, RevTeX, Latest, modified version to appear in Phys. Rev. Lett

Scientific paper

10.1103/PhysRevLett.89.057904

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.

Affiliated with

Also associated with

No associations

Rating

Polynomial-Time Simulation of Pairing Models on a Quantum Computer does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Polynomial-Time Simulation of Pairing Models on a Quantum Computer, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Polynomial-Time Simulation of Pairing Models on a Quantum Computer will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-190189