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

Lecture notes in networks and systems

Exploring the Application of Quantum Search Algorithms in Symbolic Computation

Hiep L. Thi

Published Jan 1, 2025• 0 citations
Publisher
DOI
10.1007/978-981-97-9324-2_13

Related papers

Quantum-Enhanced Symbolic Regression

Jincheng Zhang

Symbolic regression is a powerful technique for automatically discovering mathematical equations from data. However, its performance is often limited by the computational cost of exploring the exponentially large space of possible equations. This paper presents a novel approach that integrates symbolic regression with quantum amplitude estimation (QAE) to accelerate the equation discovery process. The core idea is to utilize QAE to efficiently estimate the probability amplitude of different equation candidates, thereby reducing the search time. We formulate the symbolic regression problem as a quantum optimization task and demonstrate, through theoretical analysis and a conceptual framework, the potential for significant speedups. The proposed method addresses the inherent challenges of symbolic regression by exploiting the parallel processing capabilities of quantum computers. The results suggest that quantum-enhanced symbolic regression holds promise for tackling complex datasets and discovering intricate mathematical relationships that would be intractable for classical symbolic regression algorithms. The key contribution lies in the application of QAE within the symbolic regression framework, offering a pathway toward faster and more accurate equation modeling.

•Sep 3, 2026•0 citations

Quantum Search Algorithm and Its Applications

Weng-Long Chang, Athanasios V. Vasilakos

Studies in big data•Dec 21, 2020•0 citations

Quantum computing and quantum search algorithms

Zijian Diao, Goong Chen

•Jan 1, 2001•0 citations

Physical limits and information bounds of micro control. II. Quantum soft computing and quantum searching algorithms

S.V. Ulyanoy, Giovanni Degli Antoni, K. Yamafuji +3 more

Principles of quantum soft computing, models of fast quantum searching algorithms and the possibility of its applications for intelligent control of micro-systems are introduced. The description problem of searching and decision-making support processes from more fundamental mutual positions of the new information technologies and a modern physics, information physics, are discussed: (1) in the quantum information theory-the information complexity theory of random symbolic sequences, computation complexity, quantum searching algorithms; and (2) in the modern physics-nonequilibrium thermodynamics and quantum mechanics.

International Symposium on Micro-NanoMechatronics and Human Science•Nov 27, 2002•3 citations

SYMBOLIC MODELING OF THE QUANTUM GROVER SEARCH ALGORITHM ON TWO QUBITS: QUIRK + MAPLE

Gennady P. Chuiko

A symbolic model of the quantum Grover search algorithm for the simplest two-qubit systems is proposed, which simultaneously utilizes the capabilities of the Maple computer mathematics system and the Quirk quantum browser simulator. The model is developed with a focus on its application in engineering education for modern quantum computing courses. It enables generalization to systems with more qubits, as well as cases involving multiple target states. It can serve as a foundation for developing laboratory work. This model is among the first attempts to go beyond the limitations of Python-based quantum simulators. Maple, whose programming language is based on Java, interacts effectively with the Quirk quantum simulator, which is based on JavaScript. Keywords: Grover's quantum algorithm, Maple, Quirk, simulation of quantum algorithms, symbolic modeling.

Komp'ûternì sistemi ta merežì•Nov 18, 2025•0 citations

A review on quantum search algorithms

Pulak Ranjan Giri, V. E. Korepin

arXiv:1602.02730•Quantum Information Processing•Nov 13, 2017•94 citations
Symbolic regression is a powerful technique for automatically discovering mathematical equations from data. However, its performance is often limited by the computational cost of exploring the exponentially large space of possible equations. This paper presents a novel approach that integrates symbolic regression with quantum amplitude estimation (QAE) to accelerate the equation discovery process. The core idea is to utilize QAE to efficiently estimate the probability amplitude of different equation candidates, thereby reducing the search time. We formulate the symbolic regression problem as a quantum optimization task and demonstrate, through theoretical analysis and a conceptual framework, the potential for significant speedups. The proposed method addresses the inherent challenges of symbolic regression by exploiting the parallel processing capabilities of quantum computers. The results suggest that quantum-enhanced symbolic regression holds promise for tackling complex datasets and discovering intricate mathematical relationships that would be intractable for classical symbolic regression algorithms. The key contribution lies in the application of QAE within the symbolic regression framework, offering a pathway toward faster and more accurate equation modeling.
Principles of quantum soft computing, models of fast quantum searching algorithms and the possibility of its applications for intelligent control of micro-systems are introduced. The description problem of searching and decision-making support processes from more fundamental mutual positions of the new information technologies and a modern physics, information physics, are discussed: (1) in the quantum information theory-the information complexity theory of random symbolic sequences, computation complexity, quantum searching algorithms; and (2) in the modern physics-nonequilibrium thermodynamics and quantum mechanics.
A symbolic model of the quantum Grover search algorithm for the simplest two-qubit systems is proposed, which simultaneously utilizes the capabilities of the Maple computer mathematics system and the Quirk quantum browser simulator. The model is developed with a focus on its application in engineering education for modern quantum computing courses. It enables generalization to systems with more qubits, as well as cases involving multiple target states. It can serve as a foundation for developing laboratory work. This model is among the first attempts to go beyond the limitations of Python-based quantum simulators. Maple, whose programming language is based on Java, interacts effectively with the Quirk quantum simulator, which is based on JavaScript. Keywords: Grover's quantum algorithm, Maple, Quirk, simulation of quantum algorithms, symbolic modeling.