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

arXiv:2512.24173

Variational Quantum Brushes

Jui-Ting Lu, Henrique Ennes, Chih-Kang Huang, Ali Abbassi

quant-phcs.GRcs.LGmath.OCSubmitted Dec 30, 2025• Announced Dec 31, 2025• 0 citations
arXivHTMLPDF

Abstract

Quantum brushes are computational arts software introduced by Ferreira et al (2025) that leverage quantum behavior to generate novel artistic effects. In this outreach paper, we introduce the mathematical framework and describe the implementation of two quantum brushes based on variational quantum algorithms, Steerable and Chemical. While Steerable uses quantum geometric control theory to merge two works of art, Chemical mimics variational eigensolvers for estimating molecular ground energies to evolve colors on an underlying canvas. The implementation of both brushes is available open-source at https://github.com/moth-quantum/QuantumBrush and is fully compatible with the original quantum brushes.

Related papers

Quantum-Enhanced Computational Drug Discovery: Leveraging Variational Quantum Algorithms for Accurate Binding Affinity Prediction and Lead Optimization in Complex Biological Targets

Hande Selvi Yanık

Accurate prediction of binding affinities and efficient lead optimization remain central challenges in computational drug discovery, particularly for complex biological targets characterized by rugged energy landscapes, conformational heterogeneity, and high-dimensional interaction spaces. Classical computational methods—such as molecular docking, force-field–based simulations, and deep learning models—have made substantial progress, yet they often struggle to capture quantum-mechanical effects and long-range correlations critical to molecular recognition. This study explores a quantum-enhanced framework that integrates Variational Quantum Algorithms (VQAs), quantum-inspired Hamiltonian modeling, and hybrid quantum–classical optimization workflows to improve the fidelity and scalability of drug discovery pipelines. By encoding molecular interactions into parameterized quantum circuits, the framework leverages quantum superposition and entanglement to explore complex chemical space more efficiently, enabling refined estimation of binding energies and accelerated identification of high-quality leads. Preliminary simulations indicate that VQA-based estimators outperform classical baselines for challenging protein–ligand systems, reducing prediction error while maintaining computational tractability. These findings highlight the emerging potential of quantum technologies to enable more accurate, data-efficient, and mechanistically grounded drug discovery for next-generation therapeutics.

Next frontier.•Nov 28, 2025•0 citations

Implementing the Variational Quantum Eigensolver for Materials

Clayton Smith

'In the past few years quantum computers have seen considerable interest from fields which have problems which are computationally expensive to solve with classical computers. One area that has been a major of source of this interest is the simulation of chemical systems. Materials are one type of system that is important to a variety of industries such as renewable energy and medicine. Among the obstacles faced in simulating materials, materials can have properties which are challenging to calculate on classical computers. The promise of quantum computing for improving the exactness of chemical calculations has been shown with a number of methods for a variety of systems. One such method which has previously been used for materials is the variational quantum eigensolver (VQE). However work doing this is still fairly scarce and also typically uses closed source/paid software or does not publish detailed code. The goal of this research is to implement VQE for materials using the python package Tangelo. This implementation will then be used to perform calculations on simple systems to compare this implementation with existing results.

•Jan 1, 2024•0 citations

A universal quantum algorithm for weighted maximum cut and Ising problems

Natacha Kuete Meli, Florian Mannel, Jan Lellmann

Abstract We propose a hybrid quantum-classical algorithm to compute approximate solutions of binary combinatorial problems. We employ a shallow-depth quantum circuit to implement a unitary and Hermitian operator that block-encodes the weighted maximum cut or the Ising Hamiltonian. Measuring the expectation of this operator on a variational quantum state yields the variational energy of the quantum system. The system is enforced to evolve toward the ground state of the problem Hamiltonian by optimizing a set of angles using normalized gradient descent. Experimentally, our algorithm outperforms the state-of-the-art quantum approximate optimization algorithm on random fully connected graphs and challenges D-Wave quantum annealers by producing good approximate solutions. Source code and data files are publicly available ( https://github.com/nkuetemeli/UQMaxCutAndIsing ).

arXiv:2306.06539•Quantum Information Processing•Jul 11, 2023•6 citations

Unified views of quantum simulation algorithms for chemistry

James Daniel Whitfield

Time evolution of quantum systems is of interest in physics, in chemistry, and, more recently, in computer science. Quantum computers are suggested as one route to propagating quantum systems far more efficiently than ordinary numerical methods. In the past few years, researchers have actively been improving quantum simulation algorithms, especially those in second quantization. This work continues to advance the state-of-the-art by unifying several diverging approaches under a common framework. In particular, it highlights the similarities and differences of the first and second quantized algorithms which are usually presented in a distinct fashion. By combining aspects of the two approaches, this work moves towards an online second quantized algorithm operating within a single-Fock space. This paper also unifies a host of approaches to algorithmic quantum measurement by removing superficial differences. The aim of the effort is not only to give a high-level understanding of quantum simulation, but to move towards experimentally realizable algorithms with practical applications in chemistry and beyond.

arXiv:1502.03771•Feb 12, 2015•13 citations

Bridging Computational Chemistry and Quantum Computing for Next-Generation Drug Discovery & Development

Quantum chemistry plays a crucial role in advancing fundamental understanding of chemical processes and driving innovation in energy, medicine, and materials science. Recent progress in quantum computing has opened new possibilities for molecular simulations that are beyond the practical limits of classical approaches. Academic studies have demonstrated hybrid Density Functional Theory (DFT) and Variational Quantum Eigensolver (VQE) benchmarks on small transition-metal systems, such as iron porphyrin and heme analogues, using current noisy intermediate-scale quantum (NISQ) hardware. Although full-scale simulations of complex biological systems such as the complete Cytochrome P450 (CYP450) active site remain a long-term goal due to limitations in qubit numbers, coherence times, and error correction, the underlying methodologies are now well established. At present, quantum chemistry applications in drug discovery remain largely experimental, and widespread practical medical impact is expected to require further technological advances over the next 5–10 years. Nevertheless, quantum software and algorithm development for chemical applications is progressing rapidly. This perspective summarizes recent advances in quantum computing algorithms, hardware, and software relevant to chemistry, and critically discusses the remaining challenges and opportunities for applying quantum computing to chemical problems, with particular emphasis on drug discovery and development.

Scientiae Radices•Dec 30, 2025•0 citations

An adaptive variational algorithm for exact molecular simulations on a quantum computer

Harper R. Grimsley, Sophia E. Economou, Edwin Barnes +1 more

Quantum simulation of chemical systems is one of the most promising near-term applications of quantum computers. The variational quantum eigensolver, a leading algorithm for molecular simulations on quantum hardware, has a serious limitation in that it typically relies on a pre-selected wavefunction ansatz that results in approximate wavefunctions and energies. Here we present an arbitrarily accurate variational algorithm that, instead of fixing an ansatz upfront, grows it systematically one operator at a time in a way dictated by the molecule being simulated. This generates an ansatz with a small number of parameters, leading to shallow-depth circuits. We present numerical simulations, including for a prototypical strongly correlated molecule, which show that our algorithm performs much better than a unitary coupled cluster approach, in terms of both circuit depth and chemical accuracy. Our results highlight the potential of our adaptive algorithm for exact simulations with present-day and near-term quantum hardware.

arXiv:1812.11173•Nature Communications•Jul 8, 2019•1,200 citations
Quantum brushes are computational arts software introduced by Ferreira et al (2025) that leverage quantum behavior to generate novel artistic effects. In this outreach paper, we introduce the mathematical framework and describe the implementation of two quantum brushes based on variational quantum algorithms, Steerable and Chemical. While Steerable uses quantum geometric control theory to merge two works of art, Chemical mimics variational eigensolvers for estimating molecular ground energies to evolve colors on an underlying canvas. The implementation of both brushes is available open-source at https://github.com/moth-quantum/QuantumBrush and is fully compatible with the original quantum brushes.
Accurate prediction of binding affinities and efficient lead optimization remain central challenges in computational drug discovery, particularly for complex biological targets characterized by rugged energy landscapes, conformational heterogeneity, and high-dimensional interaction spaces. Classical computational methods—such as molecular docking, force-field–based simulations, and deep learning models—have made substantial progress, yet they often struggle to capture quantum-mechanical effects and long-range correlations critical to molecular recognition. This study explores a quantum-enhanced framework that integrates Variational Quantum Algorithms (VQAs), quantum-inspired Hamiltonian modeling, and hybrid quantum–classical optimization workflows to improve the fidelity and scalability of drug discovery pipelines. By encoding molecular interactions into parameterized quantum circuits, the framework leverages quantum superposition and entanglement to explore complex chemical space more efficiently, enabling refined estimation of binding energies and accelerated identification of high-quality leads. Preliminary simulations indicate that VQA-based estimators outperform classical baselines for challenging protein–ligand systems, reducing prediction error while maintaining computational tractability. These findings highlight the emerging potential of quantum technologies to enable more accurate, data-efficient, and mechanistically grounded drug discovery for next-generation therapeutics.
'In the past few years quantum computers have seen considerable interest from fields which have problems which are computationally expensive to solve with classical computers. One area that has been a major of source of this interest is the simulation of chemical systems. Materials are one type of system that is important to a variety of industries such as renewable energy and medicine. Among the obstacles faced in simulating materials, materials can have properties which are challenging to calculate on classical computers. The promise of quantum computing for improving the exactness of chemical calculations has been shown with a number of methods for a variety of systems. One such method which has previously been used for materials is the variational quantum eigensolver (VQE). However work doing this is still fairly scarce and also typically uses closed source/paid software or does not publish detailed code. The goal of this research is to implement VQE for materials using the python package Tangelo. This implementation will then be used to perform calculations on simple systems to compare this implementation with existing results.
Abstract We propose a hybrid quantum-classical algorithm to compute approximate solutions of binary combinatorial problems. We employ a shallow-depth quantum circuit to implement a unitary and Hermitian operator that block-encodes the weighted maximum cut or the Ising Hamiltonian. Measuring the expectation of this operator on a variational quantum state yields the variational energy of the quantum system. The system is enforced to evolve toward the ground state of the problem Hamiltonian by optimizing a set of angles using normalized gradient descent. Experimentally, our algorithm outperforms the state-of-the-art quantum approximate optimization algorithm on random fully connected graphs and challenges D-Wave quantum annealers by producing good approximate solutions. Source code and data files are publicly available ( https://github.com/nkuetemeli/UQMaxCutAndIsing ).
Time evolution of quantum systems is of interest in physics, in chemistry, and, more recently, in computer science. Quantum computers are suggested as one route to propagating quantum systems far more efficiently than ordinary numerical methods. In the past few years, researchers have actively been improving quantum simulation algorithms, especially those in second quantization. This work continues to advance the state-of-the-art by unifying several diverging approaches under a common framework. In particular, it highlights the similarities and differences of the first and second quantized algorithms which are usually presented in a distinct fashion. By combining aspects of the two approaches, this work moves towards an online second quantized algorithm operating within a single-Fock space. This paper also unifies a host of approaches to algorithmic quantum measurement by removing superficial differences. The aim of the effort is not only to give a high-level understanding of quantum simulation, but to move towards experimentally realizable algorithms with practical applications in chemistry and beyond.
Quantum chemistry plays a crucial role in advancing fundamental understanding of chemical processes and driving innovation in energy, medicine, and materials science. Recent progress in quantum computing has opened new possibilities for molecular simulations that are beyond the practical limits of classical approaches. Academic studies have demonstrated hybrid Density Functional Theory (DFT) and Variational Quantum Eigensolver (VQE) benchmarks on small transition-metal systems, such as iron porphyrin and heme analogues, using current noisy intermediate-scale quantum (NISQ) hardware. Although full-scale simulations of complex biological systems such as the complete Cytochrome P450 (CYP450) active site remain a long-term goal due to limitations in qubit numbers, coherence times, and error correction, the underlying methodologies are now well established. At present, quantum chemistry applications in drug discovery remain largely experimental, and widespread practical medical impact is expected to require further technological advances over the next 5–10 years. Nevertheless, quantum software and algorithm development for chemical applications is progressing rapidly. This perspective summarizes recent advances in quantum computing algorithms, hardware, and software relevant to chemistry, and critically discusses the remaining challenges and opportunities for applying quantum computing to chemical problems, with particular emphasis on drug discovery and development.
Quantum simulation of chemical systems is one of the most promising near-term applications of quantum computers. The variational quantum eigensolver, a leading algorithm for molecular simulations on quantum hardware, has a serious limitation in that it typically relies on a pre-selected wavefunction ansatz that results in approximate wavefunctions and energies. Here we present an arbitrarily accurate variational algorithm that, instead of fixing an ansatz upfront, grows it systematically one operator at a time in a way dictated by the molecule being simulated. This generates an ansatz with a small number of parameters, leading to shallow-depth circuits. We present numerical simulations, including for a prototypical strongly correlated molecule, which show that our algorithm performs much better than a unitary coupled cluster approach, in terms of both circuit depth and chemical accuracy. Our results highlight the potential of our adaptive algorithm for exact simulations with present-day and near-term quantum hardware.