Quantum Computing

Ke-Lin Du () and M. N. S. Swamy ()
Additional contact information
Ke-Lin Du: Xonlink Inc
M. N. S. Swamy: Concordia University, Department of Electrical and Computer Engineering

Chapter Chapter 17 in Search and Optimization by Metaheuristics, 2016, pp 283-293 from Springer

Abstract: Abstract Quantum computing is inspired from the theory of quantum mechanics, which describes the behavior of particles of atomic size. Quantum computing is involved with the research on quantum computers and quantum algorithms. Quantum algorithms perform exponentially faster than any of the traditional algorithms [30]. Quantum computers were proposed in the 1980s [1, 6]. This chapter introduces some basic quantum computing algorithms and quantum-based hybrid metaheuristic algorithms.

Keywords: Quantum Algorithm; Quantum Circuit; Quantum Gate; Gravitational Search Algorithm; Toffoli Gate (search for similar items in EconPapers)
Date: 2016
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-319-41192-7_17

Ordering information: This item can be ordered from
http://www.springer.com/9783319411927

DOI: 10.1007/978-3-319-41192-7_17

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().