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 条

[41] An arithmetic for polynomial-time computation
Schwichtenberg, Helmut
THEORETICAL COMPUTER SCIENCE, 2006, 357 (1-3) : 202 - 214
[42] Polynomial-time quantum algorithms for finding the linear structures of Boolean function
Wu, WanQing
Zhang, HuanGuo
Wang, HouZhen
Mao, ShaoWu
QUANTUM INFORMATION PROCESSING, 2015, 14 (04) : 1215 - 1226
[43] SOLVABILITY BY RADICALS IS IN POLYNOMIAL-TIME
LANDAU, S
MILLER, GL
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1985, 30 (02) : 179 - 208
[44] ON DATALOG VS POLYNOMIAL-TIME
AFRATI, F
COSMADAKIS, SS
YANNAKAKIS, M
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1995, 51 (02) : 177 - 196
[45] ON THE POWER OF PARITY POLYNOMIAL-TIME
CAI, JY
HEMACHANDRA, LA
LECTURE NOTES IN COMPUTER SCIENCE, 1989, 349 : 229 - 239
[46] Collapsing polynomial-time degrees
Ambos-Spies, K
Bentzien, L
Fejer, PA
Merkle, W
Stephan, F
LOGIC COLLOQUIM '98, 2000, 13 : 1 - 24
[47] On the Design and Optimization of a Quantum Polynomial-Time Attack on Elliptic Curve Cryptography
Cheung, Donny
Maslov, Dmitri
Mathew, Jimson
Pradhan, Dhiraj K.
THEORY OF QUANTUM COMPUTATION, COMMUNICATION, AND CRYPTOGRAPHY, 2008, 5106 : 96 - +
[48] Experimental simulation of a pairing Hamiltonian on an NMR quantum computer
Yang, XD
Wang, AM
Xu, F
Du, JF
CHEMICAL PHYSICS LETTERS, 2006, 422 (1-3) : 20 - 24
[49] Strong polynomial-time reducibility
Shinoda, J
ANNALS OF PURE AND APPLIED LOGIC, 1997, 84 (01) : 97 - 117
[50] The analytic polynomial-time hierarchy
Baier, H
Wagner, KW
MATHEMATICAL LOGIC QUARTERLY, 1998, 44 (04) : 529 - 544

← 1 2 3 4 5 →