Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

A Quantum Computer in a “Chinese Room”

Vasil Dinev Penchev

Published May 4, 2020• 0 citations
Publisher

Abstract

Pattern recognition is represented as the limit, to which an infinite Turing process converges. A Turing machine, in which the bits are substituted with qubits, is introduced. That quantum Turing machine can recognize two complementary patterns in any data. That ability of universal pattern recognition is interpreted as an intellect featuring any quantum computer. The property is valid only within a quantum computer: To utilize it, the observer should be sited inside it. Being outside it, the observer would obtain quite different result depending on the degree of the entanglement of the quantum computer and observer. All extraordinary properties of a quantum computer are due to involving a converging infinite computational process contenting necessarily both a continuous advancing calculation and a leap to the limit. Three types of quantum computation can be distinguished according to whether the series is a finite one, an infinite rational or irrational number.

DOI
10.31124/advance.12234398.v1

Related papers

A Quantum Computer in a “Chinese Room”

Vasil Dinev Penchev

Pattern recognition is represented as the limit, to which an infinite Turing process converges. A Turing machine, in which the bits are substituted with qubits, is introduced. That quantum Turing machine can recognize two complementary patterns in any data. That ability of universal pattern recognition is interpreted as an intellect featuring any quantum computer. The property is valid only within a quantum computer: To utilize it, the observer should be sited inside it. Being outside it, the observer would obtain quite different result depending on the degree of the entanglement of the quantum computer and observer. All extraordinary properties of a quantum computer are due to involving a converging infinite computational process contenting necessarily both a continuous advancing calculation and a leap to the limit. Three types of quantum computation can be distinguished according to whether the series is a finite one, an infinite rational or irrational number.

•May 4, 2020•0 citations

A Quantum Computer in a “Chinese Room”

Vasil Dinev Penchev

Pattern recognition is represented as the limit, to which an infinite Turing processconverges. A Turing machine, in which the bits are substituted with qubits, is introduced. Thatquantum Turing machine can recognize two complementary patterns in any data. That ability ofuniversal pattern recognition is interpreted as an intellect featuring any quantum computer. Theproperty is valid only within a quantum computer: To utilize it, the observer should be sited insideit. Being outside it, the observer would obtain quite different result depending on the degreeof the entanglement of the quantum computer and observer. All extraordinary properties ofa quantum computer are due to involving a converging infinite computational process contentingnecessarily both a continuous advancing calculation and a leap to the limit. Three types ofquantum computation can be distinguished according to whether the series is a finite one, an infiniterational or irrational number.

•May 4, 2020•0 citations

Natural Argument by a Quantum Computer

Vasil Dinev Penchev

Natural argument is represented as the limit, to which an infinite Turing processconverges. A Turing machine, in which the bits are substituted with qubits, is introduced. Thatquantum Turing machine can recognize two complementary natural arguments in any data.That ability of natural argument is interpreted as an intellect featuring any quantum computer.The property is valid only within a quantum computer: To utilize it, the observer should be sitedinside it. Being outside it, the observer would obtain quite different result depending on thedegree of the entanglement of the quantum computer and observer. All extraordinary propertiesof a quantum computer are due to involving a converging infinite computational process contentingnecessarily both a continuous advancing calculation and a leap to the limit. Three typesof quantum computation can be distinguished according to whether the series is a finite one, aninfinite rational or irrational number

•Jan 1, 2020•0 citations

Отвъд машината на Тюринг: квантовият компютър

Vasil Penchev

Quantum computer is considered as a generalization of Turing machine. The bits are substituted by qubits. In turn, a "qubit" is the generalization of "bit" referring to infinite sets or series. It extends the consept of calculation from finite processes and algorithms to infinite ones, impossible as to any Turing machines (such as our computers). However, the concept of quantum computer mets all paradoxes of infinity such as Gödel's incompletness theorems (1931), etc. A philosophical reflection on how quantum computer might implement the idea of "infinite calculation" is the main subject.

•Jan 1, 2014•0 citations

Undecidable, Unrecognizable, and Quantum Computing

Michael Siomau

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.

Quantum Reports•Jul 1, 2020•3 citations

Limits and Solvability of Quantum Computing

The extent to which the possibilities and limits of computability depend on the assumed mathematical formalism is particularly evident in quantum computing. Here, methods, algorithms, and basic concepts of classical digital computing must be translated into the mathematical formalism of quantum mechanics and new concepts of quantum formalism must be utilized in order to overcome the classical limits of computability. In the sense of Church’s thesis, a classical digital computer can also be understood as a circuit of Boolean gates that process bits. In quantum computing, they are replaced by quantum gates that represent the unitary operators of quantum mechanics and process quantum bits. The enormous computing advantages are due to the special features of quantum mechanical states such as superposition and entanglement. The calculation results of a quantum computer are explained by the quantum mechanical measurement process. Classical calculation methods such as fast Fourier transformations are translated into quantum formalism and thus enable the solution of difficult calculation problems in polynomial time (e.g., factorization with the Shor algorithm). However, in this case, it cannot be ruled out that there is also a classical digital solution in polynomial time. This distinguishes the result from the fundamental impossibility of a digital solution, which was shown for real computing in Chapter 7. Classical pattern recognition and classification of machine learning (ML) with neural networks can also be translated into quantum formalism and lead to a considerable increase in performance with superposition and entanglement. In quantum complexity theory, previous NP problems can be traced back to P problems. In quantum computing too, the theoretical possibilities and limits depend on the mathematical formalism assumed. The technical– physical realization of a quantum computer, on the contrary, is again an empirical question.

World scientific series on nonlinear science, series A•Nov 25, 2024•0 citations
Pattern recognition is represented as the limit, to which an infinite Turing process converges. A Turing machine, in which the bits are substituted with qubits, is introduced. That quantum Turing machine can recognize two complementary patterns in any data. That ability of universal pattern recognition is interpreted as an intellect featuring any quantum computer. The property is valid only within a quantum computer: To utilize it, the observer should be sited inside it. Being outside it, the observer would obtain quite different result depending on the degree of the entanglement of the quantum computer and observer. All extraordinary properties of a quantum computer are due to involving a converging infinite computational process contenting necessarily both a continuous advancing calculation and a leap to the limit. Three types of quantum computation can be distinguished according to whether the series is a finite one, an infinite rational or irrational number.
Pattern recognition is represented as the limit, to which an infinite Turing process converges. A Turing machine, in which the bits are substituted with qubits, is introduced. That quantum Turing machine can recognize two complementary patterns in any data. That ability of universal pattern recognition is interpreted as an intellect featuring any quantum computer. The property is valid only within a quantum computer: To utilize it, the observer should be sited inside it. Being outside it, the observer would obtain quite different result depending on the degree of the entanglement of the quantum computer and observer. All extraordinary properties of a quantum computer are due to involving a converging infinite computational process contenting necessarily both a continuous advancing calculation and a leap to the limit. Three types of quantum computation can be distinguished according to whether the series is a finite one, an infinite rational or irrational number.
Pattern recognition is represented as the limit, to which an infinite Turing processconverges. A Turing machine, in which the bits are substituted with qubits, is introduced. Thatquantum Turing machine can recognize two complementary patterns in any data. That ability ofuniversal pattern recognition is interpreted as an intellect featuring any quantum computer. Theproperty is valid only within a quantum computer: To utilize it, the observer should be sited insideit. Being outside it, the observer would obtain quite different result depending on the degreeof the entanglement of the quantum computer and observer. All extraordinary properties ofa quantum computer are due to involving a converging infinite computational process contentingnecessarily both a continuous advancing calculation and a leap to the limit. Three types ofquantum computation can be distinguished according to whether the series is a finite one, an infiniterational or irrational number.
Natural argument is represented as the limit, to which an infinite Turing processconverges. A Turing machine, in which the bits are substituted with qubits, is introduced. Thatquantum Turing machine can recognize two complementary natural arguments in any data.That ability of natural argument is interpreted as an intellect featuring any quantum computer.The property is valid only within a quantum computer: To utilize it, the observer should be sitedinside it. Being outside it, the observer would obtain quite different result depending on thedegree of the entanglement of the quantum computer and observer. All extraordinary propertiesof a quantum computer are due to involving a converging infinite computational process contentingnecessarily both a continuous advancing calculation and a leap to the limit. Three typesof quantum computation can be distinguished according to whether the series is a finite one, aninfinite rational or irrational number
Quantum computer is considered as a generalization of Turing machine. The bits are substituted by qubits. In turn, a "qubit" is the generalization of "bit" referring to infinite sets or series. It extends the consept of calculation from finite processes and algorithms to infinite ones, impossible as to any Turing machines (such as our computers). However, the concept of quantum computer mets all paradoxes of infinity such as Gödel's incompletness theorems (1931), etc. A philosophical reflection on how quantum computer might implement the idea of "infinite calculation" is the main subject.
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.
The extent to which the possibilities and limits of computability depend on the assumed mathematical formalism is particularly evident in quantum computing. Here, methods, algorithms, and basic concepts of classical digital computing must be translated into the mathematical formalism of quantum mechanics and new concepts of quantum formalism must be utilized in order to overcome the classical limits of computability. In the sense of Church’s thesis, a classical digital computer can also be understood as a circuit of Boolean gates that process bits. In quantum computing, they are replaced by quantum gates that represent the unitary operators of quantum mechanics and process quantum bits. The enormous computing advantages are due to the special features of quantum mechanical states such as superposition and entanglement. The calculation results of a quantum computer are explained by the quantum mechanical measurement process. Classical calculation methods such as fast Fourier transformations are translated into quantum formalism and thus enable the solution of difficult calculation problems in polynomial time (e.g., factorization with the Shor algorithm). However, in this case, it cannot be ruled out that there is also a classical digital solution in polynomial time. This distinguishes the result from the fundamental impossibility of a digital solution, which was shown for real computing in Chapter 7. Classical pattern recognition and classification of machine learning (ML) with neural networks can also be translated into quantum formalism and lead to a considerable increase in performance with superposition and entanglement. In quantum complexity theory, previous NP problems can be traced back to P problems. In quantum computing too, the theoretical possibilities and limits depend on the mathematical formalism assumed. The technical– physical realization of a quantum computer, on the contrary, is again an empirical question.