ArticlePDF Available

# Quantum mechanical Hamiltonian models of Turing machines

Authors:

## Abstract

Quantum mechanical Hamiltonian models, which represent an aribtrary but finite number of steps of any Turing machine computation, are constructed here on a finite lattice of spin-1/2 systems. Different regions of the lattice correspond to different components of the Turing machine (plus recording system). Successive states of any machine computation are represented in the model by spin configuration states. Both time-independent and time-dependent Hamiltonian models are constructed here. The time-independent models do not dissipate energy or degrade the system state as they evolve. They operate close to the quantum limit in that the total system energy uncertainty/computation speed is close to the limit given by the time-energy uncertainty relation. However, the model evolution is time global and the Hamiltonian is more complex. The time-dependent models do not degrade the system state. Also they are time local and the Hamiltonian is less complex.
A preview of the PDF is not available
... Since Benioff proposed the concept of quantum Turing machine [1,2] in 1980, many researchers have paid attention to quantum algorithms. In 1985, Deutsch realized the first algorithm for quantum Turing machine to solve Deutsch's problem [3]. ...
... Given the set X {0, 1, 2, 3} and Z {1, 2, 3, 4, 5, 6}, we have 24 permutations 0 2 , where i j, i 7− j and i, j ∈ Z . We list 24 permutations π 12 , π 13 , . . . ...
Article
Full-text available
In this paper, we propose a novel quantum algorithm, based on the Bernstein–Vazirani algorithm, for finding $$a$$ if the function $$f\left( x \right) = a \cdot {\uppi }\left( x \right)$$, where $$a,x \in \left\{ {0,1} \right\}^{2}$$ and $${\uppi }\left( x \right)$$ is a 2-bit permutation function. Note that the Bernstein–Vazirani algorithm cannot find $$a$$ when we select the function $$f\left( x \right) = a \cdot {\uppi }\left( x \right)$$, where $${\uppi }\left( x \right) = \left( {\begin{array}{*{20}c} {\begin{array}{*{20}c} 0 & 1 \\ \end{array} } & {\begin{array}{*{20}c} 2 & 3 \\ \end{array} } \\ {\begin{array}{*{20}c} 2 & 0 \\ \end{array} } & {\begin{array}{*{20}c} 1 & 3 \\ \end{array} } \\ \end{array} } \right)$$. Our algorithm can be further applied to Nagata et al.’s problem. Our algorithm will output $$g\left( {A_{1} } \right)$$ and $$g\left( {A_{0} } \right)$$ if the function $$f\left( x \right) = \left( {g\left( {A_{1} } \right)g\left( {A_{0} } \right)} \right)_{2} \cdot {\uppi }\left( x \right)$$, where $$A_{1}$$, $$A_{0} \in \left\{ {0,1} \right\}^{m}$$, $$x \in \left\{ {0,1} \right\}^{2}$$ and $$g: \left\{ {0, 1} \right\}^{m} \to \left\{ {0, 1} \right\}.$$
... Feynman's idea was to bring the phenomena of the "new" physics (quantum mechanics) into the world of classical computer science to exponentially increase the computational capacity of classical computers. Many articles followed his path, in which an automatic system based on quantum formalism is rigorously formulated ( [6], [12], [7]) such as Quantistic Touring Machine (QTM), which is the quantum evolution of the classical Turing Machine. As a result, a new computational complexity theory based on the new quantum formalism emerges in these articles, where new complexity classes of problems are introduced. ...
... Quantum technologies are based on solid theoretical underpinnings in both physics and mathematics. Yuri Manin [7] and Paul Benioff [8] first proposed the notion of employing quantum systems as computing devices in the 1980s, although they conducted their research separately. Richard Feynman [9] famously expounded on this subject in 1982. ...
Article
Full-text available
The perception that mathematics is difficult has always persisted. Nevertheless, mathematics is such an essential component of STEM education. Quantum technologies are already having enormous effects on our society, with advantages seen across a broad variety of industries, including finance, aerospace, and energy. These innovations promise to transform our lives. Managers in the business and public sectors will need to learn quantum computing. Quantum algorithmic literacy may help increase mathematical understanding and enthusiasm. The current paper proposes that one possible approach is to present the information in a reasonably gentle but intelligible way, in order to excite individuals with the mathematics that they already know by extending them to acquiring quantum algorithmic literacy. A gentle introduction to the mathematics required to model quantum computing ideas, including linear transformations and matrix algebra, will be given. Quantum entanglement, linear transformations, quantum cryptography, and quantum teleportation will be used as examples to illustrate the usefulness of basic mathematical concepts in formulating quantum algorithms. These exemplars in quantum algorithmic literacy can help to invigorate people’s interest in mathematics. Additionally, a qualitative comparative analysis (QCA) framework is provided that teachers can utilize to determine which students to approach for remediation. This assists the teachers in dispelling any pupils’ uncertainty about mathematical concepts.
... The interest for quantum computing never ceased to grow since the 1970's. The early motivation was the generalisation of Turing machines for quantum systems [1,2]. Since then, quantum computing has evolved and became an entire and promising science on its own. ...
Article
Full-text available
Quantum computing has emerged over the past decades as a promising field. While its theoretical foundations are solid and well-known, its practical implementation is challenging. Roughly, quantum computing relies on two objects: qubits and quantum gates. A quantum gate is no more than an element of U(N). In practice, it is impossible to implement an arbitrary quantum gate. Modern quantum computers can only implement a finite set of quantum gates. This raises the question on how to decompose any quantum gate as a finite product of elements of a subset of U(N). Any such sets is called universal for quantum computing. In this paper, we show two results. The first one is that the set {CNOT, single-qubit gates} is exactly universal in the sense that any U ∈ U(N) can be exactly written as the product of CNOT and single-qubit gates. Then, we will show that any unitary matrix can be approximated by a finite product of elements of the discrete set {CNOT,H,T}.
... Ao contrário da informação clássica, codificada em bits 0 ou 1, a informação quântica permite a superposição de estados, o bit quântico, também chamado de qubit [3,4]. Trabalhos tais como os de Benioff [5,6] propondo uma versão quântica da máquina de Turing, de Feynman [7] indagando sobre os simuladores quânticos, e de Deutsch [8] que construiu uma situação matemática onde as características próprias dos sistemas quânticos foram usadas explicitamente para resolver um problema com funções binárias, generalizando a pedra fundamental da computação para o regime quântico, tivemos o primeiro vislumbre do poder de um computador quântico. Em paralelo, o pioneirismo de Bennett e Brassard ao proporem a criptografia quântica [9], e a descoberta da não-clonagem quântica por Wootters e Zurek [10], trouxeram à tona possibilidades antes impossíveis no limite clássico. ...
Preprint
Full-text available
Previously only considered a frontier area of Physics, nowadays quantum computing is one of the fastest growing research field, precisely because of its technological applications in optimization problems, machine learning, information security and simulations. The goal of this article is to introduce its readers to the fundamentals of quantum computing, focusing on a promising quantum algorithm and its application to a financial market problem. More specifically, we discuss the portfolio optimization problem using the Quantum Approximate Optimization Algorithm (QAOA). We not only describe the main concepts involved but also consider simple practical examples, involving financial assets available on the Brazilian stock exchange, with codes, both classic and quantum, freely available as a Jupyter Notebook. We also analyze in details the quality of the combinatorial portfolio optimization solutions through QAOA using SENAI CIMATEC's ATOS QLM quantum simulator.
... Cette prédiction a amené la sphère scientifiqueà soulever la question suivante : que se passe-t-il lorsque la physique classiqueéchoueà décrire un ordinateur et que cette dernière est remplacée par la physique quantique ? Les discussions concernant la possibilité de concevoir un ordinateur gourverné par les lois quantiques ont débuté en 1982, lorsque Benioff a montré comment certains systèmes quantiques dépendants du temps pouvaient simuler de manière efficace les ordinateurs classiques opérantà l'aide de la logique booléenne [Benioff, 1982]. Parallèlement, Feynman s'est posé -au cours de la même année -la question opposée : est-ce qu'un ordinateur classique peut simuler efficacement un système quantique ? ...
Thesis
Mon projet de thèse intitulé « de la logique à la physique » a pour but général de montrer que le calcul qui est effectué par les ordinateurs ne forme pas seulement une branche de la logique mais doit être également étudié au sein des sciences physiques. Plus précisément, mon travail réside dans l'analyse logique de la notion de calcul proposée par Alan Turing en 1936. Cette analyse logique se fonde sur le modèle mathématique des ordinateurs actuels appelé « machine de Turing » . La machine de Turing est un modèle de calcul qui permet d'identifier les possibilités et les limites théoriques des ordinateurs indépendamment des ressources physiques. Ainsi l'étude des ordinateurs qui ont pour fonction principale de calculer peut-elle se faire directement à partir du modèle mathématique de la machine de Turing. Cette correspondance entre l'ordinateur et la Machine de Turing a eu pour conséquence que les limites des ordinateurs sont surtout étudiés indépendamment de leur nature physique. Et dans cette optique, la machine de Turing est le « mètre-étalon » du calcul, c'est une notion mathématique suffisante pour étudier les limites du calcul des ordinateurs. Un certain nombre de recherches menées depuis quelques années laissent cependant envisager que la structure physique des ordinateurs joue un rôle essentiel dans leur fonctionnement. De telles recherches pourraient permettre de fonder une critique de l'étude purement mathématique du calcul. Plus précisément, l'objet central de ces recherches est l'étude de « l'hyper-calcul », concept né en 1999 désignant le calcul qui dépasse les limites de la machine de Turing. Autrement dit, si de nos jours les limites de la machine de Turing sont considérées comme les limites du calcul, l'hyper-calcul renvoit quant à lui à l'affirmation qu'il serait possible de calculer « plus » que la machine de Turing; et c'est justement de la physique que proviendraient de telles possibilités.
Article
Full-text available
In this paper a microscopic quantum mechanical model of computers as represented by Turing machines is constructed. It is shown that for each numberN and Turing machineQ there exists a HamiltonianH N Q and a class of appropriate initial states such that if c is such an initial state, then Q N (t)=exp(–1H N Q t) Q N (0) correctly describes at timest 3,t 6,,t 3N model states that correspond to the completion of the first, second, , Nth computation step ofQ. The model parameters can be adjusted so that for an arbitrary time interval aroundt 3,t 6,,t 3N, the machine part of Q N (t) is stationary.
Article
Here the results of other work on quantum mechanical Hamiltonian models of Turing machines are extended to include any discrete process T on a countably infinite set A. The models are constructed here by use of scattering phase shifts from successive scatterers to turn on successive step interactions. Also a locality requirement is imposed. The construction is done by first associating with each process T a model quantum system M with associated Hilbert space HM and step operator UT. Since UT is not unitary in general, M, HM, and UT are extended into a (continuous time) Hamiltonian model on a larger space which satisfies the locality requirement. The construction is compared with the minimal unitary dilation of UT. It is seen that the model constructed here is larger than the minimal one. However, the minimal one does not satisfy the locality requirement.
Article
It is shown that the laws of physics impose no fundamental bound on the rate at which information can be processed. Recent claims that quantum effects impose such bounds are discussed and shown to be erroneous.
Article
From thermodynamic and causality considerations a general upper bound on the rate at which information can be transferred in terms of the message energy is inferred. This bound is consistent with Shannon's bounds for a band-limited channel. It prescribes the minimum energy cost for information transferred over a given time interval. As an application, a fundamental upper bound of 1015 operations/sec on the speed of an ideal digital computer is established.
Article
The effect of the quantum nature of matter on the maximum informationprocesssing potentialities is considered. It is shown that the degeneracy of the energy levels of a physical information-processing system results in the fact that a universal limit of information-processing rates does not exist, though for any specific system this rate is indeed bounded. A physical interpretation is then proposed for an elementary act of information-processing and the concept of information-processing depth is introduced. The example of a system of quantum oscillators is used to show that the maximal information-processing depth is bounded, only a very small fraction of the possible system states being used. The effect of thermal noise on information processing is briefly discussed.
Article
Reversible computation is briefly reviewed, utilizing a refined version of the Bennett-Fredkin-Turing machine, invoked in an earlier paper. A dissipationless classical version of this machine, which has no internal frietion, and where the computational velocity is determined by the initial kinetic energy, is also described. Such a machine requires perfect parts and also requires the unrealisstic assumption that the many extraneous degrees of freedom, which contribute to the physical structure, do not couple to the information-bearing degrees of freedom, and thus cause no friction Quantum mechanical computation is discussed at two levels. First of all we deplore the assertion. repcatedly found in the literature, that the uncertainty principle. Eth, with t equated to a switching time, yields any information about energydissipation. Similarly we point out that computation is not an iterated transmission and receiving process, and that considerations, which avoid the uncertainty principle, and instead use quantum mechanical channel capacity considerations, are equally unfounded. At a more constructive level we ask whether there is a quantum mechanical version of the dissipationless computer. Benioff has proposed one possible answer Quantum mechanical versions of dissipationless computers may suffer from the problems found in electron transport in disordered one-dimensional periodic potentials. The buildup of internal reflections may give a transmission coefficient. through the whole computation, which decreases exponentially with the length of the computation.
Article
Any computerM is subject to such laws as irreversibility and uncertainty of time-energy and maximality of the speed of light. This imposes fundamental limitations on the performance ofM and, more generally, on the power of algorithmic methods for several important logic operations; this also has an impact on the problem of what is knowable in mathematics. Ogni computerM è sottoposto a leggi quali l’irreversibilità e l’incertezza del tempoenergia, nonchè la massimalità della velocità della luce. Tutto ciò impone delle limitazioni di carattere fondamentale sulle prestazioni diM e più in generale sulle possibilità dei metodi algoritmici di certe operazioni logiche connaturate col metodo matematico deduttivo. Любое вычислительное устройствоM подчиняется таким законам, как необратимость и неопределенность времени и знергии и максимальность скорости света. Эти законы налагают фундаментальные ограничения на вьшолнение вычисленийM и, более того, на возможности алгоритмических методов для некоторых важных логических операций.
Article
Fundamental limitations on the energy dissipated during one elementary logical operation are discussed. A model of a real physical device (parametric quantron) based on the Josephson effect in superconductors is used throughout the discussion. This device is shown to be physically reversible, and moreover it can serve as the clementary cell of a logically reversible computer, both these properties being necessary to achieve the fundamental limits of energy dissipation. These limits due to classical and quantum statistics are shown to lie well below the earlier estimates,k B T and , respectively.