A Quantum Computer in a 'Chinese Room'

Vasil Penchev

doi:10.2139/ssrn.3635979

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.

Highlights

The article considers quantum computation both philosophically and mathematically only theoretically raising the following questions: How can one reduce pattern recognition in a single mathematical model if the data are a numerical series?
Any data can be encoded as a numerical series, and this is the way for them to be represented in a computer
One should distinct two cases: (1) the computer reaches the result, either correct or wrong, in a finite time; (2) it cannot reach the result in a given time, either for a wrong algorithm or for an infinite result or for it will reach the result in a time long than the given: One needs an exact criterion to distinct an infinite result from the absence of any result

Summary

Introduction

The article considers quantum computation both philosophically and mathematically only theoretically raising the following questions: How can one reduce pattern recognition in a single mathematical model if the data are a numerical series?. The pattern recognition in all cases enumerated above means to reveal a limit, to which the series of Turing tapes obtained successively in course of the work of the machine converge: If it has stopped for a finite time, that limit coincides with its last state, which is the ultimate result of its work.

Results

Conclusion