Title changed. Updated to the published version. Oral contribution to Quantum Information and Computation III, part of the SPIE Defense and Security Symposium 2005. 8 pages
发表信息：
In E. J. Donkor, A. R. Pirich, and H. E. Brandt, editors, "Quantum Information and Computation III", volume 5815 of Proc. of SPIE. SPIE, Bellingham, WA, 2005. p. 219-226
术语“超机”表示能够执行图灵机无法执行的任务的任何数据处理设备（理论上的或可以实现的）。我们提出了一个可能的量子算法的经典不可计算的决策问题，希尔伯特的第十个问题，更具体地说，我们提出了一个可能的超计算模型的基础上量子计算。我们的算法是受Tien D. Kieu，但是我们选择了无限方阱而不是（一维）简谐振子作为基础物理系统。我们的模型利用了量子绝热过程和与无限深方势阱相关联的动力学李代数su（1，1）的表示特性。
英文摘要：
The term `hypermachine' denotes any data processing device (theoretical or that can be implemented) capable of carrying out tasks that cannot be performed by a Turing machine. We present a possible quantum algorithm for a classically non-computable decision problem, Hilbert's tenth problem; more specifically, we present a possible hypercomputation model based on quantum computation. Our algorithm is inspired by the one proposed by Tien D. Kieu, but we have selected the infinite square well instead of the (one-dimensional) simple harmonic oscillator as the underlying physical system. Our model exploits the quantum adiabatic process and the characteristics of the representation of the dynamical Lie algebra su(1,1) associated to the infinite square well.
Towards identifying possible fault-tolerant advantage of quantum linear system algorithms in terms of space, time and energy
The University of Pittsburgh（匹兹堡大学）；The University of Chicago（芝加哥大学）；Mason Experimental Geometry Lab（梅森实验几何实验室）；Lehigh University（理海大学）；The University of Portland（波特兰大学）；Charles Schwab Corporation（嘉信理财公司）
