Conference PaperPDF Available

Quantum Computer: Quantum Model and Reality

December 2013

Conference: International Conference "Philosophy of Science in the 21st century - Challenges and Tasks"
At: Univerity of Lisbon, Lisbon, Portugal, 4-6 December 2013

Authors:

Vasil Dinev Penchev

Bulgarian Academy of Sciences

1. Can a quantum model unlike a classical model coincide with reality? • 2. Is reality interpretable as a quantum computer? • 3. Can physical processes be understood better and more generally as computations of quantum computer? • 4. Is quantum information the real fundament of the world? • 5. Does the conception of quantum computer unify physics and mathematics and thus the material and the ideal world? • 6. Is quantum computer a non-Turing machine in principle? • 7. Can a quantum computation be interpreted as an infinite classical computational process of a Turing machine? • 8. Does quantum computer introduce the notion of “actually infinite computational process”?

ResearchGate has not been able to resolve any citations for this publication.

ResearchGate has not been able to resolve any references for this publication.

Article

Towards Observable Quantum Turing Machines: Fundamentals, Computational Power, and Universality

January 2011 · International Journal of Unconventional Computing

Simon Perdrix

We study the observation of quantum Turing machines by allowing interactions between a quantum machine and its environment during the computation, whereas a quantum Turing machine -original model introduced by Deutsch- remains isolated. We show that the introduction of observations leads to a weakening of the well formedness conditions of quantum Turing machines such that any (reversible or not) ... [Show full abstract] classical Turing machine is a special instance of a quantum machine. Moreover, observation of quantum Turing machines provides a formal solution to the halting process problem: the impossibility to know whether a given quantum Turing machine has actually reached its halting state. It also provides a more realistic abstract architecture of a quantum computer while most of the physical proposals of quantum computers are based on an hybrid classical-quantum architecture. However, we show that a natural formalisation of an observable quantum Turing machines leads to an over-powerful model solving undecidable problems. As a consequence, we introduce a restricted version of observable quantum Turing machines and we show that, under this restriction, any observable quantum Turing machine can be efficiently simulated by a quantum Turing machine. Finally, we discuss the potential application of the observable quantum Turing machine in the quest of a universal quantum Turing machine while recent papers have pointed out that a classical control is a key feature of a universal quantum machine.

Article

Full-text available

Quantum Computer: Quantum Model and Reality

January 2020 · SSRN Electronic Journal

Vasil Dinev Penchev

Any computer can create a model of reality. The hypothesis that quantum computer can generate such a model designated as quantum, which coincides with the modeled reality, is discussed. Its reasons are the theorems about the absence of “hidden variables” in quantum mechanics. The quantum modeling requires the axiom of choice. The following conclusions are deduced from the hypothesis. A quantum ... [Show full abstract] model unlike a classical model can coincide with reality. Reality can be interpreted as a quantum computer. The physical processes represent computations of the quantum computer. Quantum information is the real fundament of the world. The conception of quantum computer unifies physics and mathematics and thus the material and the ideal world. Quantum computer is a non-Turing machine in principle. Any quantum computing can be interpreted as an infinite classical computational process of a Turing machine. Quantum computer introduces the notion of “actually infinite computational process”. The discussed hypothesis is consistent with all quantum mechanics. The conclusions address a form of neo-Pythagoreanism: Unifying the mathematical and physical, quantum computer is situated in an intermediate domain of their mutual transformation. Keywords: model, quantum computer, reality, Turing machine

Preprint

Full-text available

Quantum Computer: Quantum Model and Reality

June 2020

Vasil Dinev Penchev

Any computer can create a model of reality. The hypothesis that quantum computer can generate such a model designated as quantum, which coincides with the modeled reality, is discussed. Its reasons are the theorems about the absence of “hidden variables” in quantum mechanics. The quantum modeling requires the axiom of choice. The following conclusions are deduced from the hypothesis. A quantum ... [Show full abstract] model unlike a classical model can coincide with reality. Reality can be interpreted as a quantum computer. The physical processes represent computations of the quantum computer. Quantum information is the real fundament of the world. The conception of quantum computer unifies physics and mathematics and thus the material and the ideal world. Quantum computer is a non-Turing machine in principle. Any quantum computing can be interpreted as an infinite classical computational process of a Turing machine. Quantum computer introduces the notion of “actually infinite computational process”. The discussed hypothesis is consistent with all quantum mechanics. The conclusions address a form of neo-Pythagoreanism: Unifying the mathematical and physical, quantum computer is situated in an intermediate domain of their mutual transformations.

Preprint

A Mathematical Model of Quantum Computer by Both Arithmetic and Set Theory

May 2020

Vasil Dinev Penchev

A practical viewpoint links reality, representation, and language to calculation by the concept of Turing (1936) machine being the mathematical model of our computers. After the Gödel incompleteness theorems (1931) or the insolvability of the so-called halting problem (Turing 1936; Church 1936) as to a classical machine of Turing, one of the simplest hypotheses is completeness to be suggested for ... [Show full abstract] two ones. That is consistent with the provability of completeness by means of two independent Peano arithmetics discussed in Section I.Many modifications of Turing machines cum quantum ones are researched in Section II for the Halting problem and completeness, and the model of two independent Turing machines seems to generalize them.Then, that pair can be postulated as the formal definition of reality therefore being complete unlike any of them standalone, remaining incomplete without its complementary counterpart. Representation is formal defined as a one-to-one mapping between the two Turing machines, and the set of all those mappings can be considered as “language” therefore including metaphors as mappings different than representation. Section III investigates that formal relation of “reality”, “representation”, and “language” modeled by (at least two) Turing machines.The independence of (two) Turing machines is interpreted by means of game theory and especially of the Nash equilibrium in Section IV.Choice and information as the quantity of choices are involved. That approach seems to be equivalent to that based on set theory and the concept of actual infinity in mathematics and allowing of practical implementations.

Article

Full-text available

Natural Argument by a Quantum Computer

January 2020 · SSRN Electronic Journal

Vasil Dinev Penchev

Natural argument 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 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 ... [Show full abstract] 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. Keywords: Infinite Computation, Quantum Computer, Quantum Turing Machine, Quantum Entanglement, Qubit, Natural Argument