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

arXiv:quant-ph/9706012

Quantum Robots and Quantum Computers

Paul A. Benioff

Published Jun 4, 1997• 7 citations
arXivHTMLPDF

Abstract

Validation of a presumably universal theory, such as quantum mechanics, requires a quantum mechanical description of systems that carry out theoretical calculations and experiments. The description of quantum computers is under active development. No description of systems to carry out experiments has been given. A small step in this direction is taken here by giving a description of quantum robots as mobile systems with on board quantum computers that interact with environments. Some properties of these systems are discussed. A specific model based on the literature descriptions of quantum Turing machines is presented.

DOI
10.48550/arxiv.quant-ph/9706012

Related papers

Quantum Robots

Paul A. Benioff

Validation of a presumably universal theory, such as quantum mechanics, requires a quantum mechanical description of systems that carry out theoretical calculations and sytems that carry out experiments. The description of quantum computers is under active development. No description of systems to carry out experiments has been given. A very small step in this direction is taken here by giving a description of quantum robots as mobile systems with on board quantum computers that interact with environments of quantum systems. The dynamics of these systems are described in terms of tasks that consist of sequences of computation and action phases. For each task a step operator is defined which can then be used to define finite time interval step dynamics or a task Hamiltonian. A specific task carried out on a very simple environment is used to illustrate the models.

CRC Press eBooks•Nov 15, 2018•3 citations

Quantum robots and environments

Paul A. Benioff

Quantum robots and their interactions with environments of quantum systems are described, and their study justified. A quantum robot is a mobile quantum system that includes an on-board quantum computer and needed ancillary systems. Quantum robots carry out tasks whose goals include specified changes in the state of the environment, or carrying out measurements on the environment. Each task is a sequence of alternating computation and action phases. Computation phase activites include determination of the action to be carried out in the next phase, and recording of information on neighborhood environmental system states. Action phase activities include motion of the quantum robot and changes in the neighborhood environment system states. Models of quantum robots and their interactions with environments are described using discrete space and time. A unitary step operator $T$ that gives the single time step dynamics is associated with each task. ${T=T}_{a}{+T}_{c}$ is a sum of action phase and computation phase step operators. Conditions that ${T}_{a}$ and ${T}_{c}$ should satisfy are given along with a description of the evolution as a sum over paths of completed phase input and output states. A simple example of a task---carrying out a measurement on a very simple environment---is analyzed in detail. A decision tree for the task is presented and discussed in terms of the sums over phase paths. It is seen that no definite times or durations are associated with the phase steps in the tree, and that the tree describes the successive phase steps in each path in the sum over phase paths.

arXiv:quant-ph/9802067•Physical Review A•Aug 1, 1998•88 citations

Quantum Robots Plus Environments

Paul A. Benioff

A quantum robot is a mobile quantum system, including an on board quantum computer and needed ancillary systems, that interacts with an arbitrary environment of quantum systems. Quantum robots carry out tasks whose goals include carrying out measurements or physical experiments on the environment. A dynamical model of quantum robots and their interactions is discussed in which each task, as a sequence of alternating computation and action phases, is described by a unitary single time step operator T=T a +T c (discrete space and time are assumed). The overall system dynamics is described as a sum over paths of completed computation (T c ) and action (T a ) phases. A simple example of a task, measuring the distance between the quantum robot and a particle on a 1D lattice with quantum phase path dispersion present, is analyzed.

arXiv:quant-ph/9807032•Kluwer Academic Publishers eBooks•Dec 19, 2005•4 citations

Quantum finite automata: survey, status and research directions

Amandeep Singh Bhatia, Ajay Kumar

Quantum computing is concerned with computer technology based on the principles of quantum mechanics, with operations performed at the quantum level. Quantum computational models make it possible to analyze the resources required for computations. Quantum automata can be classified thusly: quantum finite automata, quantum sequential machine, quantum pushdown automata, quantum Turing machine and orthomodular lattice-valued automata. These models are useful for determining the expressive power and boundaries of various computational features. In light of the current state of quantum computation theory research, a systematic review of the literature seems timely. This article seeks to provide a comprehensive and systematic analysis of quantum finite automata models, quantum finite automata models with density operators and quantum finite automata models with classical states, interactive proof systems, quantum communication complexity and query complexity as described in the literature. The statistics of quantum finite automata related papers are shown and open problems are identified for more advanced research. The current status of quantum automata theory is distributed into various categories. This research work also highlights the previous research, current status and future directions of quantum automata models.

arXiv:1901.07992•Jan 23, 2019•9 citations

On capabilities of quantum-mechanical computer models

Svetomir Simonović

The work includes the analyses of the theoretical capabilities of quantum-mechanical versus classical computer models in terms of their universality, their application domain, their efficacy in solving the problems and their technological feasibility. The concepts of deterministic Turing machine, probabilistic Turing machine and quantum-mechanical Turing machine are exposed. The concept of basic information unit of quantum-mechanical computer modelqubit is introduced and the qubit is represented through the use of Bloch sphere. The use of Dirac's bra-ket notation in description of quantum-mechanical state is explained, and the notation is used to form state equation of a quantummechanical Turing machine cell. Especially, consequences of quantum parallelism, quantum interference and wave function collapse are studied in respect to capabilities of quantum-mechanical computer models. The interrelationship between classes of problems that can be efficiently solved by quantum mechanical and/or classical computer models is displayed.

Tehnika•Jan 1, 2022•1 citation

Quantum Computers: A Review on its Working Mechanism, Uses and Developments

Shrikara R. M, Raghavendra. C. V, Manila S Koddaddi

Over the past several decades, quantum information science has emerged to seek answers to the question: can we gain some advantage by storing, transmitting and processing information encoded in systems that exhibit unique quantum properties? Today it is understood that the answer is yes, and many research groups around the world are working towards the highly ambitious technological goal of building a quantum computer, which would dramatically improve computational power for particular tasks. A number of physical systems, spanning much of modern physics, are being developed for quantum computation. However, it remains unclear which technology, if any, will ultimately prove successful. Here we describe the latest developments for each of the leading approaches and explain the major challenges for the future. This review outlines the principles of operation of quantum computers and their elements. The theory of ideal computers that do not interact with the environment and are immune to quantum decohering processes is presented. Decohering processes in quantum computers are investigated. The review considers methods for correcting quantum computing errors arising from the decoherence of the state of the quantum computer, as well as possible methods for the suppression of the decohering processes. A brief enumeration of proposed quantum computer realizations concludes the review.

International Journal of Advanced Research in Science Communication and Technology•Nov 24, 2021•0 citations
Validation of a presumably universal theory, such as quantum mechanics, requires a quantum mechanical description of systems that carry out theoretical calculations and experiments. The description of quantum computers is under active development. No description of systems to carry out experiments has been given. A small step in this direction is taken here by giving a description of quantum robots as mobile systems with on board quantum computers that interact with environments. Some properties of these systems are discussed. A specific model based on the literature descriptions of quantum Turing machines is presented.
Validation of a presumably universal theory, such as quantum mechanics, requires a quantum mechanical description of systems that carry out theoretical calculations and sytems that carry out experiments. The description of quantum computers is under active development. No description of systems to carry out experiments has been given. A very small step in this direction is taken here by giving a description of quantum robots as mobile systems with on board quantum computers that interact with environments of quantum systems. The dynamics of these systems are described in terms of tasks that consist of sequences of computation and action phases. For each task a step operator is defined which can then be used to define finite time interval step dynamics or a task Hamiltonian. A specific task carried out on a very simple environment is used to illustrate the models.
Quantum robots and their interactions with environments of quantum systems are described, and their study justified. A quantum robot is a mobile quantum system that includes an on-board quantum computer and needed ancillary systems. Quantum robots carry out tasks whose goals include specified changes in the state of the environment, or carrying out measurements on the environment. Each task is a sequence of alternating computation and action phases. Computation phase activites include determination of the action to be carried out in the next phase, and recording of information on neighborhood environmental system states. Action phase activities include motion of the quantum robot and changes in the neighborhood environment system states. Models of quantum robots and their interactions with environments are described using discrete space and time. A unitary step operator TTT that gives the single time step dynamics is associated with each task. T=Ta+Tc{T=T}_{a}{+T}_{c}T=Ta​+Tc​ is a sum of action phase and computation phase step operators. Conditions that Ta{T}_{a}Ta​ and Tc{T}_{c}Tc​ should satisfy are given along with a description of the evolution as a sum over paths of completed phase input and output states. A simple example of a task---carrying out a measurement on a very simple environment---is analyzed in detail. A decision tree for the task is presented and discussed in terms of the sums over phase paths. It is seen that no definite times or durations are associated with the phase steps in the tree, and that the tree describes the successive phase steps in each path in the sum over phase paths.
A quantum robot is a mobile quantum system, including an on board quantum computer and needed ancillary systems, that interacts with an arbitrary environment of quantum systems. Quantum robots carry out tasks whose goals include carrying out measurements or physical experiments on the environment. A dynamical model of quantum robots and their interactions is discussed in which each task, as a sequence of alternating computation and action phases, is described by a unitary single time step operator T=T a +T c (discrete space and time are assumed). The overall system dynamics is described as a sum over paths of completed computation (T c ) and action (T a ) phases. A simple example of a task, measuring the distance between the quantum robot and a particle on a 1D lattice with quantum phase path dispersion present, is analyzed.
Quantum computing is concerned with computer technology based on the principles of quantum mechanics, with operations performed at the quantum level. Quantum computational models make it possible to analyze the resources required for computations. Quantum automata can be classified thusly: quantum finite automata, quantum sequential machine, quantum pushdown automata, quantum Turing machine and orthomodular lattice-valued automata. These models are useful for determining the expressive power and boundaries of various computational features. In light of the current state of quantum computation theory research, a systematic review of the literature seems timely. This article seeks to provide a comprehensive and systematic analysis of quantum finite automata models, quantum finite automata models with density operators and quantum finite automata models with classical states, interactive proof systems, quantum communication complexity and query complexity as described in the literature. The statistics of quantum finite automata related papers are shown and open problems are identified for more advanced research. The current status of quantum automata theory is distributed into various categories. This research work also highlights the previous research, current status and future directions of quantum automata models.
The work includes the analyses of the theoretical capabilities of quantum-mechanical versus classical computer models in terms of their universality, their application domain, their efficacy in solving the problems and their technological feasibility. The concepts of deterministic Turing machine, probabilistic Turing machine and quantum-mechanical Turing machine are exposed. The concept of basic information unit of quantum-mechanical computer modelqubit is introduced and the qubit is represented through the use of Bloch sphere. The use of Dirac's bra-ket notation in description of quantum-mechanical state is explained, and the notation is used to form state equation of a quantummechanical Turing machine cell. Especially, consequences of quantum parallelism, quantum interference and wave function collapse are studied in respect to capabilities of quantum-mechanical computer models. The interrelationship between classes of problems that can be efficiently solved by quantum mechanical and/or classical computer models is displayed.
Over the past several decades, quantum information science has emerged to seek answers to the question: can we gain some advantage by storing, transmitting and processing information encoded in systems that exhibit unique quantum properties? Today it is understood that the answer is yes, and many research groups around the world are working towards the highly ambitious technological goal of building a quantum computer, which would dramatically improve computational power for particular tasks. A number of physical systems, spanning much of modern physics, are being developed for quantum computation. However, it remains unclear which technology, if any, will ultimately prove successful. Here we describe the latest developments for each of the leading approaches and explain the major challenges for the future. This review outlines the principles of operation of quantum computers and their elements. The theory of ideal computers that do not interact with the environment and are immune to quantum decohering processes is presented. Decohering processes in quantum computers are investigated. The review considers methods for correcting quantum computing errors arising from the decoherence of the state of the quantum computer, as well as possible methods for the suppression of the decohering processes. A brief enumeration of proposed quantum computer realizations concludes the review.