L11: Hamiltonian Simulation (Trotterization & Mapping Matter to Qubits)
Learning Objectives¶
Explain why simulating quantum matter is the ‘native’ application of quantum computers.
Decompose via Lie-Trotter-Suzuki formulas and bound the error.
Map spin Hamiltonians (Ising, Heisenberg) directly to circuits.
Map fermions to qubits (Jordan-Wigner; Bravyi-Kitaev in outline).
Feynman’s Charge¶
Classical cost of an -site quantum system grows as ; a quantum computer stores the state in qubits.
Target problems for materials science: ground-state energies, band structures, reaction barriers, dynamics after a quench, correlated phases (Hubbard physics, high-).
Eureka! Simulation is the application where quantum advantage needs the least algorithmic magic: the computer and the problem obey the same physics.
The Task¶
Given (each a local/Pauli term), implement as a circuit.
Problem: the generally do not commute, so .
Trotterization¶
First-order Lie–Trotter:
Second-order (Suzuki) symmetric splitting reduces error to .
Eureka! Error is governed by commutators: terms that commute cost nothing to split. Locality of physical Hamiltonians is what makes simulation efficient.
Circuit Primitives for Pauli Evolutions¶
: an gate.
: CNOT ladder CNOT ladder.
Any Pauli string : basis change ( for , for ), then the pattern.
Worked example on board: one Trotter step of the transverse-field Ising model .
Fermions to Qubits: Jordan-Wigner¶
Creation/annihilation operators need antisymmetry; qubits do not have it natively.
Preserves ; cost: strings of ’s (nonlocality).
Bravyi--Kitaev: -weight strings; parity/ternary-tree variants.
Pipeline: molecule/lattice second quantization qubit Hamiltonian (
openfermion,qiskit-nature).
Eureka! After JW, any electronic-structure problem is a sum of Pauli strings — exactly what our Trotter and VQE (L12) machinery consumes.
Measuring Observables¶
Energy: ; measure each Pauli string by basis rotation + -basis shots.
Grouping commuting strings reduces the number of measurement settings.
Dynamics: measure correlators after Trotterized evolution.
Beyond Trotter (One-Slide Horizon)¶
qDRIFT (randomized compiling of terms), linear combination of unitaries (LCU), qubitization / quantum signal processing achieve optimal and scaling — the fault-tolerant-era toolkit built on the QFT/QPE ideas of L08-L09.
Mini-Lab¶
Simulate a 4-spin transverse-field Ising quench; compare Trotter steps against exact diagonalization (NumPy).
Verify the error scaling on a log-log plot.
Map H (STO-3G, 2 qubits after reduction) to a qubit Hamiltonian and print its Pauli decomposition.
Takeaways¶
is compiled by splitting into local terms; commutators set the price.
Pauli-string evolution circuits are the universal subroutine.
Jordan-Wigner turns electrons into qubits; materials problems become Pauli sums.