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 条
  • [41] Universal quantum computation with a nonlinear oscillator network
    Goto, Hayato
    PHYSICAL REVIEW A, 2016, 93 (05)
  • [42] Verification of blind quantum computation with entanglement witnesses
    Xu, Qingshan
    Tan, Xiaoqing
    Huang, Rui
    Li, Meiqi
    PHYSICAL REVIEW A, 2021, 104 (04)
  • [43] A study of heuristic guesses for adiabatic quantum computation
    Perdomo-Ortiz, Alejandro
    Venegas-Andraca, Salvador E.
    Aspuru-Guzik, Alan
    QUANTUM INFORMATION PROCESSING, 2011, 10 (01) : 33 - 52
  • [44] Fast computation of the spherical harmonic perturbation on an artificial satellite
    林钦畅
    Science in China(Series E:Technological Sciences), 1997, (03) : 324 - 330
  • [45] Superadiabatic holonomic quantum computation in cavity QED
    Liu, Bao-Jie
    Huang, Zhen-Hua
    Xue, Zheng-Yuan
    Zhang, Xin-Ding
    PHYSICAL REVIEW A, 2017, 95 (06)
  • [46] Fast computation of entropies and mutual information for multispectral images
    Ouattara, Sie
    Clement, Alain
    Chapeau-Blondeau, Francois
    ICINCO 2007: PROCEEDINGS OF THE FOURTH INTERNATIONAL CONFERENCE ON INFORMATICS IN CONTROL, AUTOMATION AND ROBOTICS, VOL RA-1: ROBOTICS AND AUTOMATION, VOL 1, 2007, : 195 - 199
  • [47] Fast computation of the spherical harmonic perturbation on an artificial satellite
    Qinchang Lin
    Science in China Series E: Technological Sciences, 1997, 40 : 324 - 330
  • [48] Fast analytic computation of cosmic string power spectra
    Avgoustidis, Anastasios
    Copeland, Edmund J.
    Moss, Adam
    Skliros, Dimitri
    PHYSICAL REVIEW D, 2012, 86 (12)
  • [49] Fast Computation of Radial Vibration in Switched Reluctance Motors
    Guo, Xiaoqiang
    Zhong, Rui
    Zhang, Mingshu
    Ding, Desheng
    Sun, Weifeng
    IEEE TRANSACTIONS ON INDUSTRIAL ELECTRONICS, 2018, 65 (06) : 4588 - 4598
  • [50] Fast computation of the spherical harmonic perturbation on an artificial satellite
    Lin, QC
    SCIENCE IN CHINA SERIES E-TECHNOLOGICAL SCIENCES, 1997, 40 (03): : 324 - 330