Polynomial-time simulation of pairing models on a quantum computer

被引：83

作者：

Wu, LA ^{[1
]}

Byrd, MS ^{[1
]}

Lidar, DA ^{[1
]}

机构：

[1] Univ Toronto, Chem Phys Theory Grp, Toronto, ON M5S 3H6, Canada

来源：

PHYSICAL REVIEW LETTERS | 2002年 / 89卷 / 05期

基金：

加拿大自然科学与工程研究理事会;

关键词：

D O I：

10.1103/PhysRevLett.89.057904

中图分类号：

O4 [物理学];

学科分类号：

0702 ;

摘要：

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.

引用

页数：4

共 50 条

[21] NONDETERMINISTIC POLYNOMIAL-TIME COMPUTATIONS AND MODELS OF ARITHMETIC
MATE, A
JOURNAL OF THE ACM, 1990, 37 (01) : 175 - 193
[22] Pairing model simulation on a quantum computer
Byrd, Mark S.
Wu, Lian-Ao
Lidar, Daniel A.
CONDENSED MATTER THEORIES, VOL 20, 2006, 20 : 485 - +
[23] ON POLYNOMIAL-TIME DEFINABLE CLASSES OF FINITE-MODELS
DAHLHAUS, E
JOURNAL OF SYMBOLIC LOGIC, 1987, 52 (01) : 313 - 313
[24] Polynomial-time normalizers
Luks, Eugene M.
Miyazaki, Takunari
DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2011, 13 (04): : 61 - 96
[25] AN EXPLICIT SEPARATION OF RELATIVISED RANDOM POLYNOMIAL-TIME AND RELATIVISED DETERMINISTIC POLYNOMIAL-TIME
ZIPPEL, R
INFORMATION PROCESSING LETTERS, 1989, 33 (04) : 207 - 212
[26] Quantum Polynomial-Time Fixed-Point Attack for RSA
Yahui Wang
Huanguo Zhang
Houzhen Wang
中国通信, 2018, 15 (02) : 25 - 32
[27] Deterministic polynomial-time quantum algorithms for Simon’s problem
Takashi Mihara
Shao Chin Sung
computational complexity, 2003, 12 : 162 - 175
[28] Quantum Polynomial-Time Fixed-Point Attack for RSA
Wang, Yahui
Zhang, Huanguo
Wang, Houzhen
CHINA COMMUNICATIONS, 2018, 15 (02) : 25 - 32
[29] An exact quantum polynomial-time algorithm for Simon's problem
Brassard, G
Hoyer, P
PROCEEDINGS OF THE FIFTH ISRAELI SYMPOSIUM ON THEORY OF COMPUTING AND SYSTEMS, 1997, : 12 - 23
[30] Complexity phase transitions in instantaneous quantum polynomial-time circuits
Park, Chae-Yeun
Kastoryano, Michael J.
PHYSICAL REVIEW RESEARCH, 2025, 7 (01):

← 1 2 3 4 5 →