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 条
  • [1] Exponential rise of dynamical complexity in quantum computing through projections
    Daniel Klaus Burgarth
    Paolo Facchi
    Vittorio Giovannetti
    Hiromichi Nakazato
    Saverio Pascazio
    Kazuya Yuasa
    Nature Communications, 5
  • [2] Computing complexity measures for quantum states based on exponential families
    Niekamp, Soenke
    Galla, Tobias
    Kleinmann, Matthias
    Guehne, Otfried
    JOURNAL OF PHYSICS A-MATHEMATICAL AND THEORETICAL, 2013, 46 (12)
  • [3] Quantum computing and quantum complexity theory
    Vazirani, U
    ISCAS 2000: IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS - PROCEEDINGS, VOL I: EMERGING TECHNOLOGIES FOR THE 21ST CENTURY, 2000, : 737 - 739
  • [4] Quantum Computing and Complexity in Art
    Heaney, Libby
    LEONARDO, 2019, 52 (03) : 230 - 235
  • [5] Nanowires: Exponential speedup in quantum computing
    Mimona, Mariam Akter
    Mobarak, Md Hosne
    Ahmed, Emtiuz
    Kamal, Farzana
    Hasan, Mehedi
    HELIYON, 2024, 10 (11)
  • [6] Dispersive graded entropy on computing dynamical complexity
    Mukherjee, Sayan
    Banerjee, Santo
    Rondoni, Lamberto
    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2018, 508 : 131 - 140
  • [7] Exponential gain in quantum computing of quantum chaos and localization
    Georgeot, B
    Shepelyansky, DL
    PHYSICAL REVIEW LETTERS, 2001, 86 (13) : 2890 - 2893
  • [8] The Exponential Time Complexity of Computing the Probability That a Graph Is Connected
    Husfeldt, Thore
    Taslaman, Nina
    PARAMETERIZED AND EXACT COMPUTATION, 2010, 6478 : 192 - 203
  • [9] Exponential complexity and ontological theories of quantum mechanics
    Montina, A.
    PHYSICAL REVIEW A, 2008, 77 (02):
  • [10] Quantum Computing and Information Extraction for Dynamical Quantum Systems
    Giuliano Benenti
    Giulio Casati
    Simone Montangero
    Quantum Information Processing, 2004, 3 : 273 - 293