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

International Journal of Computer and Communication Engineering

Molecular Computing Viability for Solving Computational Problems (Future and Challenges)

H. M., Mohammed El Bachir Menai

Published Jan 1, 2012• 0 citations
Publisher
DOI
10.7763/ijcce.2012.v1.50

Related papers

Molecular computing

Urs P. Wild, Cosimo De, Stefan Bernet +2 more

Journal of Luminescence•Jan 1, 1991•9 citations

Exploring Quantum Optimization for Computer-aided Molecular and Process Design

Ashfaq Iftakher, M. M. Faruque Hasan

Computer-aided Molecular and Process Design (CAMPD) is an equation-oriented multi-scale decision making framework for designing both materials (molecules) and processes for separation, reaction, and reactive separation whenever material choice significantly impacts process performance. The inherent nonlinearity and nonconvexity in CAMPD optimization models, introduced through the property and process models, pose challenges to state-of-the-art solvers. Recently, quantum computing (QC) has shown promise for solving complex optimization problems, especially those involving discrete decisions. This motivates us to explore the potential usage of quantum optimization techniques for solving CAMPD problems. We have developed a technique for directly solving a class of mixed integer nonlinear programs using QC. Our approach represents both continuous and integer design decisions by a set of binary variables through encoding schemes. This transformation allows to reformulate certain types of CAMPD problems into Quadratic Unconstrained Binary Optimization (QUBO) models that can be directly solved using quantum annealing techniques. We illustrate this technique for the selection of optimal ionic liquids (IL) and the configuration of a reactor-separator process network. We also discuss several challenges that are associated with quantum optimization when solving large scale CAMPD problems.

Systems and Control Transactions•Jul 9, 2024•1 citation

A variational eigenvalue solver on a photonic quantum processor

Alberto Peruzzo, Jarrod R. McClean, Peter Shadbolt +5 more

Quantum computers promise to efficiently solve important problems that are intractable on a conventional computer. For quantum systems, where the physical dimension grows exponentially, finding the eigenvalues of certain operators is one such intractable problem and remains a fundamental challenge. The quantum phase estimation algorithm efficiently finds the eigenvalue of a given eigenvector but requires fully coherent evolution. Here we present an alternative approach that greatly reduces the requirements for coherent evolution and combine this method with a new approach to state preparation based on ansätze and classical optimization. We implement the algorithm by combining a highly reconfigurable photonic quantum processor with a conventional computer. We experimentally demonstrate the feasibility of this approach with an example from quantum chemistry—calculating the ground-state molecular energy for He–H+. The proposed approach drastically reduces the coherence time requirements, enhancing the potential of quantum resources available today and in the near future. Quantum computers promise to efficiently solve problems that would be practically impossible with a normal computer. Peruzzo et al. develop a variational computation approach that uses any available quantum resources and, with a photonic quantum processing unit, find the ground-state molecular energy of He–H+.

arXiv:1304.3061•Nature Communications•Jul 23, 2014•4,552 citations

Molecular Informatics and Arithmetic and Computation

H Zimmermann.

•Jan 1, 2015•0 citations

The Potential of Quantum Computing Algorithms for Solving Chemistry Problems

Kunhuan Liu

•Jan 1, 2017•0 citations

Practical applications of Quantum Computing for Optimization Problems

Lorenzo Zuccari, Fabio Previtali, Emanuele D’Agostini

This study aims to evaluate the capabilities of state-of-the-art quantum computing applications, with a particular emphasis on their effectiveness in solving optimization problems. Specifically, it focuses on Quantum Annealing algorithms, examining their potential advantages and inherent limitations, reviews the capabilities of existing models, replicates proposed solutions for addressing NP-Hard problems, and systematically compares the results obtained with those produced by classical algorithms. Through this analysis, the study seeks to provide a rigorous assessment of the practical effectiveness of quantum annealing in optimization tasks and its viability as an alternative to classical computational methods in the near future.

International Conference on System Theory, Control and Computing (ICSTCC)•Oct 9, 2025•0 citations
Computer-aided Molecular and Process Design (CAMPD) is an equation-oriented multi-scale decision making framework for designing both materials (molecules) and processes for separation, reaction, and reactive separation whenever material choice significantly impacts process performance. The inherent nonlinearity and nonconvexity in CAMPD optimization models, introduced through the property and process models, pose challenges to state-of-the-art solvers. Recently, quantum computing (QC) has shown promise for solving complex optimization problems, especially those involving discrete decisions. This motivates us to explore the potential usage of quantum optimization techniques for solving CAMPD problems. We have developed a technique for directly solving a class of mixed integer nonlinear programs using QC. Our approach represents both continuous and integer design decisions by a set of binary variables through encoding schemes. This transformation allows to reformulate certain types of CAMPD problems into Quadratic Unconstrained Binary Optimization (QUBO) models that can be directly solved using quantum annealing techniques. We illustrate this technique for the selection of optimal ionic liquids (IL) and the configuration of a reactor-separator process network. We also discuss several challenges that are associated with quantum optimization when solving large scale CAMPD problems.
Quantum computers promise to efficiently solve important problems that are intractable on a conventional computer. For quantum systems, where the physical dimension grows exponentially, finding the eigenvalues of certain operators is one such intractable problem and remains a fundamental challenge. The quantum phase estimation algorithm efficiently finds the eigenvalue of a given eigenvector but requires fully coherent evolution. Here we present an alternative approach that greatly reduces the requirements for coherent evolution and combine this method with a new approach to state preparation based on ansätze and classical optimization. We implement the algorithm by combining a highly reconfigurable photonic quantum processor with a conventional computer. We experimentally demonstrate the feasibility of this approach with an example from quantum chemistry—calculating the ground-state molecular energy for He–H+. The proposed approach drastically reduces the coherence time requirements, enhancing the potential of quantum resources available today and in the near future. Quantum computers promise to efficiently solve problems that would be practically impossible with a normal computer. Peruzzo et al. develop a variational computation approach that uses any available quantum resources and, with a photonic quantum processing unit, find the ground-state molecular energy of He–H+.
This study aims to evaluate the capabilities of state-of-the-art quantum computing applications, with a particular emphasis on their effectiveness in solving optimization problems. Specifically, it focuses on Quantum Annealing algorithms, examining their potential advantages and inherent limitations, reviews the capabilities of existing models, replicates proposed solutions for addressing NP-Hard problems, and systematically compares the results obtained with those produced by classical algorithms. Through this analysis, the study seeks to provide a rigorous assessment of the practical effectiveness of quantum annealing in optimization tasks and its viability as an alternative to classical computational methods in the near future.