Quantum Outpost

Algorithm Zoo · Optimization

VQE

Also known as: Variational Quantum Eigensolver

First described: Peruzzo, McClean, Shadbolt, Yung, Zhou, Love, Aspuru-Guzik, O'Brien, 2014

Status: Heuristic Maturity: Demonstrated Speedup: None proven

The problem

Estimate the ground-state energy of a Hamiltonian H using a parameterized ansatz |ψ(θ)⟩ and classical optimization.

Prepare |ψ(θ)⟩ on quantum hardware, measure ⟨ψ(θ)|H|ψ(θ)⟩ via sampling, classically minimize over θ. Hybrid algorithm — quantum hardware as an expectation-value oracle for a classical optimizer.

Best classical

DMRG (1D, weakly entangled 2D), CCSD(T) (small molecules), tensor networks, neural-network states.

Quantum complexity

Depends on ansatz; UCCSD scales as O(N^4) parameters with N orbitals.

Our verdict

Pedagogically essential, practically unproven. No VQE experiment has produced a chemistry result that wasn't reachable by CCSD(T) or DMRG with the same accuracy at the same molecule size. Barren plateaus and shot noise are foundational obstacles, not engineering ones — they don't go away with bigger hardware.

When to use it

When not to use it

Classical baseline

CCSD(T) is gold-standard for small molecules and feasible up to ~50 orbitals on a workstation. DMRG handles 1D systems and weakly entangled 2D. Neural network quantum states (NNQS, Carleo & Troyer 2017+) have eaten several 'VQE-only' benchmarks.

Hardware cost

Hardware-efficient ansatz: O(L·N) gates for L layers, N qubits. UCCSD: O(N^5) gates — feasible only post-FTQC.

Key papers

Deep-dive tutorials

Last verified: 2026-05-24

Weekly dispatch

Quantum, for people who already code.

One serious tutorial per week, plus the industry moves that actually matter. No hype, no hand-waving.

Free. Unsubscribe anytime. We will never sell your email.