TEBD
Time-evolving block decimation (TEBD) approximates a local propagator by small gates and applies each gate to an MPS, compressing afterward. Its two defining errors are independent: splitting a noncommuting Hamiltonian and discarding Schmidt components. Reducing the time step removes the former but can increase the number of truncations.
Required background. MPS compression gives the local update, and split-operator propagation gives the second-order product formula.
Even and odd bond evolution
Section titled “Even and odd bond evolution”For an open nearest-neighbor chain, let , where each group contains mutually disjoint bond terms. Include on-site terms exactly once, distributing them among adjacent bonds or treating them in a separate splitting. For time-independent ,
Each layer is a product of two-site gates. The local operator error is and, at fixed final time under suitable boundedness assumptions, the global splitting error is . The relevant constants involve commutators, so a small dimensionless alone is a conservative and often uninformative criterion for a long chain.
For time-dependent terms, midpoint evaluation can maintain second-order accuracy when combined with the symmetric sequence, but discontinuous pulses must be split at their discontinuities.
Applying a gate in canonical gauge
Section titled “Applying a gate in canonical gauge”Move the orthogonality center to the active bond and form . Apply
Reshape with row and column , SVD, truncate, and restore the canonical arrangement. Local orthonormality is essential: only then does the SVD tail measure state-norm loss. Avoid dividing by tiny old Schmidt coefficients in implementations that can instead move centers by QR or SVD.
In real time, each exact gate is unitary. Renormalizing after truncation keeps the state norm at one but hides discarded probability, so record the pre-renormalization loss separately.
An entangling two-site test
Section titled “An entangling two-site test”Take , , and . Exact evolution gives
There is only one bond and hence no splitting error. With , the algorithm should reproduce this state to gate-exponential and roundoff accuracy. Applying the entire gate for once and then compressing to discards half the Schmidt weight. Repeated smaller gates with rank-one compression after each gate follow a different approximate path. This test isolates compression from Trotter error and checks the complex phase of the off-diagonal amplitude.
A separate three-site test with noncommuting adjacent bonds is needed to test the expected second-order slope.
Convergence at a fixed final time
Section titled “Convergence at a fixed final time”First increase until the observable is insensitive to compression at the finest time steps of interest. Compare , , and ; the ratio of successive observable differences should approach four when a nonzero second-order leading error dominates. Repeat with larger to ensure the slope is not a cancellation of two errors.
For time-independent , monitor energy drift, but do not expect exact energy conservation from split gates. Compare local observables, connected correlations, and entanglement growth. The usable simulation time ends when those quantities lose convergence even if the norm remains exactly one.
Imaginary-time TEBD replaces by a negative real inverse-energy step. Gates are then nonunitary, normalization is intentional, and the ground-state projection needs its own convergence in projection time and step size.
Exercises
Section titled “Exercises”Why does a smaller time step not guarantee a better fixed- TEBD trajectory?
Solution
It decreases splitting error but increases the number of gate applications and SVD projections before the same final time. The sequence of projections changes the trajectory and can accumulate compression error. Convergence must therefore vary both and , rather than interpreting the time-step limit of a restricted manifold as the exact evolution.
References
Section titled “References”- Schollwöck, Ulrich, “The density-matrix renormalization group in the age of matrix product states,” Annals of Physics 326, 96–192 (2011), arXiv:1008.3477 — canonical gauges, contractions, and finite-chain algorithms.
- Vidal, Guifré, “Efficient simulation of one-dimensional quantum many-body systems,” Physical Review Letters 93, 040502 (2004), doi:10.1103/PhysRevLett.93.040502 — adaptive gate evolution of compressed states.