Complexity phase transitions in instantaneous quantum polynomial-time circuits

被引：0

作者：

Park, Chae-Yeun ^{[1
,2
,3
]}

Kastoryano, Michael J. ^{[1
,4
,5
]}

机构：

[1] Institute for Theoretical Physics, University of Cologne, Köln,50937, Germany

[2] Xanadu, Toronto,ON,M5G 2C8, Canada

[3] School of Integrated Technology, Yonsei University, Seoul,21983, Korea, Republic of

[4] Amazon Quantum Solutions Lab, Seattle,WA,98170, United States

[5] AWS Center for Quantum Computing, Pasadena,CA,91125, United States

来源：

Physical Review Research | / 7卷 / 01期

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

Qubits

引用

共 50 条

[21] Minimax games, spin glasses, and the polynomial-time hierarchy of complexity classes
Varga, P
PHYSICAL REVIEW E, 1998, 57 (06): : 6487 - 6492
[22] ALGORITHMS FROM COMPLEXITY THEORY - POLYNOMIAL-TIME OPERATIONS FOR COMPLEX SETS
HEMACHANDRA, LA
LECTURE NOTES IN COMPUTER SCIENCE, 1990, 450 : 221 - 231
[23] A polynomial-time decomposition algorithm for petri nets based on indexes of transitions
Zeng Q.
Information Technology Journal, 2011, 10 (04) : 856 - 862
[24] A SIMPLE COMPLEXITY PROOF FOR A POLYNOMIAL-TIME LINEAR-PROGRAMMING ALGORITHM
TSENG, P
OPERATIONS RESEARCH LETTERS, 1989, 8 (03) : 155 - 159
[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] AVERAGE POLYNOMIAL-TIME COMPLEXITY OF SOME NP-COMPLETE PROBLEMS
DIEU, PD
THANH, LC
HOA, LT
THEORETICAL COMPUTER SCIENCE, 1986, 46 (2-3) : 219 - 327
[27] Quantum Polynomial-Time Fixed-Point Attack for RSA
Yahui Wang
Huanguo Zhang
Houzhen Wang
中国通信, 2018, 15 (02) : 25 - 32
[28] Transitions in entanglement complexity in random quantum circuits by measurements
Oliviero, Salvatore F. E.
Leone, Lorenzo
Hamma, Alioscia
PHYSICS LETTERS A, 2021, 418
[29] Transitions in entanglement complexity in random quantum circuits by measurements
Oliviero, Salvatore F.E.
Leone, Lorenzo
Hamma, Alioscia
Physics Letters, Section A: General, Atomic and Solid State Physics, 2021, 418
[30] Deterministic polynomial-time quantum algorithms for Simon’s problem
Takashi Mihara
Shao Chin Sung
computational complexity, 2003, 12 : 162 - 175

← 1 2 3 4 5 →