|
| | | | |
| | | |
| Stat |
Members: 3645
Articles: 2'504'585
Articles rated: 2609
24 April 2024 |
|
| | | | |
|
Article overview
| |
|
|
A possible hypercomputational quantum algorithm | | Andrés Sicard
; Mario Vélez
; Juan Ospina
; | | Date: |
19 Jun 2004 | | 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 | | Subject: | Quantum Physics; Logic in Computer Science | quant-ph cs.LO | | Abstract: | 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. | | Source: | arXiv, quant-ph/0406137 | | Services: | Forum | Review | PDF | Favorites | |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)
|
| |
|
|
|
|
News, job offers and information for researchers and scientists:
| |
REGISTER