Comparison of quantum simulators for variational quantum search: A benchmark study
M Soltaninia, J Zhan - arXiv preprint arXiv:2309.05924, 2023 - arxiv.org
Simulating quantum circuits using classical computers can accelerate the development and
validation of quantum algorithms. Our newly developed algorithm, variational quantum …
validation of quantum algorithms. Our newly developed algorithm, variational quantum …
Shallow Depth Factoring Based on Quantum Feasibility Labeling and Variational Quantum Search
Large integer factorization is a prominent research challenge, particularly in the context of
quantum computing. This holds significant importance, especially in information security that …
quantum computing. This holds significant importance, especially in information security that …
Quantum Feasibility Labeling for NP-complete Vertex Coloring Problem
J Zhan - arXiv preprint arXiv:2301.01589, 2023 - arxiv.org
Many important science and engineering problems can be converted into NP-complete
problems which are of significant importance in computer science and mathematics …
problems which are of significant importance in computer science and mathematics …
Quantum Neural Networks for Solving Power System Transient Simulation Problem
M Soltaninia, J Zhan - arXiv preprint arXiv:2405.11427, 2024 - arxiv.org
Quantum computing, leveraging principles of quantum mechanics, represents a
transformative approach in computational methodologies, offering significant enhancements …
transformative approach in computational methodologies, offering significant enhancements …
Quantum Global Minimum Finder based on Variational Quantum Search
M Soltaninia, J Zhan - arXiv preprint arXiv:2405.00450, 2024 - arxiv.org
The search for global minima is a critical challenge across multiple fields including
engineering, finance, and artificial intelligence, particularly with non-convex functions that …
engineering, finance, and artificial intelligence, particularly with non-convex functions that …