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

Neurophysiology

Quantum analysis of postsynaptic potentials

Leon L. Voronin

Published Sep 1, 1979• 13 citations
Publisher
DOI
10.1007/bf01063001

Related papers

Quantum mechanics of synapses

Steven J. Burden, Ronald D.G. McKay

Cell•Oct 1, 1990•5 citations

基于量子算法的混沌系统稳定性分析

Jincheng Zhang

This paper investigates the stability of chaotic systems using a novel quantum algorithm designed to enhance analysis and potentially unlock new insights into their behavior. We explore the application of quantum mechanics to address challenges inherent in traditional methods, focusing on the potential for faster convergence and more precise identification of critical points. The core mechanism centers around quantum entanglement and superposition, utilized to model and analyze the system's dynamics with unprecedented fidelity. The analysis aims to provide a fundamentally new approach to understanding and predicting the stability of chaotic systems, potentially leading to breakthroughs in fields like fluid dynamics, climate modeling, and complex systems analysis. This study presents a preliminary framework demonstrating the potential for quantum-enhanced stability analysis, with a focus on identifying and quantifying key parameters that govern chaotic behavior.

•Sep 1, 2026•0 citations

A Novel Quantum Genetic Algorithm Based on Potential

Xiao Lei Li, Fei Meng

Considering different quantum bit having different effective intensity in chromosome evolution, a novel quantum genetic algorithm based on potential is proposed. It makes the magnitude of rotation angle depending on the potential of a quantum bit. It generates the orientation of rotation angle according to the total potential of quantum bit in the chromosome. The character of quantum entangled interference based on potential is introduced. And convergence analysis and rationality analysis are implemented. Experimental test shows that, it can obtain better convergence rate and have less runtime on smaller population size and shorter chromosome length.

Advanced materials research•Jun 1, 2012•0 citations

A quantum model of biological neurons

Lei Lyu, Chen Pang, Jihua Wang

Neurocomputing•Jul 18, 2024•8 citations

Quantum Computing for Feature Model Analysis: Potentials and Challenges

Domenik Eichhorn, Tobias Pett, Tobias J. Osborne +1 more

Feature modeling is a technique to model the variability of configurable systems. When working with feature models, it is possible to analyze them, for instance, by counting the number of valid configurations, searching feature model anomalies, or creating samples of configurations for testing. Classical feature model analysis techniques are based on solving algorithmic problems such as boolean satisfiability, satisfiability modulo theories, or integer linear programming. Existing analysis approaches provide satisfactory solutions for small and medium-sized problem instances, but scaling issues are observed for large-sized feature models. Quantum computers provide up to superpolynomial speedups for specific algorithmic problems and have the potential to solve those scaling issues. This paper analyzes the algorithmic techniques used in classical product line analysis and identifies potentials and challenges for quantum speedups. Our findings show that quantum algorithms like QAOA and Grover have the potential to speed up SAT and ILP-based feature model analysis techniques, but only after additional improvements in quantum hardware have been made.

International Software Product Line Conference (SPLC)•Aug 25, 2023•1 citation

Quantum Mechanics of Biological Systems

Mohammad Ashrafuzzaman, Jack A. Tuszyński

CRC Press eBooks•Oct 21, 2025•0 citations
This paper investigates the stability of chaotic systems using a novel quantum algorithm designed to enhance analysis and potentially unlock new insights into their behavior. We explore the application of quantum mechanics to address challenges inherent in traditional methods, focusing on the potential for faster convergence and more precise identification of critical points. The core mechanism centers around quantum entanglement and superposition, utilized to model and analyze the system's dynamics with unprecedented fidelity. The analysis aims to provide a fundamentally new approach to understanding and predicting the stability of chaotic systems, potentially leading to breakthroughs in fields like fluid dynamics, climate modeling, and complex systems analysis. This study presents a preliminary framework demonstrating the potential for quantum-enhanced stability analysis, with a focus on identifying and quantifying key parameters that govern chaotic behavior.
Considering different quantum bit having different effective intensity in chromosome evolution, a novel quantum genetic algorithm based on potential is proposed. It makes the magnitude of rotation angle depending on the potential of a quantum bit. It generates the orientation of rotation angle according to the total potential of quantum bit in the chromosome. The character of quantum entangled interference based on potential is introduced. And convergence analysis and rationality analysis are implemented. Experimental test shows that, it can obtain better convergence rate and have less runtime on smaller population size and shorter chromosome length.
Feature modeling is a technique to model the variability of configurable systems. When working with feature models, it is possible to analyze them, for instance, by counting the number of valid configurations, searching feature model anomalies, or creating samples of configurations for testing. Classical feature model analysis techniques are based on solving algorithmic problems such as boolean satisfiability, satisfiability modulo theories, or integer linear programming. Existing analysis approaches provide satisfactory solutions for small and medium-sized problem instances, but scaling issues are observed for large-sized feature models. Quantum computers provide up to superpolynomial speedups for specific algorithmic problems and have the potential to solve those scaling issues. This paper analyzes the algorithmic techniques used in classical product line analysis and identifies potentials and challenges for quantum speedups. Our findings show that quantum algorithms like QAOA and Grover have the potential to speed up SAT and ILP-based feature model analysis techniques, but only after additional improvements in quantum hardware have been made.