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

A hybrid quantum annealer-classical computer variational framework for elasto-plastic materials

Nguyen, Van Dung, Wu, Ling, Damanet, François, F. Remacle, Noels, Ludovic

Published Jun 4, 2024• 0 citations
OpenAlex

Abstract

re)formulation for quantum annealing

Related papers

Resolution of elasto-plastic finite-elements problems by quantum annealing (Plenary Lecture)

Van Dung Nguyen, Ling Wu, F. Remacle +1 more

•Jan 7, 2025•0 citations

A hybrid framework integrating classical computers and quantum annealers for optimisation of truss structures

Van Dung Nguyen, Erin Kuci, Michel Rasquin +1 more

arXiv:2502.19570•Acta Mechanica Sinica•May 5, 2026•1 citation

Designing microplastic-binding peptides with a variational quantum circuit–based hybrid quantum-classical approach

Raul Conchello Vendrell, Akshay Ajagekar, Michael T. Bergman +2 more

De novo peptide design exhibits great potential in materials engineering, particularly for the use of plastic-binding peptides to help remediate microplastic pollution. There are no known peptide binders for many plastics-a gap that can be filled with de novo design. Current computational methods for peptide design exhibit limitations in sampling and scaling that could be addressed with quantum computing. Hybrid quantum-classical methods can leverage complementary strengths of near-term quantum algorithms and classical techniques for complex tasks like peptide design. This work introduces a hybrid quantum-classical generative framework for designing plastic-binding peptides combining variational quantum circuits with a variational autoencoder network. We demonstrate the framework's effectiveness in generating peptide candidates, evaluate its efficiency for property-oriented design, and validate the candidates with molecular dynamics simulations. This quantum computing-based approach could accelerate the development of biomolecular tools for environmental and biomedical applications while advancing the study of biomolecular systems through quantum technologies.

Science Advances•Dec 18, 2024•20 citations

Quantum Finite Element Method via Quantum Annealing for Solid Mechanics

Xidong Wang, Xiaojun Wang, Lianming Xu +3 more

•Jan 1, 2026•0 citations

Quantum annealing and digital quantum ground state preparation algorithms

Glen Bigan Mbeng

The recent advances in the world of quantum technologies have prompted the development of various quantum-based algorithms, some of which are suitable to run on available quantum devices. Two leading candidates in this area are Quantum Annealing (QA) and hybrid quantum-classical variational algorithms, such as the Quantum Approximate Optimization Algorithm (QAOA). In the first part of the Thesis, we re-examine the issue of whether Simulated Quantum Annealing (SQA) with Path Integral Monte Carlo has anything to do with the coherent QA Schrödinger dynamics. We do that by studying the random quantum Ising Chain in a transverse field. In the second part of the Thesis we address the issue of schedule optimization in both {em digitized}-QA and QAOA. Traditional schedule optimization in QA requires spectral information on the problem (e.g., location of the minimum gaps), which is in most cases inaccessible. On the other hand, in QAOA, the issue of schedule optimization --- alias, the optimization of the variational parameters --- is often an expensive task that constitutes a bottleneck for the algorithm. We show that, by combining the framework of QAOA and digitized-QA, optimal digitized-QA protocols can be constructed efficiently. When using this approach, the computational cost of schedule optimization is also significantly reduced, leading to a computational advantage both over a linear-schedule QA, and over an unstructured QAOA search. While studying these issues, we also developed rigorous variational bounds that provide insight on the best possible performance that one can hope to obtain from a digital QAOA circuit.

•Oct 24, 2019•2 citations

When Does Quantum Annealing Outperform Classical Methods? A Gradient Variance Framework Preliminary Version

Vishwajeet Ohal, Pierre Boulanger

•Jan 1, 2026•0 citations
De novo peptide design exhibits great potential in materials engineering, particularly for the use of plastic-binding peptides to help remediate microplastic pollution. There are no known peptide binders for many plastics-a gap that can be filled with de novo design. Current computational methods for peptide design exhibit limitations in sampling and scaling that could be addressed with quantum computing. Hybrid quantum-classical methods can leverage complementary strengths of near-term quantum algorithms and classical techniques for complex tasks like peptide design. This work introduces a hybrid quantum-classical generative framework for designing plastic-binding peptides combining variational quantum circuits with a variational autoencoder network. We demonstrate the framework's effectiveness in generating peptide candidates, evaluate its efficiency for property-oriented design, and validate the candidates with molecular dynamics simulations. This quantum computing-based approach could accelerate the development of biomolecular tools for environmental and biomedical applications while advancing the study of biomolecular systems through quantum technologies.
The recent advances in the world of quantum technologies have prompted the development of various quantum-based algorithms, some of which are suitable to run on available quantum devices. Two leading candidates in this area are Quantum Annealing (QA) and hybrid quantum-classical variational algorithms, such as the Quantum Approximate Optimization Algorithm (QAOA). In the first part of the Thesis, we re-examine the issue of whether Simulated Quantum Annealing (SQA) with Path Integral Monte Carlo has anything to do with the coherent QA Schrödinger dynamics. We do that by studying the random quantum Ising Chain in a transverse field. In the second part of the Thesis we address the issue of schedule optimization in both {em digitized}-QA and QAOA. Traditional schedule optimization in QA requires spectral information on the problem (e.g., location of the minimum gaps), which is in most cases inaccessible. On the other hand, in QAOA, the issue of schedule optimization --- alias, the optimization of the variational parameters --- is often an expensive task that constitutes a bottleneck for the algorithm. We show that, by combining the framework of QAOA and digitized-QA, optimal digitized-QA protocols can be constructed efficiently. When using this approach, the computational cost of schedule optimization is also significantly reduced, leading to a computational advantage both over a linear-schedule QA, and over an unstructured QAOA search. While studying these issues, we also developed rigorous variational bounds that provide insight on the best possible performance that one can hope to obtain from a digital QAOA circuit.