Tensor-Network Randomized Time Evolution via Parallelized Approximate Inversion (TE-PAI) for classical simulation of quantum many-body dynamics. MPS TE-PAI achieves 10^3x gate-count reduction and massive parallelization via randomized shallow Trotter-variant circuits. Keywords: tensor network, MPS, time evolution, randomized algorithms, TE-PAI, classical simulation, parallelization, Trotter, quantum many-body.
Scanned 9/11/2026
Install to Claude Code
npx -y skills add hiyenwong/ai_collection --skill te-pai-classical-simulation --agent claude-codeInstalls into .claude/skills of the current project.
Are you the author of Te Pai Classical Simulation?
Add the live security badge to your README — it updates automatically with every re-scan.
[](https://www.skillsdirectory.com/skills/hiyenwong-te-pai-classical-simulation-ai-collection)More formats (shields.io, HTML) on the badges page.
---
name: te-pai-classical-simulation
description: "Tensor-Network Randomized Time Evolution via Parallelized Approximate Inversion (TE-PAI) for classical simulation of quantum many-body dynamics. MPS TE-PAI achieves 10^3x gate-count reduction and massive parallelization via randomized shallow Trotter-variant circuits. Keywords: tensor network, MPS, time evolution, randomized algorithms, TE-PAI, classical simulation, parallelization, Trotter, quantum many-body."
---
# TE-PAI: Randomized Time Evolution for Classical Simulation
Classical simulation framework for quantum many-body dynamics using randomized time evolution via parallelized approximate inversion (TE-PAI).
## Core Concepts
### Problem: Tensor Network Limitations
- **Entanglement build-up**: Exponentially growing computational cost
- **Sequential nature**: Incremental state updates limit parallelization
- **Bond dimension**: Truncation errors in strongly correlated systems
### Solution: TE-PAI Approach
- **Randomized circuits**: Shallow Trotter-variant circuit ensemble
- **Unbiased estimator**: Exact time evolution on average
- **Massive parallelization**: Independent circuit instances
## Technical Specifications
### Algorithm
- **Method**: MPS (Matrix Product State) TE-PAI
- **Representation**: Ensemble of randomized shallow circuits
- **Estimator**: Unbiased for exact time evolution
### Performance
- **Gate Count Reduction**: Up to 10^3x per sample vs Trotterized MPS
- **Time-to-Solution**: Orders of magnitude reduction under parallelization
- **Robustness**: More robust to bond-dimension truncation
### Systems Demonstrated
- **Model**: Disordered one-dimensional spin-ring Hamiltonians
- **Dimensions**: 1D systems
- **Interactions**: Disordered spin systems
## Key Features
### Randomized Approach
- **Circuit variants**: Randomly sampled Trotter variants
- **Deterministic outcomes**: Each circuit yields deterministic state
- **Variance reduction**: No shot noise (unlike quantum hardware)
### Parallelization
- **Independent circuits**: Each instance can run in parallel
- **Scalable**: Linear speedup with compute resources
- **Load balancing**: Even distribution of circuit evaluations
### Robustness
- **Bond dimension**: More tolerant of truncation
- **Strong correlations**: Better for systems requiring truncation
- **Combination**: Compatible with existing algorithms
## Workflow
### Step 1: Circuit Generation
Generate ensemble of randomized shallow Trotter-variant circuits
### Step 2: Parallel Execution
Execute each circuit instance independently
### Step 3: Observable Evaluation
Compute observables for each circuit
### Step 4: Averaging
Average results across ensemble for unbiased estimate
### Step 5: Extension
Combine with other time evolution algorithms
## Algorithm Details
### MPS Representation
- Start with initial MPS
- Represent each circuit as tensor network
- Evolve MPS through circuit
### Randomized Sampling
- Sample Trotter variants randomly
- Avoid deterministic ordering
- Explore different error compensation paths
### Error Analysis
- Estimator variance from circuit sampling
- No additional shot noise
- Convergence with ensemble size
## Applications
### Quantum Many-Body Dynamics
- Spin systems
- Strongly correlated systems
- Nonequilibrium dynamics
### Quantum Simulation
- Benchmarking quantum hardware
- Verifying quantum algorithms
- Classical-quantum comparison
### Algorithm Development
- Time evolution algorithms
- Error mitigation strategies
- Parallel computing approaches
## Comparison
| Method | Gate Count | Parallelization | Robustness |
|--------|------------|-----------------|------------|
| Trotter MPS | Baseline | Limited | Moderate |
| MPS TE-PAI | 10^3x lower | Massive | High |
| Quantum TE-PAI | Hardware dependent | Shot noise | Hardware-limited |
## References
- **Paper**: arXiv:2604.13144 - "Quantum-inspired classical simulation through randomized time evolution"
- **Category**: Quantum Simulation / Classical Algorithms
## Related Skills
- tensor-network-simulation
- mps-time-evolution
- classical-quantum-simulation
Is 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!