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/9802067 · Physical Review A

Quantum robots and environments

Paul A. Benioff

Published Aug 1, 1998• 90 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1103/physreva.58.893

Related papers

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•5 citations

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

Space searches with a quantum robot

Paul A. Benioff

Quantum robots are described as mobile quantum computers and ancillary systems that move in and interact with arbitrary environments. Their dynamics is given as tasks which consist of sequences of alternating computation and action phases. A task example is considered in which a quantum robot searches a space region to find the location of a system. The possibility that the search can be more efficient than a classical search is examined by considering use of Grover's Algorithm to process the search results. For reversible searches this is problematic for two reasons. One is the removal of entanglements generated by the search process. The other is that even if the entanglement can be avoided, the search process in 2-D space regions is no more efficient than a classical search. However, quantum searches of space regions with 3 or more dimensions are more efficient than classical searches. Reasons why quantum robots are interesting independent of these results are briefly summarized.

arXiv:quant-ph/0003006•Contemporary mathematics - American Mathematical Society•Jan 1, 2002•76 citations

Quantum Robots and Quantum Computers

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 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.

arXiv:quant-ph/9706012•Jun 4, 1997•11 citations

A Quantum Planner for Robot Motion

Antonio Chella, Salvatore Gaglio, Giovanni Pilato +2 more

The possibility of integrating quantum computation in a traditional system appears to be a viable route to drastically improve the performance of systems endowed with artificial intelligence. An example of such processing consists of implementing a teleo-reactive system employing quantum computing. In this work, we considered the navigation of a robot in an environment where its decisions are drawn from a quantum algorithm. In particular, the behavior of a robot is formalized through a production system. It is used to describe the world, the actions it can perform, and the conditions of the robot’s behavior. According to the production rules, the planning of the robot activities is processed in a recognize–act cycle with a quantum rule processing algorithm. Such a system aims to achieve a significant computational speed-up.

Mathematics•Jul 16, 2022•23 citations

Quantum computation

This chapter introduces the basic principles of quantum computation. We shall adhere to the quantum circuit model of computation, with which it is easy to work and which is close to physical implementations. We shall not discuss the more abstract quantum Turing machine model, which, however, has been shown to be equivalent to the circuit model. The elementary unit of quantum information and the basic building block of quantum computation is the qubit, a two-level quantum system that can be prepared, manipulated and measured in a controlled way. A quantum computer can be seen as a collection of n qubits and therefore its wave function resides in a 2 n -dimensional complex Hilbert space. As far as coupling to the environment may be neglected, its evolution in time is unitary and governed by the Schrödinger equation. A quantum computation is composed of three basic steps: preparation of the input state, implementation of the desired unitary transformation acting on this state and measurement of the output state. The output of the measurement process is inherently probabilistic and the probabilities of the different possible outputs are set by the basic postulates of quantum mechanics. Therefore, in a quantum algorithm we must, in general, repeat several times the algorithm to obtain the correct solution of our problem with probability as close to one as desired. In this sense, quantum algorithms are analogous to classical probabilistic algorithms. However, the superposition principle and quantum entanglement open up new possibilities for computation. Quantum computers are potentially more powerful than classical (deterministic or probabilistic) computers due to quantum interference and entanglement. We show that, analogously to classical computation, there exists a small set of gates that are universal, that is, any unitary transformation can be decomposed into a sequence of these gates. We then discuss the implementation of the basic Boolean functions and arithmetic operations on a quantum computer.

WORLD SCIENTIFIC eBooks•Dec 1, 2018•0 citations
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.
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 are described as mobile quantum computers and ancillary systems that move in and interact with arbitrary environments. Their dynamics is given as tasks which consist of sequences of alternating computation and action phases. A task example is considered in which a quantum robot searches a space region to find the location of a system. The possibility that the search can be more efficient than a classical search is examined by considering use of Grover's Algorithm to process the search results. For reversible searches this is problematic for two reasons. One is the removal of entanglements generated by the search process. The other is that even if the entanglement can be avoided, the search process in 2-D space regions is no more efficient than a classical search. However, quantum searches of space regions with 3 or more dimensions are more efficient than classical searches. Reasons why quantum robots are interesting independent of these results are briefly summarized.
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.
The possibility of integrating quantum computation in a traditional system appears to be a viable route to drastically improve the performance of systems endowed with artificial intelligence. An example of such processing consists of implementing a teleo-reactive system employing quantum computing. In this work, we considered the navigation of a robot in an environment where its decisions are drawn from a quantum algorithm. In particular, the behavior of a robot is formalized through a production system. It is used to describe the world, the actions it can perform, and the conditions of the robot’s behavior. According to the production rules, the planning of the robot activities is processed in a recognize–act cycle with a quantum rule processing algorithm. Such a system aims to achieve a significant computational speed-up.
This chapter introduces the basic principles of quantum computation. We shall adhere to the quantum circuit model of computation, with which it is easy to work and which is close to physical implementations. We shall not discuss the more abstract quantum Turing machine model, which, however, has been shown to be equivalent to the circuit model. The elementary unit of quantum information and the basic building block of quantum computation is the qubit, a two-level quantum system that can be prepared, manipulated and measured in a controlled way. A quantum computer can be seen as a collection of n qubits and therefore its wave function resides in a 2 n -dimensional complex Hilbert space. As far as coupling to the environment may be neglected, its evolution in time is unitary and governed by the Schrödinger equation. A quantum computation is composed of three basic steps: preparation of the input state, implementation of the desired unitary transformation acting on this state and measurement of the output state. The output of the measurement process is inherently probabilistic and the probabilities of the different possible outputs are set by the basic postulates of quantum mechanics. Therefore, in a quantum algorithm we must, in general, repeat several times the algorithm to obtain the correct solution of our problem with probability as close to one as desired. In this sense, quantum algorithms are analogous to classical probabilistic algorithms. However, the superposition principle and quantum entanglement open up new possibilities for computation. Quantum computers are potentially more powerful than classical (deterministic or probabilistic) computers due to quantum interference and entanglement. We show that, analogously to classical computation, there exists a small set of gates that are universal, that is, any unitary transformation can be decomposed into a sequence of these gates. We then discuss the implementation of the basic Boolean functions and arithmetic operations on a quantum computer.