RNA-2QCFA: Evolving Two-way Quantum Finite Automata with Classical States for RNA Secondary Structures
Amandeep Singh Bhatia, Shenggen Zheng

TL;DR
This paper introduces RNA-2QCFA, a quantum automaton model that effectively simulates and analyzes RNA secondary structures, bridging quantum computing and biological modeling.
Contribution
It presents a novel quantum automaton model combining classical states for RNA structure analysis, advancing computational methods in bioinformatics.
Findings
RNA-2QCFA can recognize RNA secondary structures efficiently.
Quantum automata outperform classical probabilistic models in this context.
The approach offers new insights into RNA structure modeling.
Abstract
Recently, the use of mathematical methods and computer science applications have got significant response among biochemists and biologists to modeling the biological systems. The computational and mathematical methods have enormous potential for modeling the deoxyribonucleic acid (DNA) and ribonucleic acid (RNA) structures. The modeling of DNA and RNA secondary structures using automata theory had a significant impact in the fields of computer science. It is a natural goal to model the RNA secondary biomolecular structures using quantum computational models. Two-way quantum finite automata with classical states are more dominant than two-way probabilistic finite automata in language recognition. The main objective of this paper is on using two-way quantum finite automata with classical states to simulate, model and analyze the ribonucleic acid (RNA) sequences.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDNA and Biological Computing · Quantum-Dot Cellular Automata · Quantum Computing Algorithms and Architecture
