Abstract
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. (in: 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. 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 applications 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, where it can always avoid accident. The proposed quantum circuit is designed in IBM quantum experience describing the above protocol.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Avoid common mistakes on your manuscript.
1 Introduction
The compelling application of quantum-enabled technology predicts the dominance of quantum computers over the world in the near future [1]. Quantum computers can be used in the area of robotics [2] which is gradually becoming one of the major focuses of quantum computation and quantum information. A quantum robot is a mobile quantum system equipped with a quantum computer and ancilla system [3]. Its major goal consists of specific changes in the state of the environment and to do measurement on it. Quantum robotics is currently drawing attention rapidly in the past few years. The main aim of quantum robotics is to apply quantum mechanics, quantum computation and quantum algorithms in the study of robotics. On the other hand, the application of robotics and engineering principles can be used to develop quantum computers and implement it as well [4]. A beautiful yet strange domain of quantum information and quantum computation is stretching its wings in the premise of commercialization. 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 kinds 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].
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]. For a binary input with only two possible situations, the quantum circuit used there would determine the movement of the robot probabilistically and had three degrees of freedom in general such as moving to right, left and straight, while in this present work, we add one more degree of freedom to the robot as it can fly and would deterministically select its path. We use light with particular intensity and two different input states correspond to whether light is falling on the sensors or not.
We design a quantum circuit and simulate it by using IBM Quantum Experience. Recently, IBM has developed different types of prototypes of quantum processors and they are available by a free web based interface called IBM Quantum Experience (IBM QE). Researchers have taken a proper advantage of it by demonstrating and running a variety of quantum computing experiments, e.g. [10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29]. Here, we use IBM’s 5-qubit quantum processor, ‘ibmqx4’ to design the quantum circuit and perform the experiment by simulating it. We verify the new protocol of quantum robot and illustrate its application in a game.
The paper is organized as follows. Section 2 discusses the theoretical scheme of a Braitenberg vehicle in brief. Sections 3 and 4 focus on the quantum-controlled circuit and how it simulates the behaviour of the robot deterministically. Section 5 explicates an application of quantum robot in a game, where our robot is a perfect winner. Finally, we conclude the paper in Sect. 6 by providing its future implications and applications.
2 The classical Braitenberg vehicle
The revolutionary and striking idea behind Braitenberg vehicles [8] is that with only simple circuit structure some mixed and complex behaviour can be shown. A schematic diagram of a simple Braitenberg vehicle is depicted in Fig. 1.
As observed from Fig. 1, the two light sensors, S1 and S2, are directly connected with the two motors, M1 and M2, respectively. The mechanism is such that if a light sensor senses some light, then the motor connected to it starts and in the absence of light, the motor turns off. When the robot is exposed to high light intensity, both the motor is turned on, and as a result, the robot moves forward at full speed. In the case when only the left light sensor, S1, senses some light, only the left motor, M1, starts and the motor moves towards right-hand side. The same goes for the case of light coming from right-hand side in which case the motor turns to the left. This behaviour of the robot can be interpreted as ‘fear’ or ‘shyness’. In our work, we have added one more degree of freedom to the simple Braitenberg vehicle. We present a vehicle that has two light sensors (S1 and S2) attached with it and two motors (M1 and M2) which are connected to the sensors as depicted in Fig. 2. However, here we have used another additional motor, M3, which makes the robot fly in certain situation. The design of the quantum circuit is such that it deterministically controls the behaviour of these kind of vehicles. The schematic diagram of our quantum-controlled Braitenberg vehicle is illustrated in Fig. 2.
3 The quantum scheme
The robot designed here has three motors, M1, M2 and M3, and two sensors, S1 and S2. We are denoting \(|0\rangle \) as light is not falling on sensors, and \(|1\rangle \) as light is falling on the sensors. The two motors (M1 and M2) of robot are connected directly to the two sensors (S1 and S2) as shown in Fig. 2. We introduce a third motor, M3, that is attached with a propeller, P, overhead of the vehicle. When the third motor (M3) is active, the vehicle takes off from the ground. The rest of its actions are same as the classical model discussed earlier in Sect. 2. All the motors (M1, M2 and M3) used in this robot have binary output as \(|0\rangle \) and \(|1\rangle \). Here \(|0\rangle \) denotes that the motor is not moving, and \(|1\rangle \) denotes that the motor is moving. We design a quantum circuit such that when the input of both the sensors (S1 and S2) is \(|00\rangle \), the output of motors (M1 and M2) is \(|11\rangle \) that implies the robot moves forward. When the input of both the sensors (S1 and S2) is \(|01\rangle \), then the output is \(|01\rangle \) that means the right motor (M2) runs and the left motor (M1) remains off, so that the robot can take a turn towards the left and the robot turns away from the source. When the input of both the sensors (S1 and S2) is \(|10\rangle \), then the output is \(|10\rangle \) and similarly, it avoids closeness to the source. When the input of both the sensors (S1 and S2) is \(|11\rangle \), the output is \(|00\rangle \), and in this situation the third motor starts and the robot takes a flight. The details of the movement of the robot are tabulated in Table 1.
4 The quantum circuit
4.1 Working and decomposition of two-control-two-target Toffoli (\(C^{2}(X_{3}X_{4})\)) gate
The working of two-control-two-target Toffoli gate \(C^{2}(X_{3}X_{4})\) is described as follows. There are two control qubits and two NOT operations in \(C^{2}(X_{3}X_{4})\) gate. A four-qubit quantum state is taken as an input. The gate flips both the third and fourth qubits of the state only in case when the first two qubits are in \(|11\rangle \) state; otherwise, there is no change in the output state. The decomposition of \(C^{2}(X_{3}X_{4})\) is illustrated in Fig. 3. Two Toffoli gates (\(C^{2}(X_{3})\) and \(C^{2}(X_{4})\)) are used to design the above quantum gate.
4.2 Circuit diagram
Here we use IBM Quantum Experience’s 5-qubit quantum chip, ‘ibmqx4’ for performing the experiment. The first two qubits, q[0] and q[1] (see Figs. 4 and 5), represent the ancillary qubits, and the last three qubits, q[2], q[3] and q[4] correspond to three motors M1, M2 and M3, respectively.
-
If the input is \(|00\rangle \), then the initial state of the whole system is \(|00000\rangle \). After the action of two CNOT gates on two ancilla qubits (q[0] and q[1]), the output becomes \(|00000\rangle \). Then the two-control-two-target Toffoli gate with the controlled qubits (q[0] and q[1]) as \(|11\rangle \) followed by a two-anticontrol-two-target Toffoli gate with controlled qubits (q[0] and q[1]) \(|00\rangle \) acts on the input qubits (q[2] and q[3]) and the state of the whole system becomes \(|00110\rangle \). Finally, a Toffoli gate with two-anticontrol qubits (q[2] and q[3]) operates on the three qubits (q[2], q[3] and q[4]) connected to the motors (M1, M2 and M3), and hence, the system’s state is changed to \(|00110\rangle \). Then measurement along the Z-basis on the last three qubits (q[2], q[3] and q[4]) gives the result as 1, 1 and 0 for motors M1, M2 and M3, respectively. Thus, both the motors (M1 and M2) connected with wheels (W1 and W2) start and the quantum robot moves forward, while the third motor (M3) remains inactive.
-
Similarly for the input \(|01\rangle \), the initial state of the whole system is \(|00010\rangle \). In a similar manner by action of gates, it can be seen that the final state of the system remains \(|01010\rangle \). Then measurement along the Z-basis on the last three qubits (q[2], q[3] and q[4]) gives the result as 0, 1 and 0 for motors M1, M2 and M3, respectively. Hence, only the motor connected with the right wheel (W2) starts and the quantum robot takes a left turn.
-
With the input state \(|10\rangle \), then the initial state of the whole system is \(|00100\rangle \) and the final state becomes \(|10100\rangle \). Then measurement along the Z-basis on the last three qubits (q[2], q[3] and q[4]) gives the result as 1, 0 and 0 for motors M1, M2 and M3, respectively. Hence, only the motor (M1) connected with the left wheel (W1) starts and the quantum robot turns right.
-
The interesting case happens for the input \(|11\rangle \). Then the initial state of the whole system is \(|00110\rangle \), and the system’s state is finally changed into \(|11001\rangle \). Then measurement along the Z-basis on the last three qubits (q[2], q[3] and q[4]) gives the result as 0, 0 and 1 for motors M1, M2 and M3, respectively. Here both the motors (M1 and M2) connected with wheels (W1 and W2) remain turned off but the third motor (M3) becomes active now, and the robot takes off from the ground.
4.3 Simulation of the circuit diagram
We constructed our quantum circuit in IBM Quantum Experience using the quantum gates such as CNOT, Hadamard \((H), X, T, T^{\dagger }, S, S^{\dagger }\). Since two-controlled-two-target Toffoli gates do not have a standard notation in IBM Q Experience, they are constructed by using standard gates such as Hadamard, \(X, T, T^{\dagger }, S, S^{\dagger }\). The result of our simulation is presented in Fig. 5.
5 Application of quantum robot in a game
The model of quantum robot introduced here has an advantage over a simple game. Its schematic diagram is presented in Fig. 6. Following are the two assumptions to play the game.
-
This is a four-lane road where there is no divider in between them. The robot spreads over two lanes, and it is always in motion with a constant speed. The motors M1 and M2 of the robot are designed such that they help it to change lane upon receiving proper signals.
-
There are various other obstacles (which sends some kind of light signals) moving on only the two terminal tracks named as Track 1 and Track 2 (see Fig. 7). They move randomly on both ways up or down, but all of them have same uniform speed with respect to the robot. There is one starting point and one finishing line.
The rule of the game is described as follows. The quantum robot has to cover the distance upto the finishing line without touching any of the obstacles. Here we use the same kind of robot, but it would have four sensors (S1a, S1b, S2a and S2b), and each couple of sensors on one side would be connected through an OR gate to the input of that side of the vehicle. If from any side there is some obstacle, the input to the circuit will be \(|1\rangle \). If the right motor turns on, the robot will shift a lane towards the left and vice versa. While both the motors are turned on, the robot remains still. When obstacles are coming from both the tracks, then the third motor (M3) connected to propeller helps the robot to take off from the ground. Now in this hypothetical construction of a game, our robot will always win it. The condition of winning is apparent from Table 1 that represents the motion of the robot in different scenarios.
6 Conclusion
To conclude we have demonstrated here a quantum algorithm for a quantum Braitenberg vehicle, where one more motor has been added that enables the vehicle to fly. A new quantum circuit has been proposed to manipulate the behaviour of the quantum robot and has been simulated using the IBM Q Experience platform. Furthermore, the concept of quantum robot proposed here has been applied to a simple game to avoid accident in the game. Advancement in the area of robotics is one of the major concerns of scientists since the very beginning of technological development [2]. When it comes to quantum robot, its importance grows much more because of various surprising and strange new phenomena operating in the quantum domain. Benioff’s [3] idea of quantum robot has been applied in our physical world to make a quantum robot and now the challenge is to extend its ability and versatility. Our goal of this project is to cultivate the ideas further to have a quantum emotional robot in near future. The construction of robot with quantum brain explains well how a quantum system is interacting with the surroundings and other quantum phenomena [3]. In future quantum technology, a quantum computer can be used for various purposes like robot action planning, problem solving and vision [5] to perform significantly faster than any modern robotics technology.
References
Nieslsen, M., Chuang, I.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)
Craig, J.J.: Introduction to Robotics: Mechanics and Control, 3rd edn. Pearson Education International, Upper Saddle River (2004)
Benioff, P.: Quantum robots and environments. Phys. Rev. A 58, 893 (1998)
Quantum Robotics Group.: https://sites.google.com/site/quantumroboticsreadinggroup/home
Raghuvanshi, A., Fan, Y., Woyke, M., Perkowski, M.: Quantum robots for teenagers. In: Proceedings of the 37th International Symposium on Multiple-Valued Logic, 13–16 May 2007
Weihs, G., Jennewein, T., Simon, C., Weinfurter, H., Zeilinger, A.: Violation of Bell’s inequality under strict Einstein locality conditions. Phys. Rev. Lett. 81, 5039 (1998)
Benioff, P.: Space searches with a quantum robot. In: (ed.) Lomonaco, S.J. Jr., Howard D. Brandt, H.D. (eds.) Contemporary Mathematics, AMS, as a special session about Quantum Computation and Information, vol. 305, pp. 1–12. Washington, D.C (2002)
Braitenberg, V.: Vehicles: Experiments in Synthetic Psychology, Reprint edn. MIT Press, Cambridge (1986)
Raghuvanshi, A.: Drive kinematics in quantum Braitenberg vehicles. Report (2006)
Aggarwal, D., Raj, S., Behera, B.K., Panigrahi, P.K.: Application of quantum scrambling in Rydberg atom on IBM quantum computer. arXiv:1806.00781
Srinivasan, K., Satyajit, S., Behera, B.K., Panigrahi, P.K.: Efficient quantum algorithm for solving travelling salesman problem: an IBM quantum experience. arXiv:1805.10928
Dash, A., Rout, S., Behera, B.K., Panigrahi, P.K.: arXiv:1710.05196
Vishnu, P.K., Joy, D., Behera, B.K., Panigrahi, P.K.: Experimental demonstration of non-local controlled-unitary quantum gates using a five-qubit quantum computer. Quantum Inf. Process. 17, 274 (2018)
Satyajit, S., Srinivasan, K., Behera, B.K., Panigrahi, P.K.: Nondestructive discrimination of a new family of highly entangled states in IBM quantum computer. Quantum Inf. Process. 17, 212 (2018)
Roy, S., Behera, B.K., Panigrahi, P.K.: Experimental realization of quantum violation of entropic noncontextual inequality in four dimension using IBM quantum computer. arXiv:1710.10717
Gangopadhyay, S., Manabputra, Behera, B.K., Panigrahi, P.K.: Generalization and demonstration of an entanglement-based Deutsch–Jozsa-like algorithm using a 5-qubit quantum computer. Quantum Inf. Process. 17, 160 (2018)
Behera, B.K., Seth, S., Das, A., Panigrahi, P.K.: Demonstration of entanglement purification and swapping protocol to design quantum repeater in IBM quantum computer. Quantum Inf. Process. 18, 108 (2019)
Jha, R., Das, D., Dash, A., Jayaraman, S., Behera, B.K., Panigrahi, P.K.: A novel quantum N-queens solver algorithm and its simulation and application to satellite communication using IBM quantum experience. arXiv:1806.10221
Dash, A., Sarmah, D., Behera, B.K., Panigrahi, P.K.: Exact search algorithm to factorize large biprimes and a triprime on IBM quantum computer. arXiv:1805.10478
Behera, B.K., Reza, T., Gupta, A., Panigrahi, P.K.: Designing quantum router in IBM quantum computer. arXiv:1803.06530
Srinivasan, K., Behera, B.K, Panigrahi, P.K.: Solving linear systems of equations by gaussian elimination method using Grover’s search algorithm: an IBM quantum experience. arXiv:1801.00778
Gurnani, K., Behera, B.K., Panigrahi, P.K.: Demonstration of optimal fixed-point quantum search algorithm in IBM quantum computer. arXiv:1712.10231
Harper, R., Flammia, S.: Fault tolerance in the IBM Q experience. arXiv:1806.02359
Hegade, N.N., Behera, B.K., Panigrahi, P.K.: Experimental demonstration of quantum tunneling in IBM quantum computer. arXiv:1712.07326
Kapil, M., Behera, B.K., Panigrahi, P.K.: Quantum simulation of Klein Gordon equation and observation of Klein paradox in IBM quantum computer. arXiv:1807.00521
Mohanta, Y., Abhishikth, D.S., Pruthvi, K., Kumar, V., Behera, B.K., Panigrahi, P.K.: Spin-Boson model to demonstrate quantum tunneling in biomolecules using IBM quantum computer. arXiv:1807.00323
Manabputra, Behera, B.K., Panigrahi, P.K.: A simulational model for witnessing quantum effects of gravity using IBM quantum computer. arXiv:1806.10229
Sisodia, M., Shukla, A., Pathak, A.: Experimental realization of nondestructive discrimination of Bell states using a five-qubit quantum computer. Phys. Lett. A 381, 3860 (2017)
Wootton, J.R., Loss, D.: Repetition code of 15 qubits. Phys. Rev. A 97, 052313 (2018)
Acknowledgements
S.D. and S.M. acknowledge the support of INSPIRE fellowship, awarded by the Department of Science and Technology, Government of India. B.K.B. acknowledges the support of Institute fellowship provided by IISER Kolkata. S.D. and S.M. acknowledge Indian Institute of Science Education and Research Kolkata for providing hospitality during which a part of this work was completed. We are extremely grateful to IBM quantum experience project. The discussions and opinions developed in this paper are only those of the authors and do not reflect the opinions of IBM or any of it’s employees.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Mahanti, S., Das, S., Behera, B.K. et al. Quantum robots can fly; play games: an IBM quantum experience. Quantum Inf Process 18, 219 (2019). https://doi.org/10.1007/s11128-019-2332-4
Received:
Accepted:
Published:
DOI: https://doi.org/10.1007/s11128-019-2332-4