Quantum Computing: Fundamentals, Trends and Perspectives for Chemical and Biochemical Engineers

Nourbakhsh, Amirhossein; Jones, Mark Nicholas; Kristjuhan, Kaur; Carberry, Deborah; Karon, Jay; Beenfeldt, Christian; Shahriari, Kyarash; Andersson, Martin; Jadidi, Mojgan A.; Mansouri, Seyed Soheil

doi:10.48550/arxiv.2201.02823

Cited by 1 publication

(1 citation statement)

References 80 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Paul Benioff's idea for creating a computer using the principles of quantum physics was initially conceived in 1981 [67,68]. After that, in 1982, Sir Richard Feynman first demonstrated that fundamental computations could be performed on a quantum system [69][70][71]. The first universal quantum Turing machine (QTM) was proposed by David Deutsch in 1985 [72], which led to the development of Deutsch-Josza's oracle [72] and Simon's oracle [73] in 1992 and 1994, respectively.…”

Section: Quantum Computing Fundamentalsmentioning

confidence: 99%

A Review of Quantum-Inspired Metaheuristic Algorithms for Automatic Clustering

Dey¹,

Bhattacharyya

Dey³

et al. 2023

Mathematics

View full text Add to dashboard Cite

In real-world scenarios, identifying the optimal number of clusters in a dataset is a difficult task due to insufficient knowledge. Therefore, the indispensability of sophisticated automatic clustering algorithms for this purpose has been contemplated by some researchers. Several automatic clustering algorithms assisted by quantum-inspired metaheuristics have been developed in recent years. However, the literature lacks definitive documentation of the state-of-the-art quantum-inspired metaheuristic algorithms for automatically clustering datasets. This article presents a brief overview of the automatic clustering process to establish the importance of making the clustering process automatic. The fundamental concepts of the quantum computing paradigm are also presented to highlight the utility of quantum-inspired algorithms. This article thoroughly analyses some algorithms employed to address the automatic clustering of various datasets. The reviewed algorithms were classified according to their main sources of inspiration. In addition, some representative works of each classification were chosen from the existing works. Thirty-six such prominent algorithms were further critically analysed based on their aims, used mechanisms, data specifications, merits and demerits. Comparative results based on the performance and optimal computational time are also presented to critically analyse the reviewed algorithms. As such, this article promises to provide a detailed analysis of the state-of-the-art quantum-inspired metaheuristic algorithms, while highlighting their merits and demerits.

show abstract