Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Applied Mathematics & Information Sciences

A Novel Algorithm based on Entanglement Measurement for Improving Speed of Quantum Algorithms

Mohammed Zidan, Abdel‐Haleem Abdel‐Aty, Ahmed Younes, Elnomery Allam Zanaty, Ibrahim Elkhayat, Mahmoud Abdel‐Aty

Published Jan 1, 2018• 53 citations
Publisher
DOI
10.18576/amis/120127

Related papers

High-Order Quantum Genetic Algorithm Based on Quantum Entanglement

Han Qi, Shuai Gong, Abdullah Gani +1 more

Quantum genetic algorithms(QGA) typically construct traditional quantum chromosomes as independent quantum bit systems, which has facilitated the enhancement of search speed and precision in genetic algorithms, demonstrating powerful problem-solving capabilities in optimization issues. Although traditional QGA have enriched population diversity, they still tend to fall into local optima, and the evolutionary update operations require rotation directions to be determined by lookup tables, a process involving multiple conditional judgments that affect algorithm efficiency. To address these issues, an improved method has been proposed to further enhance the performance of QGA. In the initial population selection, a population grouping evolution method based on microhabitat coevolution strategy is used to prevent the algorithm from getting trapped in local optima when solving complex function problems. Additionally, quantum entanglement is introduced on top of quantum super-position by implementing quantum entanglement using quantum registers, and higher-order quantum rotation gates are employed that do not involve multiple conditional judgments of lookup tables, thus improving the efficiency of quantum chromosome measurement and evolutionary updates. Finally, traditional QGA and higher-order quantum genetic algorithms were applied to test functions in multiple experiments. The results indicate that, compared to traditional QGA, the higher-order quantum genetic algorithms have achieved an increase in convergence speed, an approximate 14.3% improvement in convergence precision, and possess enhanced global search capabilities.

International Conference on Electronic Engineering and Informatics (EEI)•Jun 28, 2024•2 citations

Review on the study of entanglement in quantum computation speedup

Shengchao Ding, Zhi Hao Jin

Chinese Science Bulletin•Aug 1, 2007•56 citations

Adaptive recurrence quantum entanglement distillation for two-Kraus-operator channels

Liangzhong Ruan, Wenhan Dai, Moe Z. Win

Quantum entanglement serves as a valuable resource for many important quantum operations. A pair of entangled qubits can be shared between two agents by first preparing a maximally entangled qubit pair at one agent, and then sending one of the qubits to the other agent through a quantum channel. In this process, the deterioration of entanglement is inevitable since the noise inherent in the channel contaminates the qubit. To address this challenge, various quantum entanglement distillation (QED) algorithms have been developed. Among them, recurrence algorithms have advantages in terms of implementability and robustness. However, the efficiency of recurrence QED algorithms has not been investigated thoroughly in the literature. This paper puts forth two recurrence QED algorithms that adapt to the quantum channel to tackle the efficiency issue. The proposed algorithms have guaranteed convergence for quantum channels with two Kraus operators, which include phase-damping and amplitude-damping channels. Analytical results show that the convergence speed of these algorithms is improved from linear to quadratic and one of the algorithms achieves the optimal speed. Numerical results confirm that the proposed algorithms significantly improve the efficiency of QED.

arXiv:1706.07461•Physical Review A•May 29, 2018•39 citations

Entanglement and quantum computational speed-up

Guifré Vidal

Bulletin of the American Physical Society•Mar 23, 2005•0 citations

Theory of the Quantum Speed Up

Giuseppe Castagnoli, David Finkelstein

Insofar as quantum computation is faster than classical, it appears to be irreversible. In all quantum algorithms found so far the speed-up depends onthe extra-dynamical irreversible projection representing quantum measurement. Quantum measurement performs a computation that dynamical computation cannot accomplish as efficiently. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Kluwer Academic Publishers eBooks•Feb 24, 2006•3 citations

Quantum entanglement and quantum computational algorithms

Arvind

arXiv:quant-ph/0012116•Pramana•Feb 1, 2001•20 citations
Quantum genetic algorithms(QGA) typically construct traditional quantum chromosomes as independent quantum bit systems, which has facilitated the enhancement of search speed and precision in genetic algorithms, demonstrating powerful problem-solving capabilities in optimization issues. Although traditional QGA have enriched population diversity, they still tend to fall into local optima, and the evolutionary update operations require rotation directions to be determined by lookup tables, a process involving multiple conditional judgments that affect algorithm efficiency. To address these issues, an improved method has been proposed to further enhance the performance of QGA. In the initial population selection, a population grouping evolution method based on microhabitat coevolution strategy is used to prevent the algorithm from getting trapped in local optima when solving complex function problems. Additionally, quantum entanglement is introduced on top of quantum super-position by implementing quantum entanglement using quantum registers, and higher-order quantum rotation gates are employed that do not involve multiple conditional judgments of lookup tables, thus improving the efficiency of quantum chromosome measurement and evolutionary updates. Finally, traditional QGA and higher-order quantum genetic algorithms were applied to test functions in multiple experiments. The results indicate that, compared to traditional QGA, the higher-order quantum genetic algorithms have achieved an increase in convergence speed, an approximate 14.3% improvement in convergence precision, and possess enhanced global search capabilities.
Quantum entanglement serves as a valuable resource for many important quantum operations. A pair of entangled qubits can be shared between two agents by first preparing a maximally entangled qubit pair at one agent, and then sending one of the qubits to the other agent through a quantum channel. In this process, the deterioration of entanglement is inevitable since the noise inherent in the channel contaminates the qubit. To address this challenge, various quantum entanglement distillation (QED) algorithms have been developed. Among them, recurrence algorithms have advantages in terms of implementability and robustness. However, the efficiency of recurrence QED algorithms has not been investigated thoroughly in the literature. This paper puts forth two recurrence QED algorithms that adapt to the quantum channel to tackle the efficiency issue. The proposed algorithms have guaranteed convergence for quantum channels with two Kraus operators, which include phase-damping and amplitude-damping channels. Analytical results show that the convergence speed of these algorithms is improved from linear to quadratic and one of the algorithms achieves the optimal speed. Numerical results confirm that the proposed algorithms significantly improve the efficiency of QED.