Structure-aware variance reduction methodology for unbiased randomized Hamiltonian simulation. Combines classical variance reduction with randomized product-formula estimators to achieve 70-96% sampling cost reductions in tensor-network simulations. Use when implementing randomized Hamiltonian simulation, optimizing quantum circuit sampling, reducing Trotter discretization errors, or analyzing non-commutative Hamiltonian dynamics.
Scanned 9/11/2026
Install to Claude Code
npx -y skills add hiyenwong/ai_collection --skill structure-aware-variance-reduction-hamiltonian --agent claude-codeInstalls into .claude/skills of the current project.
Are you the author of Structure Aware Variance Reduction Hamiltonian?
Add the live security badge to your README — it updates automatically with every re-scan.
[](https://www.skillsdirectory.com/skills/hiyenwong-structure-aware-variance-reduction-hamiltonian-a2b55983)More formats (shields.io, HTML) on the badges page.
---
name: structure-aware-variance-reduction-hamiltonian
description: Structure-aware variance reduction methodology for unbiased randomized Hamiltonian simulation. Combines classical variance reduction with randomized product-formula estimators to achieve 70-96% sampling cost reductions in tensor-network simulations. Use when implementing randomized Hamiltonian simulation, optimizing quantum circuit sampling, reducing Trotter discretization errors, or analyzing non-commutative Hamiltonian dynamics.
---
# Structure-Aware Variance Reduction for Unbiased Randomized Hamiltonian Simulation
## Core Methodology
Continuous TE-PAI (Time-Evolution Probabilistic Angle Interpolation) removes Trotter discretization error with finite-depth random circuits, whereas deterministic Trotterization does so only in the infinite-depth limit.
### Key Insight
Variance decomposes into two components:
1. **Classical counting component** - statistical counting overhead
2. **Quantum ordering component** - non-commutative parts of Hamiltonian dynamics
The dominant simulation overhead results from the non-commutative parts.
### Implementation Pattern
1. Formulate continuous TE-PAI quasiprobabilistic random-circuit protocol
2. Decompose variance into classical counting and quantum ordering components
3. Apply counting-component reduction for small systems (approx 70% error reduction)
4. For tensor-network simulations, use coarser statistics tailored to observable and estimator
- Negligible bias with approx 80% reduction
- Approx 91-96% sampling cost reductions for n=30 spin-chain dynamics
### Advantages
- Unbiased - no additional bias introduced
- Finite-depth - removes Trotter error at finite circuit depth
- Avoids bond dimension explosion - prevents unphysical exponential growth in tensor-network simulations
- Observable-specific - tailors statistics to target observableIs this your skill, or is something wrong with this listing? Request removal or report an issue. Author removals are honored within 72 hours.
No comments yet. Be the first to comment!