Comment on "Polynomial-time simulation of pairing models on a quantum computer" - Reply

被引：3

作者：

Wu, LA ^{[1
]}

Byrd, MS ^{[1
]}

Lidar, DA ^{[1
]}

机构：

[1] Univ Toronto, Dept Chem, Toronto, ON M5S 1A1, Canada

来源：

PHYSICAL REVIEW LETTERS | 2003年 / 90卷 / 24期

关键词：

D O I：

10.1103/PhysRevLett.90.249804

中图分类号：

O4 [物理学];

学科分类号：

0702 ;

摘要：

引用

页数：1

共 50 条

[21] ON POLYNOMIAL-TIME DEFINABLE CLASSES OF FINITE-MODELS
DAHLHAUS, E
JOURNAL OF SYMBOLIC LOGIC, 1987, 52 (01) : 313 - 313
[22] A POLYNOMIAL-TIME GENERATOR FOR MINIMAL PERFECT HASH FUNCTIONS - REPLY
SAGER, TJ
COMMUNICATIONS OF THE ACM, 1986, 29 (06) : 557 - 557
[23] Quantum Polynomial-Time Fixed-Point Attack for RSA
Yahui Wang
Huanguo Zhang
Houzhen Wang
中国通信, 2018, 15 (02) : 25 - 32
[24] Deterministic polynomial-time quantum algorithms for Simon’s problem
Takashi Mihara
Shao Chin Sung
computational complexity, 2003, 12 : 162 - 175
[25] Quantum Polynomial-Time Fixed-Point Attack for RSA
Wang, Yahui
Zhang, Huanguo
Wang, Houzhen
CHINA COMMUNICATIONS, 2018, 15 (02) : 25 - 32
[26] 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
[27] Complexity phase transitions in instantaneous quantum polynomial-time circuits
Park, Chae-Yeun
Kastoryano, Michael J.
PHYSICAL REVIEW RESEARCH, 2025, 7 (01):
[28] Deterministic polynomial-time quantum algorithms for Simon's problem
Mihara, T
Sung, SC
COMPUTATIONAL COMPLEXITY, 2003, 12 (3-4) : 162 - 175
[29] Complexity phase transitions in instantaneous quantum polynomial-time circuits
Park, Chae-Yeun
Kastoryano, Michael J.
Physical Review Research, 7 (01):
[30] A POLYNOMIAL-TIME ALGORITHM FOR RECONFIGURING MULTIPLE-TRACK MODELS
VARVARIGOU, TA
ROYCHOWDHURY, VP
KAILATH, T
IEEE TRANSACTIONS ON COMPUTERS, 1993, 42 (04) : 385 - 395

← 1 2 3 4 5 →