Hostname: page-component-8448b6f56d-t5pn6 Total loading time: 0 Render date: 2024-04-24T09:19:35.406Z Has data issue: false hasContentIssue false

Quantum robot: structure, algorithms and applications

Published online by Cambridge University Press:  21 February 2006

Daoyi Dong
Affiliation:
Department of Automation, University of Science and Technology of China, Hefei, Anhui, 230027 (P. R. China) E-mail: chenz@ustc.edu.cn
Chunlin Chen
Affiliation:
Department of Automation, University of Science and Technology of China, Hefei, Anhui, 230027 (P. R. China) E-mail: chenz@ustc.edu.cn
Chenbin Zhang
Affiliation:
Department of Automation, University of Science and Technology of China, Hefei, Anhui, 230027 (P. R. China) E-mail: chenz@ustc.edu.cn
Zonghai Chen
Affiliation:
Department of Automation, University of Science and Technology of China, Hefei, Anhui, 230027 (P. R. China) E-mail: chenz@ustc.edu.cn

Abstract

A brand-new paradigm of robots–quantum robots–is proposed through the fusion of quantum theory with robot technology. A quantum robot is essentially a complex quantum system which generally consists of three fundamental components: multi-quantum computing units (MQCU), quantum controller/actuator, and information acquisition units. Corresponding to the system structure, several learning control algorithms, including quantum searching algorithms and quantum reinforcement learning algorithms, are presented for quantum robots. The theoretical results show that quantum robots using quantum searching algorithms can reduce the complexity of the search problem from O($N^2)$ in classical robots to O($N\sqrt N)$. Simulation results demonstrate that quantum robots are also superior to classical robots in efficient learning under novel quantum reinforcement learning algorithms. Considering the advantages of quantum robots, some important potential applications are also analyzed and prospected.

Type
Article
Copyright
2006 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)