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

電子情報通信学会誌

Quantum Complexity Theory and Quantum Algorithm

R. Hayakawa, Tomoyuki Morimae

Published Nov 1, 2021• 0 citations
OpenAlex

Related papers

Quantum algorithms, quantum field theory, and computational complexity

Keith S. M. Lee

Bulletin of the American Physical Society•Mar 3, 2015•0 citations

Quantum Algorithms and Complexity: An Information Theory Perspective

Umesh V. Vazirani

•Oct 2, 2002•0 citations

Quantum Complexity Theory for Algorithm Design

Jincheng Zhang

Quantum Complexity Theory (QCT) offers a novel framework for algorithm design, predicated on the principle that certain computational problems exhibit inherent quantum complexity. This paper explores the application of QCT to identify problems with a significantly enhanced computational advantage when tackled using quantum algorithms. We argue that by leveraging the unique properties of quantum mechanics, we can potentially develop algorithms that outperform their classical counterparts in solving complex problems, demonstrating a paradigm shift in algorithmic design. This work lays the foundation for a new area of research with significant implications for the future of computational science and engineering.

•Sep 4, 2026•0 citations

Computational complexity and applications of quantum algorithm

Satoshi Iriyama, Makoto Ohya

Applied Mathematics and Computation•Jun 24, 2011•2 citations

Entropy and algorithmic complexity in quantum information theory

Fabio Benatti

Natural Computing•Dec 7, 2006•8 citations

Explaining the Implicit Parallelism of Genetic Algorithm and Computational Complexity by Quantum Theory

Peng Wang

Superposition principle of quantum theory is introduced in this paper. The genetic algorithm has been described by quantum superposition theory. It implies genetic algorithm is essentially a kind of quantum algorithm in the classical computer on the reduced order to achieve. It through genetic manipulation to input superposition states data into classical computer. In the evolutionary process, a lot of implicit modes have been measured, so as to realize the parallel search and processing in the model space. It is implicit parallelism of genetic algorithm. The quantum theory can also be used to analyze the problem¿s computational complexity. Quantum superposition theory and entropy are used to get the problem¿s lower bound of computational complexity. Using this method the problem¿s lower bound of computational complexity is only decided by itself. It is independent of the algorithm¿s details.

International Symposium on Computer Science and Computational Technology•Jan 1, 2008•3 citations
Quantum Complexity Theory (QCT) offers a novel framework for algorithm design, predicated on the principle that certain computational problems exhibit inherent quantum complexity. This paper explores the application of QCT to identify problems with a significantly enhanced computational advantage when tackled using quantum algorithms. We argue that by leveraging the unique properties of quantum mechanics, we can potentially develop algorithms that outperform their classical counterparts in solving complex problems, demonstrating a paradigm shift in algorithmic design. This work lays the foundation for a new area of research with significant implications for the future of computational science and engineering.
Superposition principle of quantum theory is introduced in this paper. The genetic algorithm has been described by quantum superposition theory. It implies genetic algorithm is essentially a kind of quantum algorithm in the classical computer on the reduced order to achieve. It through genetic manipulation to input superposition states data into classical computer. In the evolutionary process, a lot of implicit modes have been measured, so as to realize the parallel search and processing in the model space. It is implicit parallelism of genetic algorithm. The quantum theory can also be used to analyze the problem¿s computational complexity. Quantum superposition theory and entropy are used to get the problem¿s lower bound of computational complexity. Using this method the problem¿s lower bound of computational complexity is only decided by itself. It is independent of the algorithm¿s details.