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:2110.12756 · SN Computer Science

Efficient Parabolic Optimisation Algorithm for Adaptive VQE Implementations

Vasileios Armaos, Dimitrios A. Badounas, Paraskevas Deligiannis, Konstantinos Lianos, Yordan S. Yordanov

Published Aug 15, 2022• 6 citations
arXivHTMLPDF
DOI
10.1007/s42979-022-01346-z

Related papers

Efficient VQE with the perturbation method

Qingfeng Wang, Ming Li, Christopher R. Monroe +1 more

Bulletin of the American Physical Society•Mar 17, 2021•0 citations

Pulse-optimised circuit elements for scalable and noise-resilient quantum chemistry

Henrik Gothen, Christopher K. Long, Djamila Hiller +4 more

Useful chemistry calculations on near-term quantum processors are hindered by current algorithmic runtimes. We develop a methodology to significantly reduce these runtimes. Typically, variational quantum eigensolver (VQE) algorithms are implemented as sequences of primitive gates. Our methodology instead relies on gradient-ascent pulse engineering to construct hardware-tailored pulses for the direct implementation of VQEs. As problem sizes increase, it quickly becomes intractable to optimise a pulse that implements an entire VQE ansatz circuit. However, leading VQEs are constructed in a modular fashion. A problem-tailored VQE is assembled from parameterised circuit elements that simulate hopping between two or four electronic spin orbitals. We show that these circuit elements can be implemented more efficiently using hardware-tailored pulses. We numerically demonstrate our methodology on a silicon spin-qubit quantum processor. We find that common circuit elements, known as single- and double-qubit excitations, can be implemented in less than 289 ns and 927 ns, respectively. Compared with conventional gate-based implementations, our pulse-accelerated qubit excitations provide a scalable approach for faster and therefore more noise-robust quantum chemistry simulations by reducing VQE runtimes by up to a factor of 15.3.

quant-pharXiv:2606.17357•Jun 17, 2026•0 citations

Efficient VQE Approach for Accurate Simulations on the Kagome Lattice

S Jyothikamalesh, A. Kaarnika, Mohankumar. M +3 more

The Kagome lattice, a captivating lattice structure composed of interconnected triangles with frustrated magnetic properties, has garnered considerable interest in condensed matter physics, quantum magnetism, and quantum computing.The Ansatz optimization provided in this study along with extensive research on optimisation technique results us with high accuracy. This study focuses on using multiple ansatz models to create an effective Variational Quantum Eigensolver (VQE) on the Kagome lattice. By comparing various optimisation methods and optimising the VQE ansatz models, the main goal is to estimate ground state attributes with high accuracy. This study advances quantum computing and advances our knowledge of quantum materials with complex lattice structures by taking advantage of the distinctive geometric configuration and features of the Kagome lattice. Aiming to improve the effectiveness and accuracy of VQE implementations, the study examines how Ansatz Modelling, quantum effects, and optimization techniques interact in VQE algorithm. The findings and understandings from this study provide useful direction for upcoming improvements in quantum algorithms,quantum machine learning and the investigation of quantum materials on the Kagome Lattice.

arXiv:2306.00467•Jun 1, 2023•1 citation

Effectiveness of error-mitigation techniques for VQE under realistic noise sources

JOSE L. SOLIS, Armando Aguilar, Russell Batista +2 more

Bulletin of the American Physical Society•Mar 15, 2021•0 citations

Quantum algorithms for drone mission planning

Ethan G. Davies, Pranav V. Kalidindi

Mission planning often involves optimising the use of ISR (Intelligence, Surveillance and Reconnaissance) assets in order to achieve a set of mission objectives within allowed parameters subject to constraints. The missions of interest here, involve routing multiple UAVs visiting multiple targets, utilising sensors to capture data relating to each target. Finding such solutions is often an NP-Hard problem and cannot be solved efficiently on classical computers. Furthermore, during the mission new constraints and objectives may arise, requiring a new solution to be computed within a short time period. To achieve this we investigate near term quantum algorithms that have the potential to offer speed-ups against current classical methods. We demonstrate how a large family of these problems can be formulated as a Mixed Integer Linear Program (MILP) and then converted to a Quadratic Unconstrained Binary Optimisation (QUBO). The formulation provided is versatile and can be adapted for many different constraints with clear qubit scaling provided. We discuss the results of solving the QUBO formulation using commercial quantum annealers and compare the solutions to current edge classical solvers. We also analyse the results from solving the QUBO using Quantum Approximate Optimisation Algorithms (QAOA) and discuss their results. Finally, we also provide efficient methods to encode to the problem into the Variational Quantum Eigensolver (VQE) formalism, where we have tailored the ansatz to the problem making efficient use of the qubits available.

arXiv:2409.18631•SPIE Quantum Technologies for Defence and Security•Nov 15, 2024•3 citations

Resource-optimized VQE implementation: Bridging algorithmic innovation and hardware realities

Li-Wei Yu

Science China Physics Mechanics and Astronomy•Apr 15, 2025•0 citations
Useful chemistry calculations on near-term quantum processors are hindered by current algorithmic runtimes. We develop a methodology to significantly reduce these runtimes. Typically, variational quantum eigensolver (VQE) algorithms are implemented as sequences of primitive gates. Our methodology instead relies on gradient-ascent pulse engineering to construct hardware-tailored pulses for the direct implementation of VQEs. As problem sizes increase, it quickly becomes intractable to optimise a pulse that implements an entire VQE ansatz circuit. However, leading VQEs are constructed in a modular fashion. A problem-tailored VQE is assembled from parameterised circuit elements that simulate hopping between two or four electronic spin orbitals. We show that these circuit elements can be implemented more efficiently using hardware-tailored pulses. We numerically demonstrate our methodology on a silicon spin-qubit quantum processor. We find that common circuit elements, known as single- and double-qubit excitations, can be implemented in less than 289 ns and 927 ns, respectively. Compared with conventional gate-based implementations, our pulse-accelerated qubit excitations provide a scalable approach for faster and therefore more noise-robust quantum chemistry simulations by reducing VQE runtimes by up to a factor of 15.3.
The Kagome lattice, a captivating lattice structure composed of interconnected triangles with frustrated magnetic properties, has garnered considerable interest in condensed matter physics, quantum magnetism, and quantum computing.The Ansatz optimization provided in this study along with extensive research on optimisation technique results us with high accuracy. This study focuses on using multiple ansatz models to create an effective Variational Quantum Eigensolver (VQE) on the Kagome lattice. By comparing various optimisation methods and optimising the VQE ansatz models, the main goal is to estimate ground state attributes with high accuracy. This study advances quantum computing and advances our knowledge of quantum materials with complex lattice structures by taking advantage of the distinctive geometric configuration and features of the Kagome lattice. Aiming to improve the effectiveness and accuracy of VQE implementations, the study examines how Ansatz Modelling, quantum effects, and optimization techniques interact in VQE algorithm. The findings and understandings from this study provide useful direction for upcoming improvements in quantum algorithms,quantum machine learning and the investigation of quantum materials on the Kagome Lattice.
Mission planning often involves optimising the use of ISR (Intelligence, Surveillance and Reconnaissance) assets in order to achieve a set of mission objectives within allowed parameters subject to constraints. The missions of interest here, involve routing multiple UAVs visiting multiple targets, utilising sensors to capture data relating to each target. Finding such solutions is often an NP-Hard problem and cannot be solved efficiently on classical computers. Furthermore, during the mission new constraints and objectives may arise, requiring a new solution to be computed within a short time period. To achieve this we investigate near term quantum algorithms that have the potential to offer speed-ups against current classical methods. We demonstrate how a large family of these problems can be formulated as a Mixed Integer Linear Program (MILP) and then converted to a Quadratic Unconstrained Binary Optimisation (QUBO). The formulation provided is versatile and can be adapted for many different constraints with clear qubit scaling provided. We discuss the results of solving the QUBO formulation using commercial quantum annealers and compare the solutions to current edge classical solvers. We also analyse the results from solving the QUBO using Quantum Approximate Optimisation Algorithms (QAOA) and discuss their results. Finally, we also provide efficient methods to encode to the problem into the Variational Quantum Eigensolver (VQE) formalism, where we have tailored the ansatz to the problem making efficient use of the qubits available.