|
| related topics |
| {state, algorithm, problem} |
| {time, decoherence, evolution} |
| {energy, state, states} |
| {qubit, qubits, gate} |
| {operator, operators, space} |
| {spin, pulse, spins} |
| {temperature, thermal, energy} |
| {equation, function, exp} |
| {light, field, probe} |
| {algorithm, log, probability} |
| {force, casimir, field} |
|
Polynomial-Time Simulation of Pairing Models on a Quantum Computer
L. -A. Wu, M. S. Byrd, D. A. Lidar
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 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.
- oai_identifier:
- oai:arXiv.org:quant-ph/0108110
- categories:
- quant-ph cond-mat.supr-con
- comments:
- 5 pages, RevTeX, Latest, modified version to appear in Phys. Rev.
Lett
- doi:
- 10.1103/PhysRevLett.89.057904
- arxiv_id:
- quant-ph/0108110
- journal_ref:
- Phys. Rev. Lett. 89, 057904 (2002), Due to a proofs mix up there
is also an Erratum: 89, 139901 (2002).
- created:
- 2001-08-23
- updated:
- 2002-06-19
Full article ▸
|
|
| related documents |
| 0506244v2 |
| 0111062v2 |
| 9702039v4 |
| 0009086v1 |
| 0204044v5 |
| 0602135v1 |
| 0308016v1 |
| 0209092v5 |
| 0410145v2 |
| 0301054v1 |
| 0401009v3 |
| 0507218v1 |
| 0501093v1 |
| 0405063v2 |
| 0403160v1 |
| 0507194v1 |
| 0603096v1 |
| 0312096v2 |
| 0209139v1 |
| 0406146v1 |
| 0612033v1 |
| 0606242v3 |
| 0507024v1 |
| 0502144v1 |
| 0703193v2 |
|