Exponential rise of dynamical complexity in quantum computing through projections

被引:41
|
作者
Burgarth, Daniel Klaus [1 ]
Facchi, Paolo [2 ,3 ]
Giovannetti, Vittorio [4 ,5 ]
Nakazato, Hiromichi [6 ]
Pascazio, Saverio [2 ,3 ]
Yuasa, Kazuya [6 ]
机构
[1] Aberystwyth Univ, Inst Math Phys & Comp Sci, Aberystwyth SY23 3BZ, Dyfed, Wales
[2] Univ Bari, Dipartimento Fis & MECENAS, I-70126 Bari, Italy
[3] Ist Nazl Fis Nucl, Sez Bari, I-70126 Bari, Italy
[4] Scuola Normale Super Pisa, NEST, I-56126 Pisa, Italy
[5] CNR, Ist Nanosci, I-56126 Pisa, Italy
[6] Waseda Univ, Dept Phys, Tokyo 1698555, Japan
关键词
SYSTEMS; COMPUTATION; DRIVEN;
D O I
10.1038/ncomms6173
中图分类号
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号
07 ; 0710 ; 09 ;
摘要
The ability of quantum systems to host exponentially complex dynamics has the potential to revolutionize science and technology. Therefore, much effort has been devoted to developing of protocols for computation, communication and metrology, which exploit this scaling, despite formidable technical difficulties. Here we show that the mere frequent observation of a small part of a quantum system can turn its dynamics from a very simple one into an exponentially complex one, capable of universal quantum computation. After discussing examples, we go on to show that this effect is generally to be expected: almost any quantum dynamics becomes universal once 'observed' as outlined above. Conversely, we show that any complex quantum dynamics can be 'purified' into a simpler one in larger dimensions. We conclude by demonstrating that even local noise can lead to an exponentially complex dynamics.
引用
收藏
页数:6
相关论文
共 50 条
  • [21] Dynamical description of quantum computing: Generic nonlocality of quantum noise
    Alicki, R
    Horodecki, M
    Horodecki, P
    Horodecki, R
    PHYSICAL REVIEW A, 2002, 65 (06): : 11
  • [22] Dynamical Phase Transitions in Quantum Reservoir Computing
    Martinez-Pena, Rodrigo
    Luca Giorgi, Gian
    Nokkala, Johannes
    Soriano, Miguel C.
    Zambrini, Roberta
    PHYSICAL REVIEW LETTERS, 2021, 127 (10)
  • [23] Exponential Separation of Quantum and Classical Online Space Complexity
    Le Gall, Francois
    THEORY OF COMPUTING SYSTEMS, 2009, 45 (02) : 188 - 202
  • [24] Exponential Separation of Quantum and Classical Online Space Complexity
    François Le Gall
    Theory of Computing Systems, 2009, 45 : 188 - 202
  • [25] On the quantum complexity of computing the median of continuous distributions
    Goćwin, Maciej
    Quantum Information and Computation, 2019, 19 (11-12): : 952 - 966
  • [26] Some Complexity Results Involving Quantum Computing
    Ivanyos, Gabor
    Pereszlenyi, Attila
    Ronyai, Lajos
    ERCIM NEWS, 2022, (128): : 18 - 19
  • [27] ON THE QUANTUM COMPLEXITY OF COMPUTING THE MEDIAN OF CONTINUOUS DISTRIBUTIONS
    Gocwin, Maciej
    QUANTUM INFORMATION & COMPUTATION, 2019, 19 (11-12) : 952 - 966
  • [28] Complexity characterization of dynamical systems through predictability
    Cecconi, F
    Falcioni, M
    Vulpiani, A
    ACTA PHYSICA POLONICA B, 2003, 34 (07): : 3581 - 3605
  • [29] Dynamical quantum phase transitions and quantum thermodynamics: An approach through dynamical transformations
    Xu, You-Yang
    PHYSICAL REVIEW E, 2025, 111 (01)
  • [30] Computing and Controlling the Convergence Speed of Quantum Dynamical Semigroups
    Lucchese, Riccardo
    Ticozzi, Francesco
    49TH IEEE CONFERENCE ON DECISION AND CONTROL (CDC), 2010, : 3022 - 3027