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

International Mathematica Symposium (IMS)

Reversible Computation and a Toolkit for Quantum Turing Machine Simulation

Joachim Hertel

Published Jun 1, 2003• 0 citations
Publisher

Abstract

This talk begins with some background information on reversible computation from a Thermodynamics and Quantum Theory point of view, and then introduces a Mathematica® Package Quantum Turing Machine Simulator (QTS) that can serve as an educational tool to explore the principles of a reversible computational process within the context of Quantum Mechanics.

DOI
10.1142/9781848161313_0029

Related papers

Simple circuit simulations of classical and quantum Turing machines

Yuri G. Gurevich, Andreas R. Blass

We construct reversible Boolean circuits efficiently simulating reversible Turing machines. Both the circuits and the simulation proof are rather simple. Then we give a fairly straightforward generalization of the circuits and the simulation proof to the quantum case.

arXiv:2111.10830•Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences•Sep 1, 2022•5 citations

Quantum mechanical computation

James D. Brasher

The physics and the mathematics of computation are examined to provide a foundation and perspective for the investigation of the quantum mechanics of computation. Our purpose is to explore the fundamental limits and constraints imposed on computation by Nature through the laws of physics and the mathematics of computational complexity. Inasmuch as information storage and transmission are an integral part of computation, their physical bounds are considered. The computer is viewed both physically and mathematically as a dynamical system, and is depicted in terms of the basic Turing machine paradigm. Three fundamental classes of the Turing machine are defined; the deterministic, stochastic and quantum Turing machines. Hamiltonian models and physical realizations of quantum computing are described. Quantum computers can perform some tasks which have no classical analogue, but they cannot compute functions that are non-computable by classical means. Some classically intractable problems can be solved with quantum computers.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Mar 1, 1994•0 citations

Some relations between quantum Turing machines and Turing machines

Andrés Sicard, Mario E. Vélez

For quantum Turing machines we present three elements: Its components, its time evolution operator and its local transition function. The components are related with the components of deterministic Turing machines, the time evolution operator is related with the evolution of reversible Turing machines and the local transition function is related with the transition function of probabilistic and reversible Turing machines.

arXiv:quant-ph/9912012•Dec 3, 1999•0 citations

Simulating Quantum Turing Machine in Augmented Reality

Wanwan Li

As quantum computing theory is attracting attention from researchers nowadays, visualizing the quantum computing process is necessary for fundamental quantum computing education and research. Especially, connecting traditional computational theory with advanced quantum computing concepts is an extremely important step in learning and understanding quantum computing. In this paper, we propose a practical interactive interface for simulating Quantum Turing Machine (QTM) in Augmented Reality (AR) that combines the traditional Turing machine computational model with the quantum computing simulation. Through such an interface, users can use a C-like script to represent a QTM and simulate such QTM in an immersive augmented reality platform through the Vuforia AR engine. After validating our proposed QTM AR simulator through a series of experiments, we show the great potential to apply our QTM AR simulator to quantum computing education through an interactive visualization interface in augmented reality.

International Conference on Multimedia and Image Processing (ICMIP)•Apr 21, 2023•6 citations

What Exactly Are Quantum Computations? Classical and Quantum Turing Machines

María Luisa Dalla Chiara, Roberto Giuntini, Roberto Leporini +1 more

Trends in logic•Jan 1, 2018•2 citations

Guest Column: Quantum Finite Automata: From Theory to Practice

Carlo Mereghetti, Beatrice Palano

Quantum computing is a prolific research area, halfway between physics and computer science [27, 29, 52]. Most likely, its origins may be dated back to 70's, when some works on quantum information began to appear (see, e.g., [34, 37]). In early 80's, R.P. Feynman suggested that the computational power of quantum mechanical processes might be beyond that of traditional computation models [25]. Almost at the same time, P. Benioff already proved that such processes are at least as powerful as Turing machines [9]. In 1985, D. Deutsch [22] proposed the notion of a quantum Turing machine as a physically realizable model for a quantum computer. From the point of view of structural complexity, E. Bernstein and U. Vazirani introduced in [20] the class BQP of problems solvable in polynomial time on quantum Turing machines, focusing attention on relations with the corresponding deterministic and probabilistic classes P and BPP, respectively. Several works in the literature explored classical issues in complexity theory from the quantum paradigm perspective (see, e.g., [7, 60, 61]).

ACM SIGACT News•Oct 17, 2021•4 citations
This talk begins with some background information on reversible computation from a Thermodynamics and Quantum Theory point of view, and then introduces a Mathematica® Package Quantum Turing Machine Simulator (QTS) that can serve as an educational tool to explore the principles of a reversible computational process within the context of Quantum Mechanics.
The physics and the mathematics of computation are examined to provide a foundation and perspective for the investigation of the quantum mechanics of computation. Our purpose is to explore the fundamental limits and constraints imposed on computation by Nature through the laws of physics and the mathematics of computational complexity. Inasmuch as information storage and transmission are an integral part of computation, their physical bounds are considered. The computer is viewed both physically and mathematically as a dynamical system, and is depicted in terms of the basic Turing machine paradigm. Three fundamental classes of the Turing machine are defined; the deterministic, stochastic and quantum Turing machines. Hamiltonian models and physical realizations of quantum computing are described. Quantum computers can perform some tasks which have no classical analogue, but they cannot compute functions that are non-computable by classical means. Some classically intractable problems can be solved with quantum computers.
As quantum computing theory is attracting attention from researchers nowadays, visualizing the quantum computing process is necessary for fundamental quantum computing education and research. Especially, connecting traditional computational theory with advanced quantum computing concepts is an extremely important step in learning and understanding quantum computing. In this paper, we propose a practical interactive interface for simulating Quantum Turing Machine (QTM) in Augmented Reality (AR) that combines the traditional Turing machine computational model with the quantum computing simulation. Through such an interface, users can use a C-like script to represent a QTM and simulate such QTM in an immersive augmented reality platform through the Vuforia AR engine. After validating our proposed QTM AR simulator through a series of experiments, we show the great potential to apply our QTM AR simulator to quantum computing education through an interactive visualization interface in augmented reality.
Quantum computing is a prolific research area, halfway between physics and computer science [27, 29, 52]. Most likely, its origins may be dated back to 70's, when some works on quantum information began to appear (see, e.g., [34, 37]). In early 80's, R.P. Feynman suggested that the computational power of quantum mechanical processes might be beyond that of traditional computation models [25]. Almost at the same time, P. Benioff already proved that such processes are at least as powerful as Turing machines [9]. In 1985, D. Deutsch [22] proposed the notion of a quantum Turing machine as a physically realizable model for a quantum computer. From the point of view of structural complexity, E. Bernstein and U. Vazirani introduced in [20] the class BQP of problems solvable in polynomial time on quantum Turing machines, focusing attention on relations with the corresponding deterministic and probabilistic classes P and BPP, respectively. Several works in the literature explored classical issues in complexity theory from the quantum paradigm perspective (see, e.g., [7, 60, 61]).