pith. sign in

arxiv: 2506.11341 · v4 · submitted 2025-06-12 · ❄️ cond-mat.stat-mech · physics.chem-ph· physics.comp-ph· quant-ph

The Integral Decimation Method for Quantum Dynamics and Statistical Mechanics

Ryan T. Grimm , Alexander J. Staat , Joel D. Eaves This is my paper

Pith reviewed 2026-05-19 09:02 UTC · model grok-4.3

classification ❄️ cond-mat.stat-mech physics.chem-phphysics.comp-phquant-ph
keywords integral decimationspectral tensor trainmultidimensional integralscurse of dimensionalityquantum gatespartition functiondensity matrixstatistical mechanics
0
0 comments X

The pith

A quantum-inspired algorithm decomposes multidimensional integrands into spectral tensor trains to compute integrals with polynomial rather than exponential cost.

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

The paper introduces integral decimation, a method that builds a spectral tensor train representation of a multidimensional integrand by sequentially applying quantum gates, each incorporating more degrees of freedom. This decomposition allows for the systematic removal of small contributions through decimation while maintaining accuracy. As a result, problems that suffer from the curse of dimensionality in direct integration become tractable with polynomial scaling. The method is applied to calculate partition functions, free energies, and entropies in statistical mechanics as well as time-dependent density matrices in quantum systems.

Core claim

The integral decimation method constructs a spectral tensor train representation of the integrand by applying a sequence of quantum gates, where each gate corresponds to an interaction that involves increasingly more degrees of freedom in the action. This changes the computational complexity of integration from exponential to polynomial and numerically factorizes an interacting system into a product of non-interacting ones, as shown in evaluations of the absolute free energy and entropy of a chiral XY model and the nonequilibrium time-dependent reduced density matrix of a quantum chain.

What carries the argument

The spectral tensor train, formed as a product of matrix-valued functions in an analytically differentiable and integrable spectral basis, built through successive quantum-gate applications that enable decimation of small terms.

Load-bearing premise

The integrand must admit an accurate decomposition into a product of matrix-valued functions in a spectral basis that is analytically differentiable and integrable, so that decimating small contributions preserves the integral value.

What would settle it

Running the method on a multidimensional integral with a known exact value, such as the partition function of a solvable model, and checking if the numerical result matches the exact one within the claimed precision.

Figures

Figures reproduced from arXiv: 2506.11341 by Alexander J. Staat, Joel D. Eaves, Ryan T. Grimm.

Figure 1
Figure 1. Figure 1: A diagram for the conversion of the weight [PITH_FULL_IMAGE:figures/full_fig_p004_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: Converting between discrete and spectral ten [PITH_FULL_IMAGE:figures/full_fig_p005_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: Constructing ⟨O[ξ]⟩ in ID. (a) Contract the network layer by layer, applying the time-evolving block decimation (TEBD) procedure sequentially. TEBD reduces the bond dimension by discarding singular values below a threshold ϵSVD. Contracting the network results in an MPS for the coefficients of the integral weight in a spectral basis. (b) Integration (hemispherical caps) along various xn variables is straig… view at source ↗
Figure 4
Figure 4. Figure 4: Illustration of the spectral tensor train (STT) decomposition of a two-dimensional, Gaussian function [PITH_FULL_IMAGE:figures/full_fig_p007_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: Thermodynamics of the classical XY model with [PITH_FULL_IMAGE:figures/full_fig_p009_5.png] view at source ↗
Figure 6
Figure 6. Figure 6: Population dynamics from ID compared to perturbative and numerically exact quantum dynamics methods [PITH_FULL_IMAGE:figures/full_fig_p011_6.png] view at source ↗
Figure 7
Figure 7. Figure 7: Population dynamics from Q-ASPEN for the [PITH_FULL_IMAGE:figures/full_fig_p012_7.png] view at source ↗
read the original abstract

The solutions to many problems in the mathematical, computational, and physical sciences often involve multidimensional integrals. A direct numerical evaluation of the integral incurs a computational cost that is exponential in the number of dimensions, a phenomenon called the curse of dimensionality. The problem is so substantial that one usually employs sampling methods, like Monte Carlo, to avoid integration altogether. Here, we derive and implement a quantum-inspired algorithm to decompose a multidimensional integrand into a product of matrix-valued functions -- a spectral tensor train -- changing the computational complexity of integration from exponential to polynomial. The algorithm constructs a spectral tensor train representation of the integrand by applying a sequence of quantum gates, where each gate corresponds to an interaction that involves increasingly more degrees of freedom in the action. Because it allows for the systematic elimination of small contributions to the integral through decimation, we call the method integral decimation. The functions in the spectral basis are analytically differentiable and integrable, and in applications to the partition function, integral decimation numerically factorizes an interacting system into a product of non-interacting ones. We illustrate integral decimation by evaluating the absolute free energy and entropy of a chiral XY model as a continuous function of temperature. We also compute the nonequilibrium time-dependent reduced density matrix of a quantum chain with between two and forty levels, each coupled to colored noise. When other methods provide numerical solutions to these models, they quantitatively agree with integral decimation. When conventional methods become intractable, integral decimation can be a powerful alternative.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 3 minor

Summary. The paper claims to derive a quantum-inspired 'integral decimation' method that represents multidimensional integrands as spectral tensor trains via a sequence of quantum gates, each corresponding to interactions involving more degrees of freedom. This allows decimation of small contributions, reducing the integration cost from exponential to polynomial in the number of dimensions. Applications include computing the free energy and entropy of the chiral XY model versus temperature and the reduced density matrix for 2-40 site quantum chains with colored noise, with claimed quantitative agreement to other methods where feasible.

Significance. Should the method reliably maintain low bond dimensions in the tensor train for a broad class of integrands, it would offer a significant advance in computing high-dimensional integrals relevant to statistical mechanics and quantum dynamics, bypassing the curse of dimensionality and sampling methods. The factorization of interacting systems into non-interacting ones and the numerical results on models where conventional methods fail are promising strengths. The approach builds on analytically integrable bases and gate sequences, which could be extended further.

major comments (2)
  1. [Algorithm derivation] The central claim that the complexity becomes polynomial relies on the tensor-train bond dimension remaining bounded independent of the number of dimensions. However, while the construction from product of matrix-valued functions and decimation is described, no general bound or scaling of the bond dimension with system size is provided or proven. This makes the polynomial scaling conditional on the integrand having low effective rank in the spectral basis, which is only demonstrated numerically for the specific XY and quantum chain cases rather than generally established.
  2. [Numerical examples] In the applications to the quantum chain with up to 40 sites, the results are said to agree with other methods for smaller sizes, but the manuscript does not include error bars, convergence studies with respect to the decimation threshold, or analysis of how the bond dimension scales with the number of sites, which is necessary to support the extension to larger intractable cases.
minor comments (3)
  1. [Abstract] The abstract states that results 'quantitatively agree' with other methods but does not specify the quantitative measures used or reference the relevant figures/tables for comparison.
  2. [Presentation] Consider adding a table or plot showing the bond dimension as a function of the number of dimensions or sites to illustrate the claimed polynomial scaling.
  3. [References] The manuscript could benefit from additional citations to prior work on tensor-train decompositions for high-dimensional integration or quantum-inspired numerical methods.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for their careful reading of the manuscript and for highlighting these important points regarding the theoretical foundations and numerical validation of the integral decimation method. We address each major comment below and describe the planned revisions.

read point-by-point responses

  1. Referee: [Algorithm derivation] The central claim that the complexity becomes polynomial relies on the tensor-train bond dimension remaining bounded independent of the number of dimensions. However, while the construction from product of matrix-valued functions and decimation is described, no general bound or scaling of the bond dimension with system size is provided or proven. This makes the polynomial scaling conditional on the integrand having low effective rank in the spectral basis, which is only demonstrated numerically for the specific XY and quantum chain cases rather than generally established.

    Authors: We agree that the manuscript does not establish a general, problem-independent bound on the bond dimension that would rigorously guarantee polynomial scaling for arbitrary integrands. The polynomial complexity is indeed conditional on the integrand admitting a sufficiently low-rank representation in the spectral basis, which is a property we observe numerically for the models studied. In the revised manuscript we will add explicit statements in the introduction and discussion sections clarifying this dependence, analogous to the entanglement assumptions underlying tensor-network methods. We will also report the observed bond-dimension growth in the numerical sections to illustrate the scaling for the specific classes of integrands considered. A universal proof for all possible integrands lies outside the scope of the present work. revision: partial

  2. Referee: [Numerical examples] In the applications to the quantum chain with up to 40 sites, the results are said to agree with other methods for smaller sizes, but the manuscript does not include error bars, convergence studies with respect to the decimation threshold, or analysis of how the bond dimension scales with the number of sites, which is necessary to support the extension to larger intractable cases.

    Authors: We acknowledge the absence of error bars, systematic convergence studies with respect to the decimation threshold, and explicit bond-dimension scaling analysis for the quantum-chain examples. In the revised manuscript we will include error estimates on all reported quantities, add convergence plots or tables versus the decimation threshold, and provide an analysis (including figures) of how the bond dimension grows with the number of sites. These additions will directly support the extension of the method to larger systems where conventional approaches become intractable. revision: yes

Circularity Check

0 steps flagged

No significant circularity; derivation is self-contained from gate sequences and tensor-train construction.

full rationale

The paper presents integral decimation as a direct construction: a sequence of quantum-gate operations applied to an integrand expressed in an analytically integrable spectral basis yields a tensor-train factorization whose contraction cost is polynomial when bond dimension remains modest. No equation or step reduces the reported integral value to a fitted parameter or self-referential quantity by construction. The assumption that effective rank stays small for the chosen models is stated explicitly as a property of the integrand class rather than derived from the output itself. Numerical comparisons to known results (partition functions, reduced density matrices) serve as external validation, not as inputs that are renamed as predictions. No load-bearing self-citation chain or uniqueness theorem imported from prior author work is invoked to force the central claim. The method therefore remains non-circular under the enumerated patterns.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The central claim rests on the assumption that any relevant integrand can be represented to sufficient accuracy by a spectral tensor train constructed from sequential gate operations; no explicit free parameters or new physical entities are introduced in the abstract.

axioms (1)
  • domain assumption The integrand admits a decomposition into a product of matrix-valued functions via a sequence of quantum-gate operations on an increasing number of degrees of freedom.
    This decomposition is the load-bearing step that converts exponential to polynomial cost.

pith-pipeline@v0.9.0 · 5812 in / 1339 out tokens · 40638 ms · 2026-05-19T09:02:34.059786+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

63 extracted references · 63 canonical work pages

  1. [1]

    Simulating quantum circuits using tree ten- sor networks

    Philipp Seitz, Ismael Medina, Esther Cruz, Qunsheng Huang, and Christian B Mendl. “Simulating quantum circuits using tree ten- sor networks”. Quantum 7, 964 (2023). arXiv:2206.01000v3

    work page arXiv 2023

  2. [2]

    Density matrix formulation for quantum renormalization groups

    S R White. “Density matrix formulation for quantum renormalization groups”. Phys. Rev. Lett.69, 2863–2866 (1992)

    work page 1992

  3. [3]

    Efficient non-Markovian quantum dynamics using time-evolving ma- trix product operators

    A Strathearn, P Kirton, D Kilda, J Keeling, and B W Lovett. “Efficient non-Markovian quantum dynamics using time-evolving ma- trix product operators”. Nat. Commun.9, 3322 (2018)

    work page 2018

  4. [4]

    Direct Numerical Solutions to Stochastic Differen- tial Equations with Multiplicative Noise

    Ryan T Grimm and Joel D Eaves. “Direct Numerical Solutions to Stochastic Differen- tial Equations with Multiplicative Noise”. Phys. Rev. Lett.132, 267101 (2024)

    work page 2024

  5. [5]

    Tensor net- works enable the calculation of turbulence probability distributions

    Nikita Gourianov, Peyman Givi, Dieter Jaksch, and Stephen B Pope. “Tensor net- works enable the calculation of turbulence probability distributions”. Sci. Adv. 11, eads5990 (2025)

    work page 2025

  6. [6]

    Ten- sor renormalization group approach to two- dimensional classical lattice models

    Michael Levin and Cody P Nave. “Ten- sor renormalization group approach to two- dimensional classical lattice models”. Phys. Rev. Lett.99, 120601 (2007)

    work page 2007

  7. [7]

    The the- ory of a general quantum system interacting with a linear dissipative system

    R P Feynman and F L Vernon. “The the- ory of a general quantum system interacting with a linear dissipative system”. Ann. Phys. 24, 118–173 (1963)

    work page 1963

  8. [8]

    Sta- tistical dynamics of classical systems

    P C Martin, E D Siggia, and H A Rose. “Sta- tistical dynamics of classical systems”. Phys. Rev. A8, 423–437 (1973)

    work page 1973

  9. [9]

    Spectral Tensor-Train Decomposition

    Daniele Bigoni, Allan P Engsig-Karup, and Youssef M Marzouk. “Spectral Tensor-Train Decomposition”. SIAM J. Sci. Comput.38, A2405–A2439 (2016)

    work page 2016

  10. [10]

    A continuous analogue of the tensor-train decomposition

    Alex Gorodetsky, Sertac Karaman, and Youssef Marzouk. “A continuous analogue of the tensor-train decomposition”. Com- put. Methods Appl. Mech. Eng. 347, 59– 84 (2019)

    work page 2019

  11. [11]

    Learning ten- sor networks with tensor cross interpolation: New algorithms and libraries

    Yuriel Núñez Fernández, Marc K Ritter, Matthieu Jeannin, Jheng-Wei Li, Thomas Kloss, Thibaud Louvet, Satoshi Terasaki, 13 Olivier Parcollet, Jan von Delft, Hiroshi Shi- naoka, and Xavier Waintal. “Learning ten- sor networks with tensor cross interpolation: New algorithms and libraries”. SciPost Phys. 18, 104 (2025)

    work page 2025

  12. [12]

    Effi- cient computation of highly oscillatory inte- grals by using QTT tensor approximation

    Boris Khoromskij and Alexander Veit. “Effi- cient computation of highly oscillatory inte- grals by using QTT tensor approximation”. J. Comput. Methods Appl. Math.16, 145– 159 (2016)

    work page 2016

  13. [13]

    Real-time evolution of Ander- son impurity models via tensor network in- fluence functionals

    Nathan Ng, Gunhee Park, Andrew J Mil- lis, Garnet Kin-Lic Chan, and David R Reichman. “Real-time evolution of Ander- son impurity models via tensor network in- fluence functionals”. Phys. Rev. B 107, 125103 (2023)

    work page 2023

  14. [14]

    Criticality, the area law, and the computational power of projected entangled pair states

    F Verstraete, M M Wolf, D Perez-Garcia, and J I Cirac. “Criticality, the area law, and the computational power of projected entangled pair states”. Phys. Rev. Lett.96, 220601 (2006)

    work page 2006

  15. [15]

    Ten- sor renormalization group study of the three- dimensional O (2) model

    Jacques Bloch, Raghav G Jha, Robert Lohmayer, and Maximilian Meister. “Ten- sor renormalization group study of the three- dimensional O (2) model”. Phys. Rev. D 104, 094517 (2021)

    work page 2021

  16. [16]

    Ten- sor renormalization group approach to ( 1+1 )-dimensional SU(2) principal chiral model at finite density

    Xiao Luo and Yoshinobu Kuramashi. “Ten- sor renormalization group approach to ( 1+1 )-dimensional SU(2) principal chiral model at finite density”. Phys. Rev. D107, 094509 (2023)

    work page 2023

  17. [17]

    Tensor network approach to the two- dimensional fully frustrated XY model and a chiral ordered phase

    Feng-Feng Song and Guang-Ming Zhang. “Tensor network approach to the two- dimensional fully frustrated XY model and a chiral ordered phase”. Phys. Rev. B105, 134516 (2022)

    work page 2022

  18. [18]

    Using hyperoptimized tensor networks and first-principles electronic structure to simu- late the experimental properties of the giant {Mn84} torus

    Dian-Teng Chen, Phillip Helms, Ashlyn R Hale, Minseong Lee, Chenghan Li, John- nie Gray, George Christou, Vivien S Zapf, Garnet Kin-Lic Chan, and Hai-Ping Cheng. “Using hyperoptimized tensor networks and first-principles electronic structure to simu- late the experimental properties of the giant {Mn84} torus”. J. Phys. Chem. Lett.13, 2365–2370 (2022)

    work page 2022

  19. [19]

    Tensor renormal- ization group study of classical XY model on the square lattice

    J F Yu, Z Y Xie, Y Meurice, Yuzhi Liu, A Denbleyker, Haiyuan Zou, M P Qin, J Chen, and T Xiang. “Tensor renormal- ization group study of classical XY model on the square lattice”. Phys. Rev. E 89, 013308 (2014)

    work page 2014

  20. [20]

    Learning Feynman Diagrams with Ten- sor Trains

    Yuriel Núñez Fernández, Matthieu Jeannin, Philipp T Dumitrescu, Thomas Kloss, Jason Kaye, Olivier Parcollet, and Xavier Wain- tal. “Learning Feynman Diagrams with Ten- sor Trains”. Phys. Rev. X12, 041018 (2022)

    work page 2022

  21. [21]

    Parallel cross interpolation for high- precision calculation of high-dimensional integrals

    Sergey Dolgov and Dmitry Savostyanov. “Parallel cross interpolation for high- precision calculation of high-dimensional integrals”. Comput. Phys. Commun.246, 106869 (2020)

    work page 2020

  22. [22]

    TT-cross approximation for multidimen- sional arrays

    Ivan Oseledets and Eugene Tyrtyshnikov. “TT-cross approximation for multidimen- sional arrays”. Linear Algebra Appl.432, 70–88 (2010)

    work page 2010

  23. [23]

    Fast adaptive interpolation of multi- dimensional arrays in tensor train format

    Dmitry Savostyanov and Ivan Oseledets. “Fast adaptive interpolation of multi- dimensional arrays in tensor train format”. In The 2011 International Workshop on Multidimensional (nD) Systems. Pages 1–8. IEEE (2011)

    work page 2011

  24. [24]

    Gradient-based optimization for regression in the functional tensor-train format

    Alex A Gorodetsky and John D Jakeman. “Gradient-based optimization for regression in the functional tensor-train format”. J. Comput. Phys.374, 1219–1238 (2018)

    work page 2018

  25. [25]

    Func- tional Tensor-Train Chebyshev Method for Multidimensional Quantum Dynamics Sim- ulations

    Micheline B Soley, Paul Bergold, Alex A Gorodetsky, and Victor S Batista. “Func- tional Tensor-Train Chebyshev Method for Multidimensional Quantum Dynamics Sim- ulations”. J. Chem. Theory Comput.18, 25– 36 (2022)

    work page 2022

  26. [26]

    The alternating linear scheme for tensor optimization in the tensor train format

    Sebastian Holtz, Thorsten Rohwedder, and Reinhold Schneider. “The alternating linear scheme for tensor optimization in the tensor train format”. SIAM J. Sci. Comput.34, A683–A713 (2012)

    work page 2012

  27. [27]

    O(dlog N)-quantics approximation of N-d tensors in high- dimensional numerical modeling

    Boris N Khoromskij. “O(dlog N)-quantics approximation of N-d tensors in high- dimensional numerical modeling”. Constr. Approx. 34, 257–280 (2011)

    work page 2011

  28. [28]

    Compressing multivariate func- tions with tree tensor networks

    Joseph Tindall, Miles Stoudenmire, and Ryan Levy. “Compressing multivariate func- tions with tree tensor networks” (2024). arXiv:2410.03572

    work page arXiv 2024

  29. [29]

    Tensor-Train Split-Operator Fourier Trans- form (TT-SOFT) Method: Multidimen- sional Nonadiabatic Quantum Dynamics

    Samuel M Greene and Victor S Batista. “Tensor-Train Split-Operator Fourier Trans- form (TT-SOFT) Method: Multidimen- sional Nonadiabatic Quantum Dynamics”. J. Chem. Theory Comput. 13, 4034– 4042 (2017)

    work page 2017

  30. [30]

    Accurate numerical simulations of open quantum sys- 14 tems using spectral tensor trains

    Ryan T Grimm and Joel D Eaves. “Accurate numerical simulations of open quantum sys- 14 tems using spectral tensor trains”. J. Chem. Phys. 161, 234111 (2024)

    work page 2024

  31. [31]

    Quantum field theories with tensor renormalization group

    Shinichiro Akiyama, Yoshinobu Kuramashi, and Yusuke Yoshimura. “Quantum field theories with tensor renormalization group”. In Proceedings of The 38th International Symposium on Lattice Field Theory — PoS(LATTICE2021). Volume 396, page 530. Trieste, Italy (2022). Sissa Medialab

    work page 2022

  32. [32]

    Tensor-Train Decomposi- tion

    I V Oseledets. “Tensor-Train Decomposi- tion”. SIAM J. Sci. Comput. 33, 2295– 2317 (2011)

    work page 2011

  33. [33]

    Constructive representa- tion of functions in low-rank tensor formats

    I V Oseledets. “Constructive representa- tion of functions in low-rank tensor formats”. Constr. Approx.37, 1–18 (2013)

    work page 2013

  34. [34]

    Learning parameter dependence for Fourier-based option pric- ing with tensor trains

    Rihito Sakurai, Haruto Takahashi, and Koichi Miyamoto. “Learning parameter dependence for Fourier-based option pric- ing with tensor trains”. Mathematics 13, 1828 (2025)

    work page 2025

  35. [35]

    Data-driven tensor train gra- dient cross approximation for Hamil- ton–Jacobi–bellman equations

    Sergey Dolgov, Dante Kalise, and Luca Saluzzi. “Data-driven tensor train gra- dient cross approximation for Hamil- ton–Jacobi–bellman equations”. SIAM J. Sci. Comput.45, A2153–A2184 (2023)

    work page 2023

  36. [36]

    Numerical evaluations of the critical prop- erties of the two-dimensional Ising model

    Leo P Kadanoff and Anthony Houghton. “Numerical evaluations of the critical prop- erties of the two-dimensional Ising model”. Phys. Rev. B11, 377–386 (1975)

    work page 1975

  37. [37]

    Efficient simulation of one- dimensional quantum many-body systems

    Guifré Vidal. “Efficient simulation of one- dimensional quantum many-body systems”. Phys. Rev. Lett.93, 040502 (2004)

    work page 2004

  38. [38]

    Improved scaling of time-evolving block- decimation algorithm through reduced-rank randomized singular value decomposition

    D Tamascelli, R Rosenbach, and M B Plenio. “Improved scaling of time-evolving block- decimation algorithm through reduced-rank randomized singular value decomposition”. Phys. Rev. E91, 063306 (2015)

    work page 2015

  39. [39]

    Theoretical methods for strongly correlated electrons

    David Senechal, Andre-Marie Tremblay, and Claude Bourbonnais, editors. “Theoretical methods for strongly correlated electrons”. Pages139–186. CRMSeriesinMathematical Physics. Springer. New York, NY (2003)

    work page 2003

  40. [40]

    One-Dimensional Hamiltonian for Columnar Liquid Crystals

    R D’hulst and A Caillé. “One-Dimensional Hamiltonian for Columnar Liquid Crystals”. J. Stat. Phys.92, 865–889 (1998)

    work page 1998

  41. [41]

    Electric- field–induced structural transitions in anti- ferroelectric liquid crystals

    A Roy and N V Madhusudana. “Electric- field–induced structural transitions in anti- ferroelectric liquid crystals”. EPL41, 501– 506 (1998)

    work page 1998

  42. [42]

    Chiral helimag- netisminT1/3NbS2(T=CrandMn)

    Y Kousaka, Y Nakao, J Kishine, M Akita, K Inoue, and J Akimitsu. “Chiral helimag- netisminT1/3NbS2(T=CrandMn)”. Phys. Res. A600, 250–253 (2009)

    work page 2009

  43. [43]

    Ground state of the one-dimensional chiral XY model in a field

    C S Yokoi, L H Tang, and W Chou. “Ground state of the one-dimensional chiral XY model in a field”. Phys. Rev. B37, 2173– 2198 (1988)

    work page 1988

  44. [44]

    A theorem about ran- dom fields

    G R Grimmett. “A theorem about ran- dom fields”. Bull. Lond. Math. Soc.5, 81– 84 (1973)

    work page 1973

  45. [45]

    Elementary gates for quantum computation

    A Barenco, C H Bennett, R Cleve, D P Di- Vincenzo, N Margolus, P Shor, T Sleator, J A Smolin, and H Weinfurter. “Elementary gates for quantum computation”. Phys. Rev. A 52, 3457–3467 (1995)

    work page 1995

  46. [46]

    Quantum Computation and Quantum In- formation: 10th Anniversary Edition

    Michael A Nielsen and Isaac L Chuang. “Quantum Computation and Quantum In- formation: 10th Anniversary Edition”. Cam- bridge University Press. Cambridge, Eng- land (2012)

    work page 2012

  47. [47]

    Finite-temperature properties of one- dimensional chiral XY model under an external field and a uniaxial potential

    Tsuyoshi Horiguchi, Michinari Momma. “Finite-temperature properties of one- dimensional chiral XY model under an external field and a uniaxial potential”. Physica A251, 485–506 (1998)

    work page 1998

  48. [48]

    One-dimensional chiral XY-model at finite temperatures

    Yoshihiko Fukui and Tsuyoshi Horiguchi. “One-dimensional chiral XY-model at finite temperatures”. Interdiscip. Inf. Sci.1, 133– 149 (1995)

    work page 1995

  49. [49]

    Metastable configurations of a finite-size chain of classical spins within the one-dimensional chiral XY-model

    Alexander P Popov, Maria Gloria Pini, and Angelo Rettori. “Metastable configurations of a finite-size chain of classical spins within the one-dimensional chiral XY-model”. J. Magn. Magn. Mater.402, 55–63 (2016)

    work page 2016

  50. [50]

    One-dimensional chiral XY model for the Dhd phase of hex- ahexylthiotriphenylene

    T Horiguchi and Y Fukui. “One-dimensional chiral XY model for the Dhd phase of hex- ahexylthiotriphenylene”. Phys. Rev. B50, 7140–7143 (1994)

    work page 1994

  51. [51]

    Transfer matrix in plane- rotator model

    Daniel C Mattis. “Transfer matrix in plane- rotator model”. Phys. Lett. A 104, 357– 360 (1984)

    work page 1984

  52. [52]

    The theory of magnetism II: Thermodynamics and statistical mechan- ics

    Daniel C Mattis. “The theory of magnetism II: Thermodynamics and statistical mechan- ics”. Springer Series in Solid-State Sciences. Springer. Berlin, Germany (1985). 1985 edi- tion

    work page 1985

  53. [53]

    See Supplemental Material at (...) for ad- dtional details on the generalized transfer matrix solution to the Chiral XY model

    work page

  54. [54]

    Classical Heisenberg Model

    G S Joyce. “Classical Heisenberg Model”. Phys. Rev.155, 478–491 (1967)

    work page 1967

  55. [55]

    Small matrix disentangle- 15 ment of the path integral: Overcoming the exponential tensor scaling with memory length

    Nancy Makri. “Small matrix disentangle- 15 ment of the path integral: Overcoming the exponential tensor scaling with memory length”. J. Chem. Phys.152, 041104 (2020)

    work page 2020

  56. [56]

    Ten- sor propagator for iterative quantum time evolution of reduced density matrices. I. Theory

    Nancy Makri and Dmitrii E Makarov. “Ten- sor propagator for iterative quantum time evolution of reduced density matrices. I. Theory”. J. Chem. Phys. 102, 4600– 4610 (1995)

    work page 1995

  57. [57]

    Ten- sor propagator for iterative quantum time evolution of reduced density matrices. II. Numerical methodology

    Nancy Makri and Dmitrii E Makarov. “Ten- sor propagator for iterative quantum time evolution of reduced density matrices. II. Numerical methodology”. J. Chem. Phys. 102, 4611–4618 (1995)

    work page 1995

  58. [58]

    Minimally entangled typical thermal state algorithms

    E M Stoudenmire and Steven R White. “Minimally entangled typical thermal state algorithms”. NewJ.Phys.12, 055026(2010)

    work page 2010

  59. [59]

    Josephson charge qubits: a brief review

    Yu A Pashkin, O Astafiev, T Yamamoto, Y Nakamura, and J S Tsai. “Josephson charge qubits: a brief review”. Quantum Inf. Process. 8, 55–80 (2009)

    work page 2009

  60. [60]

    Studies of polaron motion

    T Holstein. “Studies of polaron motion”. Ann. Phys. (N. Y.)8, 325–342 (1959)

    work page 1959

  61. [61]

    Numerically “exact

    Yoshitaka Tanimura. “Numerically “exact” approach to open quantum dynamics: The hierarchical equations of motion (HEOM)”. J. Chem. Phys.153, 020901 (2020)

    work page 2020

  62. [62]

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

    Yoshitaka Tanimura and Ryogo Kubo. “Time Evolution of a Quantum System in Contact with a Nearly Gaussian-Markoffian Noise Bath”. J. Phys. Soc. Jpn.58, 101– 114 (1989)

    work page 1989

  63. [63]

    A practical introduction to tensor networks: Matrix product states and projected entangled pair states

    Román Orús. “A practical introduction to tensor networks: Matrix product states and projected entangled pair states”. Ann. Phys. (N. Y.)349, 117–158 (2014). 16

    work page 2014