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 条
  • [31] Quantum Polynomial-Time Fixed-Point Attack for RSA
    Wang, Yahui
    Zhang, Huanguo
    Wang, Houzhen
    CHINA COMMUNICATIONS, 2018, 15 (02) : 25 - 32
  • [32] 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
  • [33] Deterministic polynomial-time quantum algorithms for Simon's problem
    Mihara, T
    Sung, SC
    COMPUTATIONAL COMPLEXITY, 2003, 12 (3-4) : 162 - 175
  • [34] Polynomial-Time Formal Verification of Adder Circuits for Multiple-Valued Logic
    Niemann, Philipp
    Drechslee, Rolf
    2022 IEEE 52ND INTERNATIONAL SYMPOSIUM ON MULTIPLE-VALUED LOGIC (ISMVL 2022), 2022, : 9 - 14
  • [35] Polynomial-time solvable #CSP problems via algebraic models and Pfaffian circuits
    Margulies, S.
    Morton, J.
    JOURNAL OF SYMBOLIC COMPUTATION, 2016, 74 : 152 - 180
  • [36] Exploring the neighborhood of 1-layer QAOA with instantaneous quantum polynomial circuits
    Leontica, Sebastian
    Amaro, David
    PHYSICAL REVIEW RESEARCH, 2024, 6 (01):
  • [37] Optimal Cooperative Driving at Signal-Free Intersections With Polynomial-Time Complexity
    Pei, Huaxin
    Zhang, Yuxiao
    Zhang, Yi
    Feng, Shuo
    IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS, 2022, 23 (08) : 12908 - 12920
  • [38] Structure of Polynomial-Time Approximation
    van Leeuwen, Erik Jan
    van Leeuwen, Jan
    THEORY OF COMPUTING SYSTEMS, 2012, 50 (04) : 641 - 674
  • [39] LINK SCHEDULING IN POLYNOMIAL-TIME
    HAJEK, B
    SASAKI, G
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1988, 34 (05) : 910 - 917
  • [40] On Polynomial-Time Relation Reducibility
    Gao, Su
    Ziegler, Caleb
    NOTRE DAME JOURNAL OF FORMAL LOGIC, 2017, 58 (02) : 271 - 285
12345