Every quantum algorithm that finds a ground state energy must start from one
fundamental inequality — the variational principle — which guarantees that
any state you prepare gives an upper bound on the true ground energy.
The variational bound
Let H be a Hamiltonian with eigenstates ∣Ek⟩ and eigenvalues
E0≤E1≤⋯ ordered from lowest to highest. For an arbitrary
normalized trial state ∣ψ⟩ the expectation value satisfies
⟨ψ∣H∣ψ⟩≥E0.
Proof. Expand ∣ψ⟩=∑kck∣Ek⟩ with ∑k∣ck∣2=1.
Then
⟨ψ∣H∣ψ⟩=k∑∣ck∣2Ek≥E0k∑∣ck∣2=E0.
Equality holds if and only if ∣ψ⟩=∣E0⟩ — the true ground state.
A concrete example: H=Z
The single-qubit Pauli-Z operator has matrix
Z=(100−1).
Its eigenvalues are +1 (eigenvector ∣0⟩) and −1 (eigenvector ∣1⟩),
so the ground state energy is E0=−1.
The variational principle guarantees that for any single-qubit state
∣ψ⟩=α∣0⟩+β∣1⟩,
⟨ψ∣Z∣ψ⟩=∣α∣2(1)+∣β∣2(−1)=∣α∣2−∣β∣2≥−1,
with equality only when α=0, i.e.\ ∣ψ⟩=∣1⟩.
Energy landscape across trial states
Parametrize a family of trial states as
∣ψ(θ)⟩=cos(θ/2)∣0⟩+sin(θ/2)∣1⟩
(a rotation from ∣0⟩ toward ∣1⟩). The expectation value is
E(θ)=⟨ψ(θ)∣Z∣ψ(θ)⟩=cos2(θ/2)−sin2(θ/2)=cosθ.
This function is minimized at θ=π, where E(π)=−1=E0.
VQE would discover this minimum by evaluating E(θ) on the quantum
device and updating θ classically (a hybrid loop).
Why this matters for VQE
VQE replaces "solve H∣ψ⟩=E0∣ψ⟩ analytically" with
"prepare ∣ψ(θ)⟩ on a quantum processor, measure ⟨H⟩,
pass that number to a classical optimizer, and repeat." The variational principle
is the guarantee that the optimizer's objective — the energy expectation value —
is always an upper bound on E0, so the algorithm can only improve.
Try it
The Pauli-Z Hamiltonian has eigenvalues +1 and −1. The variational
principle says ⟨ψ∣Z∣ψ⟩≥−1 for all ∣ψ⟩.
Return the expectation value of Z in the state ∣1⟩ to confirm that
the bound is tight for the true ground state.
Run your code to see the quantum state.
Sign in on the full site to ask questions and join the discussion.