What is the Variational Quantum Eigensolver?
The Variational Quantum Eigensolver (VQE) is a hybrid quantum-classical algorithm designed to find the lowest eigenvalue (ground-state energy) of a given Hamiltonian which is an operator that describes the energy of a physical system.
It is one of the most prominent variational quantum algorithms (VQAs) due to its near-term availability and connection to industrially applicable problems in quantum chemistry.
VQE works by preparing a trial quantum state using a parametrized quantum circuit (an ansatz), measuring the expectation value of the Hamiltonian, and then using a classical optimizer to iteratively adjust the circuit parameters until the energy is minimized.
This approach leverages the variational principle from quantum mechanics, which guarantees that the measured energy is always an upper bound to the true ground-state energy.
How does VQE work?
1. State preparation: A parametrized quantum circuit (ansatz) prepares a trial state \( |\Psi(\theta)\rangle \) on the quantum processor.
2. Measurement: The expectation value of the target Hamiltonian \( H \) is estimated, \( E(\theta) = \langle \psi(\theta) | H | \psi(\theta) \rangle \), typically by decomposing \( H \) into a sum of Pauli operators and measuring each term.
3. Classical optimization: A classical optimizer updates the parameters \( \theta \) to minimize \( E(\theta) \).
4. Iteration: Steps 1–3 are repeated until convergence.
Because the quantum processor only handles state preparation and measurement while the optimizer runs classically, VQE is well-suited (but not limited to) to noisy intermediate-scale quantum (NISQ) devices with limited circuit depth.
Frequently asked questions about VQE
- What problems can VQE solve?
VQE was originally proposed for quantum chemistry i.e finding ground-state energies of molecular Hamiltonians but it has since been applied to condensed matter physics, combinatorial optimization (via mappings to Ising Hamiltonians), and materials science. Any problem that can be expressed as minimizing the expectation value of a Hamiltonian is in principle amenable to VQE.
- How does VQE differ from the Quantum Phase Estimation (QPE) algorithm?
QPE is a fully quantum algorithm that can extract eigenvalues to arbitrary precision but requires deep, error-corrected circuits. VQE trades this precision for shallow circuits and noise resilience, making it practical on near-term hardware at the cost of relying on classical optimization, which can face challenges such as local minima and barren plateaus.
- What is the role of the ansatz in VQE?
The choice of ansatz is critical to VQE’s performance. It determines which quantum states the algorithm can explore. Common choices include the Unitary Coupled Cluster (UCC) ansatz, which is inspired by classical quantum chemistry methods, and hardware-efficient ansätze, which are designed to match the native gate set of a given device. The ansatz must balance expressivity (ability to represent the true ground state) with trainability (avoidance of barren plateaus and local minima).
- What are the main challenges of VQE?
Key challenges include: the measurement overhead required to estimate each Pauli term in the Hamiltonian; barren plateaus, where the cost function landscape becomes exponentially flat and gradients vanish; sensitivity to noise, which can bias energy estimates; and the difficulty of classical optimization over high-dimensional parameter landscapes. Quantum error mitigation techniques are often employed to improve the accuracy of VQE results on noisy hardware.
- Is VQE relevant to photonic quantum computing?
VQE faces challenges on photonic hardware due to the probabilistic nature of entangling operations between photons. Representation of highly correlated structures like molecules requires many entangling operations as molecule size increases. A way to circumvent this problem for small molecules is to encode using qudits rather than qubits according to the QLOQ scheme.