Fast quantum computation at arbitrarily low energy

被引:26
|
作者
Jordan, Stephen P. [1 ,2 ]
机构
[1] NIST, Gaithersburg, MD 20899 USA
[2] Univ Maryland, Joint Ctr Quantum Informat & Comp Sci QuICS, College Pk, MD 20742 USA
关键词
PHYSICAL LIMITS; INFORMATION-TRANSFER; MINIMUM ENERGY; FIELD THEORIES; EVOLUTION; ENTROPY; STATE; SPEED; TIME;
D O I
10.1103/PhysRevA.95.032305
中图分类号
O43 [光学];
学科分类号
070207 ; 0803 ;
摘要
One version of the energy- time uncertainty principle states that the minimum time T-perpendicular to for a quantum system to evolve from a given state to any orthogonal state is h/( 4 Delta E), where Delta E is the energy uncertainty. Arelated bound called the Margolus-Levitin theorem states that T-perpendicular to >= h/(2 < E >), where < E > is the expectation value of energy and the ground energy is taken to be zero. Many subsequent works have interpreted T. as defining a minimal time for an elementary computational operation and correspondingly a fundamental limit on clock speed determined by a system's energy. Here we present local time-independent Hamiltonians in which computational clock speed becomes arbitrarily large relative to < E > and Delta E as the number of computational steps goes to infinity. We argue that energy considerations alone are not sufficient to obtain an upper bound on computational speed, and that additional physical assumptions such as limits to information density and information transmission speed are necessary to obtain such a bound.
引用
收藏
页数:10
相关论文
共 50 条
  • [21] Energy-Efficient Clocking Based on Resonant Switching for Low-Power Computation
    Jana, Raj K.
    Snider, Gregory L.
    Jena, Debdeep
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS, 2014, 61 (05) : 1400 - 1408
  • [22] Quantum computation of molecular response properties
    Cai, Xiaoxia
    Fang, Wei-Hai
    Fan, Heng
    Li, Zhendong
    PHYSICAL REVIEW RESEARCH, 2020, 2 (03):
  • [23] Algorithm for quantum computation of particle decays
    Ciavarella, Anthony
    PHYSICAL REVIEW D, 2020, 102 (09)
  • [24] Optically simulated universal quantum computation
    Francisco, D.
    Ledesma, S.
    RIAO/OPTILAS 2007, 2008, 992 : 1061 - 1066
  • [25] Advice Coins for Classical and Quantum Computation
    Aaronson, Scott
    Drucker, Andrew
    AUTOMATA, LANGUAGES AND PROGRAMMING, ICALP, PT I, 2011, 6755 : 61 - 72
  • [26] Lattice surgery translation for quantum computation
    Herr, Daniel
    Nori, Franco
    Devitt, Simon J.
    NEW JOURNAL OF PHYSICS, 2017, 19
  • [27] Quantum computation and simulation with superconducting qubits*
    He, Kaiyong
    Geng, Xiao
    Huang, Rutian
    Liu, Jianshe
    Chen, Wei
    CHINESE PHYSICS B, 2021, 30 (08)
  • [28] Quantum computation with doped silicon cavities
    Abanto, M.
    Davidovich, L.
    Koiller, Belita
    de Matos Filho, R. L.
    PHYSICAL REVIEW B, 2010, 81 (08)
  • [29] Quantum computation with indefinite causal structures
    Araujo, Mateus
    Guerin, Philippe Allard
    Baumeler, Amin
    PHYSICAL REVIEW A, 2017, 96 (05)
  • [30] Sampled-Data Estimator for Nonlinear Systems with Arbitrarily Fast Rate of Convergence
    Mazenc, Frederic
    Malisoff, Michael
    Niculescu, Silviu-Iulian
    2020 AMERICAN CONTROL CONFERENCE (ACC), 2020, : 1685 - 1689