A possible hypercomputational quantum algorithm
<|reference_start|>A possible hypercomputational quantum algorithm: 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.<|reference_end|>
@article{sicard2004a,
    title={A possible hypercomputational quantum algorithm},
    author={Andr'es Sicard, Mario V'elez, Juan Ospina},
    journal={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},
    year={2004},
    doi={10.1117/12.602254},
    archivePrefix={arXiv},
    eprint={quant-ph/0406137},
    primaryClass={quant-ph cs.LO}
}