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

Elsevier eBooks

The Q Machine

Robert W. Motley

Published Jan 1, 1975• 75 citations
Publisher
DOI
10.1016/b978-0-12-508650-9.50006-0

Related papers

Simulations of Quantum Turing Machines by Quantum Multi-Stack Machines

Daowen Qiu

As was well known, in classical computation, Turing machines, circuits, multi-stack machines, and multi-counter machines are equivalent, that is, they can simulate each other in polynomial time. In quantum computation, Yao [11] first proved that for any quantum Turing machines $M$, there exists quantum Boolean circuit $(n,t)$-simulating $M$, where $n$ denotes the length of input strings, and $t$ is the number of move steps before machine stopping. However, the simulations of quantum Turing machines by quantum multi-stack machines and quantum multi-counter machines have not been considered, and quantum multi-stack machines have not been established, either. Though quantum counter machines were dealt with by Kravtsev [6] and Yamasaki {\it et al.} [10], in which the machines count with $0,\pm 1$ only, we sense that it is difficult to simulate quantum Turing machines in terms of this fashion of quantum computing devices, and we therefore prove that the quantum multi-counter machines allowed to count with $0,\pm 1,\pm 2,...,\pm n$ for some $n>1$ can efficiently simulate quantum Turing machines. Therefore, our mail goals are to establish quantum multi-stack machines and quantum multi-counter machines with counts $0,\pm 1,\pm 2,...,\pm n$ and $n>1$, and particularly to simulate quantum Turing machines by these quantum computing devices.

arXiv:quant-ph/0501176•Jan 30, 2005•4 citations

Constructing a Q Machine

Robert W. Motley

Elsevier eBooks•Jan 1, 1975•1 citation

Further Applications of the Q Machine

Robert W. Motley

Elsevier eBooks•Jan 1, 1975•0 citations

A Generalized Deletion Machine

Indranil Chakrabarty, Satyabrata Adhikari

In this work we prescribe a more generalized quantum-deleting machine (input state dependent). The fidelity of deletion is dependent on some machine parameters such that on alteration of machine parameters we get back to standard deleting machines. We also carried out a various comparative study of various kinds of quantum deleting machines. We also plotted graphs, making a comparative study of fidelity of deletion of the deletion machines, obtained as particular cases on changing the machine parameters of our machine.

arXiv:quant-ph/0511211•Nov 22, 2005•1 citation

Deletion of imperfect cloned copies

Satyabrata Adhikari, Binayak Samadder Choudhury

In this work, we design a deleting machine and show that, for some given condition on machine parameters, it gives a slightly better result than the Pati–Braunstein (PB) deleting machine (2000 Nature 404 164, 2001 Preprint quant-ph/0007121). Also it is shown that for some particular values of the machine parameters it acts like the PB deleting machine. We also study the combined effect of a cloning and deleting machine, where first the cloning is done by some standard cloning machines such as Wootters–Zurek (1982 Nature 299 802) and Buzek–Hillery (1996 Phys. Rev. A 54 1844) cloning machines and then the copy mode is deleted by the PB deleting machine or our prescribed deleting machine. We then examine the distortion of the input state and the fidelity of deletion.

arXiv:quant-ph/0508083•Journal of Physics A Mathematical and General•Nov 25, 2004•7 citations

Q-Computation

Lajos Diósi

Lecture notes in physics•Jan 1, 2011•1 citation
As was well known, in classical computation, Turing machines, circuits, multi-stack machines, and multi-counter machines are equivalent, that is, they can simulate each other in polynomial time. In quantum computation, Yao [11] first proved that for any quantum Turing machines MMM, there exists quantum Boolean circuit (n,t)(n,t)(n,t)-simulating MMM, where nnn denotes the length of input strings, and ttt is the number of move steps before machine stopping. However, the simulations of quantum Turing machines by quantum multi-stack machines and quantum multi-counter machines have not been considered, and quantum multi-stack machines have not been established, either. Though quantum counter machines were dealt with by Kravtsev [6] and Yamasaki {\it et al.} [10], in which the machines count with 0,±10,\pm 10,±1 only, we sense that it is difficult to simulate quantum Turing machines in terms of this fashion of quantum computing devices, and we therefore prove that the quantum multi-counter machines allowed to count with 0,±1,±2,...,±n0,\pm 1,\pm 2,...,\pm n0,±1,±2,...,±n for some n>1n>1n>1 can efficiently simulate quantum Turing machines. Therefore, our mail goals are to establish quantum multi-stack machines and quantum multi-counter machines with counts 0,±1,±2,...,±n0,\pm 1,\pm 2,...,\pm n0,±1,±2,...,±n and n>1n>1n>1, and particularly to simulate quantum Turing machines by these quantum computing devices.
In this work we prescribe a more generalized quantum-deleting machine (input state dependent). The fidelity of deletion is dependent on some machine parameters such that on alteration of machine parameters we get back to standard deleting machines. We also carried out a various comparative study of various kinds of quantum deleting machines. We also plotted graphs, making a comparative study of fidelity of deletion of the deletion machines, obtained as particular cases on changing the machine parameters of our machine.
In this work, we design a deleting machine and show that, for some given condition on machine parameters, it gives a slightly better result than the Pati–Braunstein (PB) deleting machine (2000 Nature 404 164, 2001 Preprint quant-ph/0007121). Also it is shown that for some particular values of the machine parameters it acts like the PB deleting machine. We also study the combined effect of a cloning and deleting machine, where first the cloning is done by some standard cloning machines such as Wootters–Zurek (1982 Nature 299 802) and Buzek–Hillery (1996 Phys. Rev. A 54 1844) cloning machines and then the copy mode is deleted by the PB deleting machine or our prescribed deleting machine. We then examine the distortion of the input state and the fidelity of deletion.