Next Article in Journal / Special Issue
Generation of Entanglement between Two Two-Level Atoms Coupled to a Microtoroidal Cavity Via Thermal Field
Previous Article in Journal
Holographic Screens Are Classical Information Channels
Previous Article in Special Issue
Measurement-Based Adaptation Protocol with Quantum Reinforcement Learning in a Rigetti Quantum Computer
Article

Undecidable, Unrecognizable, and Quantum Computing

Dubai Men’s Campus, Higher Colleges of Technology, Dubai 15825, UAE
Quantum Rep. 2020, 2(3), 337-342; https://doi.org/10.3390/quantum2030023
Received: 20 May 2020 / Revised: 20 June 2020 / Accepted: 30 June 2020 / Published: 1 July 2020
(This article belongs to the Special Issue Exclusive Feature Papers of Quantum Reports)
Quantum computing allows us to solve some problems much faster than existing classical algorithms. Yet, the quantum computer has been believed to be no more powerful than the most general computing model—the Turing machine. Undecidable problems, such as the halting problem, and unrecognizable inputs, such as the real numbers, are beyond the theoretical limit of the Turing machine. I suggest a model for a quantum computer, which is less general than the Turing machine, but may solve the halting problem for any task programmable on it. Moreover, inputs unrecognizable by the Turing machine can be recognized by the model, thus breaking the theoretical limit for a computational task. A quantum computer is not just a successful design of the Turing machine as it is widely perceived now, but is a different, less general but more powerful model for computing, the practical realization of which may need different strategies than those in use now. View Full-Text
Keywords: quantum computing; quantum information; theory of computation quantum computing; quantum information; theory of computation
MDPI and ACS Style

Siomau, M. Undecidable, Unrecognizable, and Quantum Computing. Quantum Rep. 2020, 2, 337-342. https://doi.org/10.3390/quantum2030023

AMA Style

Siomau M. Undecidable, Unrecognizable, and Quantum Computing. Quantum Reports. 2020; 2(3):337-342. https://doi.org/10.3390/quantum2030023

Chicago/Turabian Style

Siomau, Michael. 2020. "Undecidable, Unrecognizable, and Quantum Computing" Quantum Reports 2, no. 3: 337-342. https://doi.org/10.3390/quantum2030023

Find Other Styles

Article Access Map by Country/Region

1
Back to TopTop