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:2102.08403 · Physical Review Research

Unitary block optimization for variational quantum algorithms

Lucas Slattery, Benjamin Villalonga, Bryan K. Clark

Published Apr 26, 2022• 29 citations
arXivHTMLPDF

Abstract

Variational quantum algorithms are a promising hybrid framework for solving chemistry and physics problems with broad applicability to optimization as well. They are particularly well suited for noisy intermediate-scale quantum computers. In this paper we describe the unitary block optimization scheme (UBOS) and apply it to two variational quantum algorithms: the variational quantum eigensolver (VQE) and variational time evolution. The goal of VQE is to optimize a classically intractable parameterized quantum wave function to target a physical state of a Hamiltonian or solve an optimization problem. UBOS is an alternative to other VQE optimization schemes with a number of advantages, including fast convergence, less sensitivity to barren plateaus, the ability to tunnel through some local minima, and no hyperparameters to tune. We additionally describe how UBOS applies to real and imaginary time-evolution (TUBOS).

DOI
10.1103/physrevresearch.4.023072

Related papers

Variational Quantum Algorithms: From Theory to NISQ-Era Applications Challenges and Opportunities

Hicham Benamer

Variational Quantum Algorithms are a major method of harnessing Noisy Intermediate-Scale Quantum devices to solve classically intractable problems in physics, chemistry, optimization, and machine learning. The current review offers a critical overview of VQAs, with special emphasis on their theoretical backgrounds, algorithmic structures, and application performance within realistic models of noise. Several key variants, such as the Variational Quantum Eigensolver, Quantum Approximate Optimization Algorithm, and Quantum Neural Networks, are compared in terms of noise robustness, ansatz archi- tecture, and hybrid quantum-classical methods of optimization. Benchmarks in fields such as quantum chemistry, finance modeling, and particles and nuclei physics reveal the poten- tial of VQAs in achieving practical quantum advantage. Fundamentally limiting factors 1such as barren plateaus, optimization overhead, and hardware constraints are considered in addition to mitigation strategies, including adaptive construction of ansatz, informed training in the presence of noise, and quantum error correction using QVECTOR. The paper is concluded with an overview of the scalability and future of VQAs in the direction of transitioning toward fault-tolerant quantum computing.

•Aug 20, 2025•2 citations

Classical postprocessing for the unitary block-optimization scheme to reduce the effect of noise on the optimization of variational quantum eigensolvers

Xiaochuan Ding, Bryan K. Clark

Variational quantum eigensolvers (VQEs) are a promising approach for finding the classically intractable ground state of a Hamiltonian. The unitary block-optimization scheme (UBOS) is a state-of-the-art VQE method that works by sweeping over gates and finding optimal parameters for each gate in the environment of other gates. UBOS improves the convergence time to the ground state by an order of magnitude over stochastic gradient descent. It nonetheless suffers in both rate of convergence and final converged energies in the face of highly noisy expectation values coming from shot noise. Here we develop two classical postprocessing techniques that improve UBOS especially when measurements have large shot noise. Using Gaussian process regression, we generate artificial augmented data using original data from the quantum computer to reduce the overall error when solving for the improved parameters. Using double robust optimization plus rejection, we prevent outlying data which are atypically noisy from resulting in a particularly erroneous single optimization step, thereby increasing robustness against noisy measurements. Combining these techniques further reduces the final relative error that UBOS reaches by a factor of 3 without adding additional quantum measurement or sampling overhead. This work further demonstrates that developing techniques that use classical resources to postprocess quantum measurement results can significantly improve VQE algorithms.

arXiv:2404.19027•Physical Review A•Dec 2, 2024•0 citations

Quantum Optimization Algorithms and Application

N. Manglani, Dhruv Solanki, Ankit Das

Optimization problems are fundamental across various scientific and industrial domains, from logistics and finance to machine learning and drug discovery. Classical optimization algorithms, such as gradient-based methods and heuristic approaches, often struggle with issues like slow convergence, getting trapped in local minima, and inefficiency in handling high-dimensional or combinatorial problems. Applying the concepts of quantum optimization with quantum mechanics algorithms presents viable substitutes with the potential for speedups and better solution quality. Among the significant quantum optimization techniques investigated in this paper are Grover's Search Algorithm, Variational Quantum Eigensolver (VQE), Quantum Annealing, and the Quantum Approximate Optimization Algorithm (QAOA). QAOA is designed for combinatorial optimization problems, blending quantum and classical techniques to approximate optimal solutions. VQE, widely used in quantum chemistry, employs a hybrid quantum-classical approach to determine ground-state energies efficiently. Grover's algorithm fastens up searching databases, indirectly aiding optimization tasks. Quantum annealing, implemented by systems like D-Wave, solves optimization problems by exploiting quantum tunneling to escape local minima. Despite their advantages, these quantum approaches face challenges, including hardware limitations, noise in quantum systems, and scalability concerns. However, these algorithms are expected to be essential in solving complicated optimization problems that are currently intractable by classical approaches when quantum technology develops.

Wiley eBooks•Oct 30, 2026•0 citations

Improved Variational Quantum Eigensolver Via Quasidynamical Evolution

Manpreet Singh Jattana, Fengping Jin, Hans A. De Raedt +1 more

The variational quantum eigensolver (VQE) is a hybrid quantum classical algorithm designed for current and near-term quantum devices. Despite its initial success, there is a lack of understanding involving several of its key aspects. There are problems with VQE that forbid a favorable scaling towards quantum advantage. In order to alleviate the problems, we propose and extensively test a quantum annealing inspired heuristic that supplements VQE. The improved VQE enables an efficient initial state-preparation mechanism, in a recursive manner, for a quasidynamical unitary evolution. We conduct an in-depth scaling analysis of finding the ground-state energies with increasing lattice sizes of the Heisenberg model, employing simulations of up to 40 qubits that manipulate the complete state vector. In addition to systematically finding the ground-state energy, we observe that it avoids barren plateaus, escapes local minima, and works with low-depth circuits. For the current devices, we further propose a benchmarking toolkit using a mean-field model and test it on IBM Q devices. Realistic gate execution times estimate a longer computational time to complete the same computation on a fully functional error-free quantum computer than on a quantum computer emulator implemented on a classical computer. However, our proposal can be expected to help accurate estimations of the ground-state energies beyond 50 qubits when the complete state vector can no longer be stored on a classical computer, thus enabling quantum advantage.

arXiv:2202.10130•Physical Review Applied•Feb 16, 2023•26 citations

Hybrid quantum-classical algorithms for solving quantum chemistry in Hamiltonian–wave-function space

Zhan-Hao Yuan, Tao Yin, Dan-Bo Zhang

The variational quantum eigensolver (VQE) typically optimizes variational parameters in a quantum circuit to prepare eigenstates for a quantum system. Its application to many problems may involve a group of Hamiltonians, e.g., a Hamiltonian of a molecule is a function of the nuclear configurations. In this paper we incorporate derivatives of the Hamiltonian into the VQE and develop some hybrid quantum-classical algorithms, which explore both Hamiltonian and wave-function spaces for solving quantum chemistry problems more efficiently. For geometry optimization, we propose a mutual gradient-descent algorithm that updates the parameters of the Hamiltonian and wave function alternately, which can give a rapid convergence towards equilibrium structures of molecules as demonstrated in numerical simulations. Moreover, to speed up the calculation of the energy potential surface, we establish differential equations that govern how the optimized variational parameters of the wave function change with the intrinsic parameters of the Hamiltonian. Our study suggests a direction for a hybrid quantum-classical algorithm for solving quantum systems more efficiently by considering spaces of both the Hamiltonian and the wave function.

arXiv:2008.09014•Physical Review A•Jan 15, 2021•14 citations

Photonic variational quantum eigensolver for NISQ-compatible quantum technology

Kang-Min Hu, Min Namkung, Hyang-Tag Lim

Quantum computers have the potential to deliver speed-ups for solving certain important problems that are intractable for classical counterparts, making them a promising avenue for advancing modern computation. However, many quantum algorithms require deep quantum circuits, which are challenging to implement on current noisy devices. To address this limitation, variational quantum algorithms (VQAs) have been actively developed, enabling practical quantum computing in the noisy intermediate-scale quantum (NISQ) era. Among them, the variational quantum eigensolver (VQE) stands out as a leading approach for solving problems in quantum chemistry, many-body physics, and even integer factorization. The VQE algorithm can be implemented on various quantum hardware platforms, including photonic systems, quantum dots, trapped ions, neutral atoms, and superconducting circuits. In particular, photonic platforms offer several advantages: they operate at room temperature, exhibit low decoherence, and support multiple degrees of freedom, making them suitable for scalable, high-dimensional quantum computation. Here we present methodologies for realizing VQE on photonic systems, highlighting their potential for practical quantum computing. We first provide a theoretical overview of the VQE framework, focusing on the procedure for variationally estimating ground state energies. We then explore how photonic systems can implement these processes, showing that a wide variety of problems can be addressed using either multiple qubit states or a single qudit state.

quant-pharXiv:2512.18952•Nano Convergence•Dec 23, 2025•2 citations
Variational quantum algorithms are a promising hybrid framework for solving chemistry and physics problems with broad applicability to optimization as well. They are particularly well suited for noisy intermediate-scale quantum computers. In this paper we describe the unitary block optimization scheme (UBOS) and apply it to two variational quantum algorithms: the variational quantum eigensolver (VQE) and variational time evolution. The goal of VQE is to optimize a classically intractable parameterized quantum wave function to target a physical state of a Hamiltonian or solve an optimization problem. UBOS is an alternative to other VQE optimization schemes with a number of advantages, including fast convergence, less sensitivity to barren plateaus, the ability to tunnel through some local minima, and no hyperparameters to tune. We additionally describe how UBOS applies to real and imaginary time-evolution (TUBOS).
Variational Quantum Algorithms are a major method of harnessing Noisy Intermediate-Scale Quantum devices to solve classically intractable problems in physics, chemistry, optimization, and machine learning. The current review offers a critical overview of VQAs, with special emphasis on their theoretical backgrounds, algorithmic structures, and application performance within realistic models of noise. Several key variants, such as the Variational Quantum Eigensolver, Quantum Approximate Optimization Algorithm, and Quantum Neural Networks, are compared in terms of noise robustness, ansatz archi- tecture, and hybrid quantum-classical methods of optimization. Benchmarks in fields such as quantum chemistry, finance modeling, and particles and nuclei physics reveal the poten- tial of VQAs in achieving practical quantum advantage. Fundamentally limiting factors 1such as barren plateaus, optimization overhead, and hardware constraints are considered in addition to mitigation strategies, including adaptive construction of ansatz, informed training in the presence of noise, and quantum error correction using QVECTOR. The paper is concluded with an overview of the scalability and future of VQAs in the direction of transitioning toward fault-tolerant quantum computing.
Variational quantum eigensolvers (VQEs) are a promising approach for finding the classically intractable ground state of a Hamiltonian. The unitary block-optimization scheme (UBOS) is a state-of-the-art VQE method that works by sweeping over gates and finding optimal parameters for each gate in the environment of other gates. UBOS improves the convergence time to the ground state by an order of magnitude over stochastic gradient descent. It nonetheless suffers in both rate of convergence and final converged energies in the face of highly noisy expectation values coming from shot noise. Here we develop two classical postprocessing techniques that improve UBOS especially when measurements have large shot noise. Using Gaussian process regression, we generate artificial augmented data using original data from the quantum computer to reduce the overall error when solving for the improved parameters. Using double robust optimization plus rejection, we prevent outlying data which are atypically noisy from resulting in a particularly erroneous single optimization step, thereby increasing robustness against noisy measurements. Combining these techniques further reduces the final relative error that UBOS reaches by a factor of 3 without adding additional quantum measurement or sampling overhead. This work further demonstrates that developing techniques that use classical resources to postprocess quantum measurement results can significantly improve VQE algorithms.
Optimization problems are fundamental across various scientific and industrial domains, from logistics and finance to machine learning and drug discovery. Classical optimization algorithms, such as gradient-based methods and heuristic approaches, often struggle with issues like slow convergence, getting trapped in local minima, and inefficiency in handling high-dimensional or combinatorial problems. Applying the concepts of quantum optimization with quantum mechanics algorithms presents viable substitutes with the potential for speedups and better solution quality. Among the significant quantum optimization techniques investigated in this paper are Grover's Search Algorithm, Variational Quantum Eigensolver (VQE), Quantum Annealing, and the Quantum Approximate Optimization Algorithm (QAOA). QAOA is designed for combinatorial optimization problems, blending quantum and classical techniques to approximate optimal solutions. VQE, widely used in quantum chemistry, employs a hybrid quantum-classical approach to determine ground-state energies efficiently. Grover's algorithm fastens up searching databases, indirectly aiding optimization tasks. Quantum annealing, implemented by systems like D-Wave, solves optimization problems by exploiting quantum tunneling to escape local minima. Despite their advantages, these quantum approaches face challenges, including hardware limitations, noise in quantum systems, and scalability concerns. However, these algorithms are expected to be essential in solving complicated optimization problems that are currently intractable by classical approaches when quantum technology develops.
The variational quantum eigensolver (VQE) is a hybrid quantum classical algorithm designed for current and near-term quantum devices. Despite its initial success, there is a lack of understanding involving several of its key aspects. There are problems with VQE that forbid a favorable scaling towards quantum advantage. In order to alleviate the problems, we propose and extensively test a quantum annealing inspired heuristic that supplements VQE. The improved VQE enables an efficient initial state-preparation mechanism, in a recursive manner, for a quasidynamical unitary evolution. We conduct an in-depth scaling analysis of finding the ground-state energies with increasing lattice sizes of the Heisenberg model, employing simulations of up to 40 qubits that manipulate the complete state vector. In addition to systematically finding the ground-state energy, we observe that it avoids barren plateaus, escapes local minima, and works with low-depth circuits. For the current devices, we further propose a benchmarking toolkit using a mean-field model and test it on IBM Q devices. Realistic gate execution times estimate a longer computational time to complete the same computation on a fully functional error-free quantum computer than on a quantum computer emulator implemented on a classical computer. However, our proposal can be expected to help accurate estimations of the ground-state energies beyond 50 qubits when the complete state vector can no longer be stored on a classical computer, thus enabling quantum advantage.
The variational quantum eigensolver (VQE) typically optimizes variational parameters in a quantum circuit to prepare eigenstates for a quantum system. Its application to many problems may involve a group of Hamiltonians, e.g., a Hamiltonian of a molecule is a function of the nuclear configurations. In this paper we incorporate derivatives of the Hamiltonian into the VQE and develop some hybrid quantum-classical algorithms, which explore both Hamiltonian and wave-function spaces for solving quantum chemistry problems more efficiently. For geometry optimization, we propose a mutual gradient-descent algorithm that updates the parameters of the Hamiltonian and wave function alternately, which can give a rapid convergence towards equilibrium structures of molecules as demonstrated in numerical simulations. Moreover, to speed up the calculation of the energy potential surface, we establish differential equations that govern how the optimized variational parameters of the wave function change with the intrinsic parameters of the Hamiltonian. Our study suggests a direction for a hybrid quantum-classical algorithm for solving quantum systems more efficiently by considering spaces of both the Hamiltonian and the wave function.
Quantum computers have the potential to deliver speed-ups for solving certain important problems that are intractable for classical counterparts, making them a promising avenue for advancing modern computation. However, many quantum algorithms require deep quantum circuits, which are challenging to implement on current noisy devices. To address this limitation, variational quantum algorithms (VQAs) have been actively developed, enabling practical quantum computing in the noisy intermediate-scale quantum (NISQ) era. Among them, the variational quantum eigensolver (VQE) stands out as a leading approach for solving problems in quantum chemistry, many-body physics, and even integer factorization. The VQE algorithm can be implemented on various quantum hardware platforms, including photonic systems, quantum dots, trapped ions, neutral atoms, and superconducting circuits. In particular, photonic platforms offer several advantages: they operate at room temperature, exhibit low decoherence, and support multiple degrees of freedom, making them suitable for scalable, high-dimensional quantum computation. Here we present methodologies for realizing VQE on photonic systems, highlighting their potential for practical quantum computing. We first provide a theoretical overview of the VQE framework, focusing on the procedure for variationally estimating ground state energies. We then explore how photonic systems can implement these processes, showing that a wide variety of problems can be addressed using either multiple qubit states or a single qudit state.