Quantum Robots for Teenagers

Raghuvanshi, Arushi; Fan, Yuancheng; Woyke, M.; Perkowski, Marek

doi:10.1109/ismvl.2007.46

Cited by 21 publications

(20 citation statements)

References 1 publication

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This type of synthesis problem has application in robotics [24], [25], [26]. The desired function is specified by a truth table with don't cares and symbolic quantum states such as V 0 = V |0 and V 1 = V |1 which lead to known probabilities of observation of the output under certain measurement operators [18].…”

Section: Discussionmentioning

confidence: 99%

Evolutionary approach to quantum symbolic logic synthesis

Lukáč

Perkowski

2008

2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence)

Self Cite

View full text Add to dashboard Cite

In this paper we present an evolutionary approach to the quantum symbolic logic synthesis that was introduced in [1]. We use a Genetic Algorithm to synthesize quantum circuits from examples, allowing to synthesize functions that are both completely and incompletely specified. The symbolic synthesis is implemented in the GA so as to verify our approach. The Occam Razor principle, fundamental to inductive learning as well as to logic synthesis, is satisfied in this approach by seeking circuits of reduced complexity. The GA is tested on a set of benchmark functions representing single output quantum circuits as well as multiple entangled-qubit state generators.

show abstract

Section: Discussionmentioning

confidence: 99%

Evolutionary approach to quantum symbolic logic synthesis

Lukáč

Perkowski

2008

2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence)

Self Cite

View full text Add to dashboard Cite

show abstract

“…However, it is not far away from now that robots controlled by quantum processors are going to come in handy in research and commercial world on a regular basis. Those kind of robots will be able to use the resource of entanglement, superposition principle of quantum mechanics [5], violation of Bell's inequality [6] and will open a new horizon of robotics technology and their ability [5].…”

Section: Introductionmentioning

confidence: 99%

“…The first idea of theoretical quantum robot was introduced by Benioff [3, 7] on a strictly quantum world. Then Raghuvanshi et al [5] showed some practical examples of quantum controlled robots which used the idea of Braitenberg vehicles [8]. They used classical sensors and classical motors with a quantum circuit (or it can be thought like a quantum brain) that decides the movement of the quantum vehicle [9].…”

Section: Introductionmentioning

confidence: 99%

Quantum robots can fly; play games: an IBM quantum experience

Mahanti

Das

Behera

et al. 2019

Quantum Inf Process

View full text Add to dashboard Cite

Quantum Robot is an excellent future application that can be achieved with the help of a quantum computer. As a practical example, quantum controlled Braitenberg vehicles proposed by Raghuvanshi et al. [Proceedings of the 37th International Symposium on Multiple-Valued Logic (2007)] is a mobile quantum system and hence acts as a quantum robot. Braitenberg vehicles are simple circuit robots which can experience natural behaviours like fear, aggression and love etc. These robots can be controlled by quantum circuits incorporating quantum principles such as entanglement and superposition. Complex behaviours can be mimicked by a quantum circuit that can be implemented in a quantum robot. Here we investigate the scheme of Raghuvanshi et al. and propose a new quantum circuit to make the quantum robot fly. We demonstrate one of its application in playing a game. The quantum robot we present here shows the behaviour of 'fear' and its movement is deterministic in nature. This phenomenon can be successfully modelled in a game,

show abstract

“…If, in contrast, the quantum robots interact with a non-quantum environment, then they are considered as quantum-controlled mobile robots. According to Perkowski, these robots are such that "their controls are quantum but sensors and effectors are classical" (Raghuvanshi, et al, 2007). In the other words, in the quantum-controlled mobile robot, the input data obtained by classical (non-quantum) sensors are processed by the use of quantum-mechanical methods, and the results are output to classical (non-quantum) effectors.…”

Section: Introductionmentioning

confidence: 99%

Navigation of Quantum-Controlled Mobile Robots

Kagan¹,

Ben‐Gal²

2011

Recent Advances in Mobile Robotics

View full text Add to dashboard Cite

Recent Advances in Mobile Robotics 312 quantum mechanics (Ballentine, 2006); for a complete review of quantum computation and information theory, see, e.g., (Nielsen & Chuang, 2000). Basic notation and properties of quantum-mechanical systemsIn general, in the considerations of the finite quantum-mechanical systems, it is postulated (Ballentine, 2006) with the unit sum of the diagonal elements, ( ) tr 1 σ = ; and that the observed value of the quantum-mechanical system is specified by the eigenvalues of the matrix σ . Since matrix σ is Hermitial, its eigenvalues are real numbers. If matrix σ is diagonal, then such a representation of the state is equivalent to the representation of the state of stochastic classical system, in which diagonal elements jj σ form a probability vector (Holevo, 2001 From such a property of observation, it follows that in contrast to the classical systems, the actual state of the quantum-mechanical system obtains a value, which was measured by the observer, and further evolution of the system starts from this value. In the other words, the evolution the quantum-mechanical system depends on the fact of its observation. www.intechopen.com Navigation of Quantum-Controlled Mobile Robots 313An actual evolution of the quantum-mechanical system is governed by the evolution operators, which are applied to the state matrix σ or state vector s . Below, we consider the states and operators, which are used in quantum information theory. Concepts of the quantum information theoryThe elementary state, which is considered in quantum information theory (Nielsen & Chuang, 2000), is called qubit (quantum bit) and is represented by a two-element complex vector , which correspond to the bit values "0" and "1" known in classical information theory (Cover & Thomas, 1991). In general, vectors 0 and 1 determine the states "spin up" and "spin down" of electron, i.e. 0" " ≡ ↑ and 1" " ≡ ↓ . 12" " =⋅ → −⋅ ← , the pairs of the vectors 0 a n d 1, a n d "" → and "" ← can be used interchangeably.In general, the evolution of the qubits is governed by the use of the following operators: The Pauli operators are the most known qubits operators that are in use in general quantum mechanics, while the other three operators are more specific for quantum information theory. According to the Kitaev-Solovey theorem (Nielsen & Chuang, 2000), an algebra, which consists of the qubits 0 and 1 , and CNOT, Hadamard and phase shift operators, forms a universal algebra that models any operation of the Boolean algebra :The other types of the qubit gates, e.g. phase shift operator S and its derivatives, cannot be represented by the classical operators and require quantum computing devices. In such computing, it is assumed that each matrix operation is conducted in one computation step providing a power of quantum computing. The indicated dependence of quantum states on the observation process allows an implementation of such operations by the use of adaptive computation schemes. Below, we demonstrate a relation between quantum operati...

show abstract

Quantum Robots for Teenagers

Cited by 21 publications

References 1 publication

Evolutionary approach to quantum symbolic logic synthesis

Evolutionary approach to quantum symbolic logic synthesis

Quantum robots can fly; play games: an IBM quantum experience

Navigation of Quantum-Controlled Mobile Robots

Contact Info

Product

Resources

About