Polynomial-Time Simulation of Pairing Models on a Quantum Computer
量子物理
2009-11-07 v2 超导电性
摘要
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.
引用
@article{arxiv.quant-ph/0108110,
title = {Polynomial-Time Simulation of Pairing Models on a Quantum Computer},
author = {L. -A. Wu and M. S. Byrd and D. A. Lidar},
journal= {arXiv preprint arXiv:quant-ph/0108110},
year = {2009}
}
备注
5 pages, RevTeX, Latest, modified version to appear in Phys. Rev. Lett