Pith. sign in

REVIEW 3 major objections 4 minor 25 references

Scalable Distributed Memory Implementation of the Quasi-Adiabatic Propagator Path Integral

T0 review · 3 major / 4 minor · reviewed 2026-08-07 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read A pre-merging algorithm cuts the largest intermediate tensor in MACGIC-QUAPI path-integral simulations by a factor of M², and a distributed MPI implementation with hash-map lookups runs full QUAPI simulations with up to 4.3 billion paths.

desk verdict Real algorithmic contribution with a load-bearing heuristic that needs direct validation before the memory-accuracy claim is taken on faith. read the letter →

arxiv 2506.03127 v1 pith:K6YH5UIC submitted 2025-06-03 quant-ph physics.chem-ph

Roman Ovcharenko , Benjamin P. Fingerhut This is my paper
classification quant-phphysics.chem-ph
keywords QUAPIMACGIC-QUAPInon-Markovianquantumdynamicsinfluencefunctionalstructuredenvironmentspin-bosonmodelMPIparallelizationpre-mergingalgorithm
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper tries to establish that the memory bottleneck of the quasi-adiabatic propagator path integral (QUAPI) method can be circumvented by merging path configurations one time step before propagation, using a shifted mask of size $\Delta k_{\rm eff}-1$ instead of the full mask. In the resulting pre-merging algorithm the largest intermediate tensor shrinks from $O(M^{2\Delta k_{\rm eff}+2})$ to $O(M^{2\Delta k_{\rm eff}})$ configurations, a factor of $M^2$ in memory, while the final path set is claimed to be the same; the equivalence is demonstrated numerically because it is not rigorously guaranteed. The accompanying distributed-memory implementation spreads paths over MPI processes, uses concurrent hash maps for constant-time lookup, and includes inter-process merging with load balancing, enabling full QUAPI simulations with up to $4.3\times 10^9$ paths. In the application, a two-level system coupled to a structured environment with a sharp resonance shows non-perturbative resonance splitting and vibrational sidebands that quasi-Markovian and perturbative treatments miss. If right, this makes numerically exact non-Markovian dynamics practical for regimes with long bath memory and strong structured coupling that previously sat beyond the memory wall.

What carries the argument

The load-bearing object is the propagator tensor $\Omega$: the set of forward and backward system paths through the memory window, each stored with a complex weight as a configuration. The new mechanism is pre-merging: before propagating from time $t-1$ to $t$, configurations are merged on a shifted mask of size $\Delta k_{\rm eff}-1$ (the original mask shifted by one time step), producing a smaller $\Omega(t-1, (\Delta k_{\rm eff}-1)\;\mathrm{merged})$ tensor; propagation then directly produces the $\Omega(t, \Delta k_{\rm eff}\;\mathrm{merged})$ tensor without ever forming the unmerged $\Omega(t)$. Configurations are stored in concurrent hash maps keyed by masked path, giving constant-time lookup, and the distributed version combines intra-process pre-merging with an all-to-all inter-process merge and pairwise load balancing so that paths are spread across nodes.

What would settle it

Compute the discretized influence coefficients for a chosen spectral density; if the coefficients at time lag $\Delta k_{\max}$ are not negligible relative to the zero-lag coefficient (say, greater than 1%), then pre-merging and post-merging should give observably different population trajectories. Running both algorithms in that regime and finding deviations beyond the reported convergence tolerance (about 0.0025 population) would show that the equivalence assumption fails.

Watch

Extended reading notes

Core claim

The central claim is that reordering the mask-merging step in MACGIC-QUAPI—applying a shifted mask of size $\Delta k_{\rm eff}-1$ to the previous time-step tensor before propagation, then propagating to recover the full $\Delta k_{\rm eff}$ mask—yields the same surviving configurations as the conventional post-propagation merge, while avoiding construction of the large unmerged $\Omega(t)$ tensor. Because the equivalence is not guaranteed analytically, the paper establishes it by comparing against reference post-merging simulations over a range of filter thresholds and shows maximum population deviations below $0.001$ and $0.01$ for the benchmark systems. On this basis the memory bottleneck of QUAPI changes from $O(M^{2\Delta k_{\rm eff}+2})$ to $O(M^{2\Delta k_{\rm eff}})$, a factor of $M^2$ reduction, and the distributed-memory MPI implementation with thread-level parallelism distributes the remaining paths over compute nodes. This enables full QUAPI simulations with up to $4.3\times 10^9$ paths and, for a structured-environment spin-boson model, resolves non-perturbative resonance splitting and vibrational sidebands that quasi-Markovian and perturbative treatments do not capture.

Load-bearing premise

Pre-merging assumes that combining paths one step before they are normally combined, using a slightly shorter memory window, leaves exactly the same set of surviving paths as the original order of operations; if that equivalence fails in some parameter regime, the memory savings come with an uncontrolled error.

Editorial extensions

If this is right

  • Full QUAPI runs with bath memory of 15–16 time steps, corresponding to $1.1\times 10^9$ and $4.3\times 10^9$ paths, become feasible by spreading the $\Omega$-tensor over compute nodes; peak memory per node scales roughly as $2.11/n$ times the single-node requirement.
  • The pre-merging implementation reproduces the reference post-merging population dynamics with maximum deviations below $0.001$ (3-state benchmark) and $0.01$ (7-state benchmark) across the studied filter threshold range.
  • For small or sparse masks the hash-map lookup makes the pre-merging implementation faster than the array-and-Radix-sort post-merging version (up to about 1.75 times for the 3-state system), while for large masks the timings are comparable.
  • Converged structured-environment dynamics require a memory time of $\Delta k_{\max}=12$ and a mask of $\Delta k_{\rm eff}=10$; truncating the memory to $\Delta k_{\max}=2$ (quasi-Markovian) reproduces only the first $\sim 10\Delta^{-1}$ of the dynamics.
  • Tuning the structured-mode frequency across resonance reveals peak splitting at $\Omega=\Delta$ (numerical $0.87\Delta$ and $1.15\Delta$ versus perturbative $0.82\Delta$ and $1.18\Delta$) and sidebands attributed to multi-vibrational excitations, which perturbative treatments do not predict.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • Editorial extension: the pre-merging reordering could be applied recursively, merging on masks of size $\Delta k_{\rm eff}-2$ and smaller before propagation, to trade further memory against a mildly different path set; the paper does not explore this.
  • Editorial extension: because the claim of path-set equivalence rests on influence coefficients at lags near $\Delta k_{\max}$ being negligible, a natural stress test is a bath with algebraically decaying or otherwise slowly decaying correlations, where the assumption should degrade and the comparison to post-merging would quantify the error.
  • Editorial extension: the hash-map lookup removes sensitivity to path ordering, which suggests the algorithm could map well onto accelerator hardware such as GPUs, where sorting-based lookup is inefficient; portability is not discussed in the paper.
  • Editorial extension: in the structured-environment application, the sideband positions and intensities are assigned to eigenstate differences of the extended system and should shift systematically with coupling $g$ and temperature $k_B T$; this is a testable prediction of the same implementation.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 4 minor

Summary. The paper presents a distributed-memory (MPI/TBB) implementation of the MACGIC-QUAPI path integral method and introduces a "pre-merging" algorithm intended to reduce the peak memory of the calculation. The key algorithmic idea is to merge the propagator tensor at time t-1 on a shifted mask of size DeltaKeff-1, then propagate, avoiding the transient unmerged tensor of size O(M^{2DeltaKeff+2}) that dominates the original post-merging implementation. The authors validate the pre-merging algorithm on 3-state and 7-state benchmark models against their earlier post-merging openMP implementation, analyze performance and memory scaling up to 20 nodes and 4.3e9 paths, and apply the implementation to a spin-boson model with a structured environment, reporting resonance splitting and sidebands that they attribute to non-perturbative system-bath effects.

Significance. If the central claims hold, the paper offers a practically useful step for QUAPI-type simulations: the transient memory bottleneck is reduced by a factor of M^2, and the MPI implementation distributes the remaining path set over many nodes, enabling simulations with billions of paths. The application to a structured environment is scientifically interesting and the spectral assignments are checked against independent eigenstate differences, which is a strength. The convergence analysis in Section 4.3.1 is also commendably thorough. The main weakness is that the load-bearing pre-merging equivalence is only validated through population traces, not through the configuration sets that the memory-scaling argument is about; this needs direct verification before the central claim can be considered established.

major comments (3)
  1. [Section 3.1] The central claim that pre-merging on the shifted (DeltaKeff-1) mask followed by one propagation step yields the same set of configurations as post-merging is not rigorously proven, and the paper explicitly concedes this. The validation in Section 4.1 compares only time-dependent populations (Fig. 1a,b) against the post-merging reference. This is mismatched to the claim: the memory-scaling argument concerns the size and identity of the configuration set, and many different sets of paths can yield nearly identical reduced dynamics, especially when filtering is active. Please provide a direct comparison of the internal configuration sets between the pre- and post-merging implementations at representative time steps: for example, the multiset of keys, the per-key path counts, and the accumulated weights. This should be done over a range of mask sizes and filter thresholds, including cases with small DeltaKeff where the shifted mask is most aggressive.
  2. [Figure 3 and Section 3.2] The caption of Fig. 3 states that the scaling simulations are performed in the "full QUAPI regime, i.e., no mask merging or filtering have been employed." This is in tension with Section 3.1, where the distributed implementation is described as always performing pre-merging with the shifted (DeltaKeff-1) mask. Please clarify whether pre-merging was disabled in these runs, and if so, how this is possible within the described algorithm, or whether the scaling curves do include the pre-merging approximation. The interpretation of the measured speedups and memory usage depends on this point.
  3. [Section 4.3 and Section 4.3.1] The structured-environment simulations use parameters (Deltakmax=12, DeltaKeff=10, Nvib=4, theta=1e-9) that are not covered by the Section 4.1 benchmarks, which use DeltaKeff=4, 6, and 16 on the 3- and 7-state models with Deltakmax=32. The convergence checks in Fig. 6 vary parameters within the pre-merging implementation only and do not compare against a post-merging reference. Given that the structured environment has slowly oscillatory influence coefficients, the assumption that the time lag discarded by the shifted mask is negligible is precisely the point that needs direct verification. Without such verification, the reported resonance splitting and sidebands could in principle be influenced by the pre-merging approximation rather than by the physical system-bath interaction.
minor comments (4)
  1. [Abstract and Section 3.1] The abstract states that the largest intermediate data structure is reduced from O(M^{2DeltaKeff+2}) to O(M^{2(DeltaKeff-1)}), but Section 3.1 says the largest structures in the new algorithm are of size O(M^{2(DeltaKeff-1)}) and O(M^{2DeltaKeff}), so the largest after propagation is O(M^{2DeltaKeff}). Please harmonize the two statements; the reduction factor is M^2 relative to the original transient, not M^4.
  2. [Throughout] There are several typographical errors and minor inconsistencies, including "protocoll", "MAGCIC-QAUPI" in Scheme 4, "ash-table" in Section 4.1, and a duplicated "Scheme 2" label. A careful proofreading pass is recommended.
  3. [Section 4.1] The accuracy comparison in Fig. 1 conflates three changes at once: pre-merging versus post-merging, hash-map versus array data structures, and TBB versus openMP parallelization. A cleaner validation would isolate the pre-merging approximation, for example by implementing the same pre-merging logic on an array data structure or by comparing to a post-merging run using the same hash map and TBB framework.
  4. [Availability] The paper does not state whether the code or benchmark data are publicly available. For a computational methods paper, making the implementation available (or at least providing input files and representative output) would substantially improve reproducibility.

Circularity Check

0 steps flagged · score 1.0 of 10

No circular construction: the pre-merging scheme is an explicitly admitted heuristic validated against the prior post-merging implementation, not a quantity defined in terms of its own predicted output; the spectral assignments are cross-checked against independent eigenstate differences.

full rationale

The paper's central new claim is that its pre-merging algorithm reduces the largest intermediate data structure by a factor of M^2 while preserving numerical accuracy. This claim is not circular. The paper explicitly states the assumption: 'After the propagation step at time t, the tensor Omega(t, DeltaKeff-merged) should contain the same configurations as the original post-merging implementation. As this is not rigorously guaranteed, numerical accuracy and stability of the pre-merging algorithm is demonstrated in Sec. 4.1.' This is a heuristic approximation whose validity is an empirical question, not an identity established by construction. The numerical validation compares the pre-merging implementation against the original post-merging MACGIC-QUAPI implementation from Refs. 27 and 28, which is a legitimate reference implementation. The fact that the reference comes from the same group is a minor self-citation concern, but it is not load-bearing circularity because the reference algorithm is not derived from the pre-merging claim and was itself validated in prior work. The structured-environment results are checked against independent quantities: the observed peak splittings are assigned to exact eigenstate differences of the extended system Hamiltonian (e.g., E1-E0 = 0.82Delta and E2-E0 = 1.18Delta), and the detuning dependence is compared with first-order perturbation theory. No fitted parameter is renamed as a prediction. The skeptical concern that population traces do not fully certify the identity of internal configuration sets is a validation gap or correctness risk, not a circularity: the paper does not define 'accuracy' in terms of the very populations it predicts, and no equation reduces the pre-merging output to the observables used to test it. Accordingly, no specific circular step can be exhibited, and the score is low.

Assumptions & free parameters 5 free parameters · 5 assumptions · 0 invented entities

No new physical entities are introduced; the reaction coordinate is a known mapping. The free parameters are numerical and physical inputs chosen by convergence studies, not fitted to reproduce a target result. The key ad hoc assumption is the pre-merging equivalence, which directly supports the memory-reduction claim.

free parameters (5)
  • Filter threshold theta = 10^-9 (chosen, not fit)
    Chosen for the main simulations; Fig. 6(d) shows an error near 0.006 for theta=10^-9, and normalization loss is about 0.2%.
  • Memory time DeltaKmax = 12 time steps (chosen from convergence)
    Selected from Fig. 6(a); errors decrease from ~0.01 for DeltaKmax=10 to <0.0025 for DeltaKmax=12.
  • Mask size DeltaKeff = 10 (chosen from convergence)
    Selected from Fig. 6(b); gives converged dynamics on the order of 0.0075.
  • HO basis truncation Nvib = 4 (chosen from convergence)
    Selected from Fig. 6(c); error ~0.04 for Nvib=4, the largest source of convergence error.
  • Trotter step and Ohmic cutoff = Delta t = 0.06/Delta, omega_c = 10*Delta
    Taken from Ref. 42 and confirmed sufficiently converged in the text; standard numerical discretization parameters.
assumptions (5)
  • domain assumption Finite memory time: bath correlations vanish beyond tau = DeltaKmax*Delta t
    QUAPI truncates memory at DeltaKmax; for the structured environment, influence coefficients decay slowly (memory spans ~228 steps until 1% of zero-lag), so convergence in DeltaKmax must be checked.
  • standard math Symmetric Trotter splitting is exact in the limit Delta t -> 0
    Equations 6-8 rely on Trotter splitting; the paper confirms convergence with Delta t but does not prove it for all regimes.
  • domain assumption Reaction-coordinate mapping from Eq. 10 to Eq. 11 is faithful
    The structured environment is mapped to a primary mode plus Ohmic bath via Ref. 42; the parameter correspondence (including kappa=0.056) is not derived or numerically verified in this paper.
  • domain assumption Factorized initial conditions for the reduced density matrix
    Equation 2 assumes the system and bath are initially uncorrelated, a standard but restrictive assumption in QUAPI simulations.
  • ad hoc to paper Pre-merging on a shifted smaller mask preserves post-merging configurations
    The algorithm relies on this equivalence, which the paper explicitly states is not rigorously guaranteed and is only demonstrated empirically in Section 4.1.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Scalable Distributed Memory Implementation of the Quasi-Adiabatic Propagator Path Integral." pith.science (2026). https://pith.science/paper/K6YH5UIC

@misc{pith2026250603127,
  author       = {Pith},
  title        = {Pith review of: Scalable Distributed Memory Implementation of the Quasi-Adiabatic Propagator Path Integral},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/K6YH5UIC}},
  note         = {Machine review of arXiv:2506.03127}
}
read the original abstract

The accurate simulation of dissipative quantum dynamics subject to a non-Markovian environment poses persistent numerical challenges, in particular for structured environments where sharp mode resonances induce long-time system bath correlations. We present a scalable distributed memory implementation of the Mask Assisted Coarse Graining of Influence Coefficients (MACGIC) - Quasi-Adiabatic Propagator Path Integral (-QUAPI) method that exploits the memory resources of multiple compute nodes and mitigates the memory bottleneck of the method via a new pre-merging algorithm while preserving numerical accuracy. The distributed memory implementation spreads the paths over the computing nodes by means of the MPI protocoll and efficient high level path management is achieved via an implementation based on hash maps. The efficiency of the new implementation is demonstrated in large-scale dissipative quantum dynamics simulations that account for the coupling to a structured non-Markovian environment containing a sharp resonance, a setup for which convergence properties are investigated in depth. Broad applicability and the non-perturbative nature of the simulation method is illustrated via the tuning of the mode resonance frequency of the structured environment with respect to the system frequency. The simulations reveal a splitting of resonances due to strong system-environment interaction and the emergence of sidebands due to multi-excitations of the bosonic mode that are not accounted for in perturbative approaches. The simulations demonstrate the versatility of the new MACGIC-QUAPI method in the presence of strong non-Markovian system bath correlations.

Figures

Figures reproduced from arXiv: 2506.03127 by the authors.

Figure 1
Figure 1. Non-equilibrium dynamics of the 3-state system (a) and 7-state system (b), panels [PITH_FULL_IMAGE:figures/full_fig_p021_1.png] view at source ↗
Figure 2
Figure 2. Relative timing with respect to filter threshold [PITH_FULL_IMAGE:figures/full_fig_p022_2.png] view at source ↗
Figure 3
Figure 3. Numerical performance (a) and peak memory usage (b) for varying number of [PITH_FULL_IMAGE:figures/full_fig_p024_3.png] view at source ↗
Figures from the paper (4 more)
Figure 4
Figure 4. Figure 4: Numerical performance (a) and peak memory usage per computing node (b), all [PITH_FULL_IMAGE:figures/full_fig_p025_4.png]
Figure 5
Figure 5. Figure 5: Converged dynamics (red) and quasi-Markovian dynamics (black) of the TLS in the [PITH_FULL_IMAGE:figures/full_fig_p029_5.png]
Figure 6
Figure 6. Figure 6: Parameter convergence with respect to bath memory time ∆ [PITH_FULL_IMAGE:figures/full_fig_p031_6.png]
Figure 7
Figure 7. Figure 7: System dynamics in the time (a) and frequency (b) domains for varying HO [PITH_FULL_IMAGE:figures/full_fig_p032_7.png]

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

25 extracted references · 25 canonical work pages

  1. [1]

    Improved Feynman propagators on a grid and non-adiabatic corrections within the path integral framework

    37 (34) Makri, N. Improved Feynman propagators on a grid and non-adiabatic corrections within the path integral framework. Chem. Phys. Lett. 1992, 193,

    work page 1992

  2. [72]

    Filtered propagator functional for iterative dynamics of quantum dissipative systems

    (29) Sim, E.; Makri, N. Filtered propagator functional for iterative dynamics of quantum dissipative systems. Comput. Phys. Commun. 1997, 99,

    work page 1997

  3. [101]

    Nonperturbative expansion method for a quantum system coupled to a harmonic-oscillator bath

    (18) Tanimura, Y. Nonperturbative expansion method for a quantum system coupled to a harmonic-oscillator bath. Phys. Rev. A 1990, 41,

    work page 1990

  4. [118]

    Time Evolution of a Quantum System in Contact with a Nearly Gaussian-Markoffian Noise Bath

    (17) Tanimura, Y.; Kubo, R. Time Evolution of a Quantum System in Contact with a Nearly Gaussian-Markoffian Noise Bath. J. Phys. Soc. Jpn. 1989, 58,

    work page 1989

  5. [333]

    N.; Ambegaokar, V

    (43) Garg, A.; Onuchic, J. N.; Ambegaokar, V. Effect of friction on electron transfer in biomolecules. J. Chem. Phys. 1985, 83,

    work page 1985

  6. [335]

    A scalable algorithm of numerical real-time path integral for quantum dissi- pative systems

    (30) Sato, Y. A scalable algorithm of numerical real-time path integral for quantum dissi- pative systems. J. Chem. Phys. 2019, 150, 224108. (31) Topaler, M.; Makri, N. System-specific discrete variable representations for path inte- gral calculations with quasi-adiabatic propagators. Chem. Phys. Lett. 1993, 210,

    work page 2019

  7. [357]

    H.; Ter Haar, A

    (5) Van der Wal, C. H.; Ter Haar, A. C. J.; Wilhelm, F. K.; Schouten, R. N.; Harmans, C. J. P. M.; Orlando, T. P.; Lloyd, S.; Mooij, J. E. Quantum Superposition of Macroscopic Persistent-Current States. Science 2000, 290,

    work page 2000

  8. [367]

    P.; Vernon, J

    (16) Feynmann, R. P.; Vernon, J. F. L. The Theory of a general quantum system interacting with a linear dissipative system. Ann. Phys. 1963, 24,

    work page 1963

Show all 25 references
  1. [435]

    Numerical path integral techniques for long-time quantum dynamics of quan- tum dissipative systems

    (35) Makri, N. Numerical path integral techniques for long-time quantum dynamics of quan- tum dissipative systems. J. Math. Phys. 1995, 36,

    1995

  2. [448]

    O.; Leggett, A

    (32) Caldeira, A. O.; Leggett, A. J. Path integral approach to quantum Brownian motion. Physica A 1983, 121,

    1983

  3. [482]

    Path integral renormalization for quantum dissipative dynamics with multiple timescales

    (38) Makri, N. Path integral renormalization for quantum dissipative dynamics with multiple timescales. Mol. Phys. 2012, 110,

    2012

  4. [587]

    J.; Chakravarty, S.; Dorsey, A

    (33) Leggett, A. J.; Chakravarty, S.; Dorsey, A. T.; Fisher, M. P. A.; Garg, A.; Zwerger, M. Dynamics of the dissipative two-state system. Rev. Mod. Phys. 1987, 59,

    1987

  5. [773]

    Coherent quantum dynamics of a superconducting flux qubit

    (6) Chiorescu, I.; Nakamura, Y.; Harmans, K.; Mooij, J. Coherent quantum dynamics of a superconducting flux qubit. Science 2003, 299,

    2003

  6. [1001]

    Quantum dynamics for a system coupled to slow baths: On-the-fly filtered propagator method

    (39) Sim, E. Quantum dynamics for a system coupled to slow baths: On-the-fly filtered propagator method. J. Chem. Phys. 2001, 115, 4450–4456. (40) https://software.intel.com/content/www/us/en/develop/tools/ threading-building-blocks.html . (41) Chin, A. W.; Prior, J.; Rosenbac...

    2001

  7. [1967]

    36 (23) Strathearn, A.; Kirton, P.; Kilda, D.; Keeling, J.; Lovett, B. W. Efficient non-Markovian quantum dynamics using time-evolving matrix product operators.Nat. Commun. 2018, 9,

    2018

  8. [1999]

    Exciton Dissociation at Thiophene/Fullerene Interfaces: The Electronic Structures and Quantum Dynamics.J

    (8) Tamura, H.; Burghardt, I.; Tsukada, M. Exciton Dissociation at Thiophene/Fullerene Interfaces: The Electronic Structures and Quantum Dynamics.J. Phys. Chem. C 2011, 115, 10205–10210. (9) de Vega, I.; Alonso, D. Dynamics of non-Markovian open quantum systems. Rev. Mod. Phys...

    2011

  9. [2011]

    Quantum-state engineering with Josephson- junction devices

    (4) Makhlin, Y.; Sch¨ on, G.; Shnirman, A. Quantum-state engineering with Josephson- junction devices. Rev. Mod. Phys. 2001, 73,

    2001

  10. [2430]

    Path integral simulation of charge transfer dynamics in photosyn- thetic reaction centers

    (36) Sim, E.; Makri, N. Path integral simulation of charge transfer dynamics in photosyn- thetic reaction centers. J. Phys. Chem. 1997, 101,

    1997

  11. [2905]

    Environmental dynamics, correlations, and the emergence of noncanonical equilibrium states in open quantum systems

    38 (45) Iles-Smith, J.; Lambert, N.; Nazir, A. Environmental dynamics, correlations, and the emergence of noncanonical equilibrium states in open quantum systems. Phys. Rev. A 2014, 90, 032114. 39

    2014

  12. [3322]

    The density-matrix renormalization group in the age of matrix product states

    (24) Schollw¨ ock, U. The density-matrix renormalization group in the age of matrix product states. Ann. Phys. 2011, 326, 96–192, January 2011 Special Issue. (25) Or´ us, R. A practical introduction to tensor networks: Matrix product states and pro- jected entangled pair state...

    2011

  13. [4491]

    Controlling decoherence of a two-level-atom in a lossy cavity

    (44) Thorwart, M.; Hartmann, L.; Goychuk, I.; H¨ anggi, P. Controlling decoherence of a two-level-atom in a lossy cavity. J. Mod. Opt. 2000, 47,

    2000

  14. [4600]

    (21) Makri, N.; Makarov, D. E. Tensor propagator for iterative quantum time evolution of reduced density matrices. II. Numerical methodology. J. Chem. Phys. 1995, 102,

    1995

  15. [4611]

    Memory propagator matrix for long-time dissipative charge transfer dynamics

    (22) Lambert, R.; Makri, N. Memory propagator matrix for long-time dissipative charge transfer dynamics. Mol. Phys. 2012, 110,

    2012

  16. [5446]

    E.; Makri, N

    (37) Makarov, D. E.; Makri, N. Path integrals for dissipative systems by tensor multiplica- tion. Condensed phase quantum dynamics for arbitrarily long time. Chem. Phys. Lett. 1994, 221,

    1994

  17. [6676]

    Numerically “exact”approach to open quantum dynamics: The hierar- chical equations of motion (HEOM)

    (19) Tanimura, Y. Numerically “exact”approach to open quantum dynamics: The hierar- chical equations of motion (HEOM). J. Chem. Phys. 2020, 153, 020901. (20) Makri, N.; Makarov, D. E. Tensor propagator for iterative quantum time evolution of reduced density matrices. I. Theory...

    2020

Pith tools

Reviewed August 7, 2026 · model on record in the stance chip above.