A possible hypercomputational quantum algorithm
Andrés Sicard, Mario Vélez, Juan Ospina
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.
Create a lesson
Related papers
Pinning of a High-Energy Wavepacket by a Single Impurity
Fartash Chalangari, Anant Vijay Varma, Joonas Keski-Rahkonen et al.
Loss-Tolerant Measurement-Device-Independent QKD over Untrusted Repeaters via High-Dimensional Time-Bin Multiplexing
Yu-Chun Yin, Ching-Yi Lai, Alexei Ashikhmin
Strong subadditivity of topological entropy on the torus: Rényi order and non-Abelian structure
Yi Liang
Advances in quantum optomechanical control based on cavity cold-atom systems
Baijun Li, Tianxiang Lu, Jie Wang et al.
Metric-Changing Quasi-Hermitian Quenches: Normalized Loschmidt Amplitude and Complex-Time Zeros
Xu-Yang Hou, Jia-Chen Tang, Hao Guo
Multi-Instantons and Exact-WKB Stokes Jumps in Multi-Well Quantum Mechanics
Alireza Behtash, Syo Kamata