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 条
  • [1] Complexity phase transitions in instantaneous quantum polynomial-time circuits
    Park, Chae-Yeun
    Kastoryano, Michael J.
    PHYSICAL REVIEW RESEARCH, 2025, 7 (01):
  • [2] The complexity of polynomial-time approximation
    Cai, Liming
    Fellows, Michael
    Juedes, David
    Rosamond, Frances
    THEORY OF COMPUTING SYSTEMS, 2007, 41 (03) : 459 - 477
  • [3] The Complexity of Polynomial-Time Approximation
    Liming Cai
    Michael Fellows
    David Juedes
    Frances Rosamond
    Theory of Computing Systems, 2007, 41 : 459 - 477
  • [4] PARITY, CIRCUITS, AND THE POLYNOMIAL-TIME HIERARCHY
    FURST, M
    SAXE, JB
    SIPSER, M
    MATHEMATICAL SYSTEMS THEORY, 1984, 17 (01): : 13 - 27
  • [5] NONCONSTRUCTIVE ADVANCES IN POLYNOMIAL-TIME COMPLEXITY
    FELLOWS, MR
    LANGSTON, MA
    INFORMATION PROCESSING LETTERS, 1987, 26 (03) : 157 - 162
  • [6] Quantum complexity phase transitions in monitored random circuits
    Suzuki, Ryotaro
    Haferkamp, Jonas
    Eisert, Jens
    Faist, Philippe
    QUANTUM, 2025, 9
  • [7] ON POLYNOMIAL-TIME TESTABLE COMBINATIONAL-CIRCUITS
    RAO, NSV
    TOIDA, S
    IEEE TRANSACTIONS ON COMPUTERS, 1994, 43 (11) : 1298 - 1308
  • [8] POLYNOMIAL-TIME TESTABILITY OF CIRCUITS GENERATED BY INPUT DECOMPOSITION
    LEE, GS
    IRWIN, MJ
    OWENS, RM
    IEEE TRANSACTIONS ON COMPUTERS, 1994, 43 (02) : 201 - 210
  • [9] Randomized Polynomial-Time Identity Testing for Noncommutative Circuits
    Arvind, Vikraman
    Joglekar, Pushkar S.
    Mukhopadhyay, Partha
    Raja, S.
    THEORY OF COMPUTING, 2019, 15 : 1 - 36
  • [10] Quantum computing, postselection, and probabilistic polynomial-time
    Aaronson, S
    PROCEEDINGS OF THE ROYAL SOCIETY A-MATHEMATICAL PHYSICAL AND ENGINEERING SCIENCES, 2005, 461 (2063): : 3473 - 3482
12345