pith. sign in

arxiv: 2605.21597 · v1 · pith:JQHLMFRDnew · submitted 2026-05-20 · 🪐 quant-ph · cond-mat.str-el

Matrix Product Operator Encodings of the Magnus Expansion and Dyson Series

Victor Vanthilt , Maarten Van Damme , Jutho Haegeman , Ian P. McCulloch , Laurens Vanderstraeten This is my paper

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

classification 🪐 quant-ph cond-mat.str-el
keywords matrix product operatorsMagnus expansionDyson seriestime-dependent Hamiltoniansquantum lattice modelstensor networkstime evolutionmatrix product states
0
0 comments X

The pith

Matrix product operators encode the Magnus expansion to simulate time-dependent quantum lattices accurately with standard MPS methods.

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

The paper presents a matrix product operator construction that represents the Magnus expansion and Dyson series for one-dimensional quantum lattice models whose Hamiltonians change with time. This encoding can be built to arbitrary order in the time step while remaining compatible with existing matrix product state algorithms for both finite and infinite systems. It also accommodates long-range interactions. When combined with current time-evolution techniques, the approach yields substantial gains in accuracy and efficiency for driven quantum dynamics. The same construction further supports optimization of quantum circuits that implement time-dependent Hamiltonians.

Core claim

An MPO encoding of the Magnus expansion and Dyson series can be constructed to arbitrary order in the time step for one-dimensional quantum lattice models with time-dependent Hamiltonians; the encoding applies to finite and infinite systems, handles long-range interactions, and integrates directly with matrix product state time-evolution algorithms to produce more accurate and efficient simulations.

What carries the argument

Matrix product operator (MPO) encoding of the Magnus expansion and Dyson series, which converts the time-ordered exponential into a tensor network that preserves arbitrary-order accuracy in the time step.

If this is right

  • Time evolution under time-dependent Hamiltonians becomes possible at arbitrary order in the time step using existing MPS libraries.
  • The method extends to infinite systems and long-range interactions without changing the core algorithm.
  • Quantum circuit optimization for time-dependent simulation can reuse the same MPO construction.
  • Drastic improvements in simulation accuracy and runtime are expected when the MPO is combined with state-of-the-art MPS time-evolution routines.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The approach may reduce the number of time steps needed for long-time simulations of driven many-body systems compared with low-order Trotter schemes.
  • Similar MPO constructions could be explored for other perturbative expansions beyond the Magnus and Dyson series.
  • The technique supplies a concrete route to test whether tensor-network representations can systematically outperform traditional integrators for time-dependent lattice problems.

Load-bearing premise

An efficient MPO representation of the Magnus and Dyson series exists that preserves arbitrary-order accuracy in the time step while remaining compatible with standard MPS algorithms without prohibitive overhead or truncation errors.

What would settle it

A direct numerical benchmark on a small time-dependent spin chain that compares the error and cost of the new MPO-Magnus evolution against both Trotterization and exact diagonalization at fixed time-step size and system length.

Figures

Figures reproduced from arXiv: 2605.21597 by Ian P. McCulloch, Jutho Haegeman, Laurens Vanderstraeten, Maarten Van Damme, Victor Vanthilt.

Figure 1
Figure 1. Figure 1: FIG. 1. Benchmark for finite-system size. We plot the error [PITH_FULL_IMAGE:figures/full_fig_p013_1.png] view at source ↗
Figure 3
Figure 3. Figure 3: FIG. 3. Runtime comparison. We compare the total runtime [PITH_FULL_IMAGE:figures/full_fig_p013_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: FIG. 4. Finite-size benchmark (left) and infinite-size benchmark (right) using the most accurate wavefunction generated with [PITH_FULL_IMAGE:figures/full_fig_p023_4.png] view at source ↗
read the original abstract

We introduce a matrix product operator (MPO) encoding of the Magnus expansion and the Dyson series for one-dimensional quantum lattice models with time-dependent Hamiltonians. The MPO construction can be made accurate up to arbitrary order in the time step, it can be applied to both finite and infinite systems, and it can handle long-range interactions. The resulting MPO can be combined with state-of-the-art time evolution algorithms based on matrix product states, allowing for drastic improvements in simulating evolution under time-dependent Hamiltonians. Our MPO construction can also be used for the optimization of quantum circuits in the context of quantum simulation of time-dependent Hamiltonians.

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 / 2 minor

Summary. The manuscript introduces matrix product operator (MPO) encodings of the Magnus expansion and Dyson series for one-dimensional quantum lattice models with time-dependent Hamiltonians. It claims these encodings achieve arbitrary-order accuracy in the time step, apply to both finite and infinite systems, accommodate long-range interactions, and integrate with matrix product state (MPS) time-evolution algorithms to yield drastic improvements in simulation efficiency. The construction is also positioned for use in quantum circuit optimization for time-dependent Hamiltonians.

Significance. If the central constructions deliver the stated arbitrary-order accuracy with controlled bond dimensions and without introducing truncation errors that accumulate across time steps, the work would provide a valuable tool for simulating time-dependent quantum systems on tensor networks. The explicit compatibility with existing MPS evolution methods and extension to infinite systems and long-range interactions would strengthen its practical impact, particularly if the MPO bond dimensions remain modest and independent of expansion order.

major comments (2)
  1. [MPO construction (likely §3 or §4)] The central claim of arbitrary-order accuracy in the time step (abstract and introduction) rests on an MPO representation of the nested commutators in the Magnus expansion or the time-ordered integrals in the Dyson series. Without explicit scaling bounds or a proof that the virtual bond dimension remains bounded independently of the expansion order and number of time slices, it is unclear whether the construction avoids the bond-dimension growth that typically accompanies discretization of such operator series; this directly affects whether truncation errors invalidate the claimed improvements over standard methods.
  2. [Results and applications (likely §5)] The manuscript asserts applicability to long-range interactions and infinite systems while preserving efficiency. However, the handling of long-range terms in the MPO encoding of the time-dependent series is not accompanied by a concrete error analysis or numerical scaling data showing that the bond dimension does not grow prohibitively with interaction range or system size; this is load-bearing for the efficiency claim when combined with MPS algorithms.
minor comments (2)
  1. [Abstract] The abstract states the existence of the MPO encoding but provides no derivation outline or reference to the explicit tensor construction; adding a short schematic or equation reference in the abstract would improve readability.
  2. [Methods] Notation for the time-step discretization and the mapping from continuous integrals to discrete MPO tensors should be clarified to avoid ambiguity when readers attempt to reproduce the arbitrary-order construction.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for their careful reading of the manuscript and for the constructive comments. We address the two major comments point by point below, clarifying the constructions and indicating the revisions we will make.

read point-by-point responses

  1. Referee: [MPO construction (likely §3 or §4)] The central claim of arbitrary-order accuracy in the time step (abstract and introduction) rests on an MPO representation of the nested commutators in the Magnus expansion or the time-ordered integrals in the Dyson series. Without explicit scaling bounds or a proof that the virtual bond dimension remains bounded independently of the expansion order and number of time slices, it is unclear whether the construction avoids the bond-dimension growth that typically accompanies discretization of such operator series; this directly affects whether truncation errors invalidate the claimed improvements over standard methods.

    Authors: The constructions in Sections 3 and 4 define the MPO for each term in the Magnus expansion (or Dyson series) recursively from the underlying local Hamiltonian terms. For a fixed expansion order k the resulting MPO bond dimension is bounded by a function of k and the spatial range of the interactions; it remains independent of the number of time slices because the time-ordering is encoded in the auxiliary indices rather than by explicit discretization. We agree that an explicit scaling statement and proof were not provided. In the revised manuscript we will add a dedicated subsection that states and proves the bond-dimension bound for both finite and infinite systems, showing that the growth with order is at most polynomial for fixed interaction range and that no additional truncation is introduced beyond the usual MPS truncation at each time step. revision: yes

  2. Referee: [Results and applications (likely §5)] The manuscript asserts applicability to long-range interactions and infinite systems while preserving efficiency. However, the handling of long-range terms in the MPO encoding of the time-dependent series is not accompanied by a concrete error analysis or numerical scaling data showing that the bond dimension does not grow prohibitively with interaction range or system size; this is load-bearing for the efficiency claim when combined with MPS algorithms.

    Authors: Section 5 outlines how long-range interactions are incorporated by extending the local MPO tensors to include the appropriate decay profile (exact for finite range, or via controlled truncation for power-law tails) and how the infinite-system case follows from the standard iMPS/iMPO formalism. We acknowledge that a quantitative error analysis and numerical scaling plots were not included. In the revision we will add a new subsection together with a figure that reports the observed MPO bond dimension versus interaction range and versus expansion order for both finite and infinite chains, together with the resulting time-evolution error for a representative time-dependent model. revision: yes

Circularity Check

0 steps flagged

No circularity: direct MPO construction from standard series expansions

full rationale

The paper presents an explicit MPO encoding for the Magnus expansion and Dyson series applied to time-dependent lattice Hamiltonians. This is framed as a constructive mapping that preserves arbitrary-order accuracy in the time step and remains compatible with existing MPS evolution algorithms. No load-bearing step reduces to a self-definition, a fitted parameter renamed as a prediction, or a self-citation chain that substitutes for independent derivation. The central claims rest on the algebraic structure of the nested commutators and time-ordered integrals being representable as MPOs with controlled bond dimension, which is an external mathematical property rather than an input assumed by the construction itself. The method is therefore self-contained against standard benchmarks for tensor-network representations of operator series.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The central claim rests on the standard tensor-network formalism for 1D systems and the mathematical properties of the Magnus and Dyson series; no new free parameters, axioms beyond standard math, or invented entities are introduced in the abstract.

axioms (1)
  • standard math Matrix product operators and states provide efficient representations for operators and states on one-dimensional quantum lattices.
    Invoked implicitly as the foundation for the encoding and its combination with existing MPS algorithms.

pith-pipeline@v0.9.0 · 5646 in / 1326 out tokens · 39039 ms · 2026-05-22T09:22:49.574697+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

57 extracted references · 57 canonical work pages · 3 internal anchors

  1. [1]

    driving chan- nels

    These levels, of which there are N! n3!(N−n 3)! and which are all equivalent, should thus not be simply discarded as in the case of constructingH ⊙N, but the corresponding columns should be added to the levell= 1 = (1,1, . . . ,1) with the associated factor τ k n3! n3!(N−k)! N! . This leads to the algorithm outlined in Alg. 1, which is implemented in the ...

    work page

  2. [2]

    F. J. Dyson, The radiation theories of Tomonaga, Schwinger, and Feynman, Phys. Rev.75, 486 (1949)

    work page 1949

  3. [3]

    R. P. Feynman, An operator calculus having applications in quantum electrodynamics, Phys. Rev.84, 108 (1951)

    work page 1951

  4. [4]

    Magnus, On the exponential solution of differential equations for a linear operator, Communications on Pure and Applied Mathematics7, 649 (1954)

    W. Magnus, On the exponential solution of differential equations for a linear operator, Communications on Pure and Applied Mathematics7, 649 (1954)

    work page 1954

  5. [5]

    Blanes, F

    S. Blanes, F. Casas, J. Oteo, and J. Ros, The Magnus 15 expansion and some of its applications, Physics Reports 470, 151 (2009)

    work page 2009

  6. [6]

    Schollw¨ ock, The density-matrix renormalization group in the age of matrix product states, Annals of Physics 326, 96 (2011)

    U. Schollw¨ ock, The density-matrix renormalization group in the age of matrix product states, Annals of Physics 326, 96 (2011)

    work page 2011

  7. [7]

    J. I. Cirac, D. P´ erez-Garc´ ıa, N. Schuch, and F. Ver- straete, Matrix product states and projected entangled pair states: Concepts, symmetries, theorems, Rev. Mod. Phys.93, 045003 (2021)

    work page 2021

  8. [8]

    Xiang,Density Matrix and Tensor Network Renor- malization(Cambridge University Press, 2024)

    T. Xiang,Density Matrix and Tensor Network Renor- malization(Cambridge University Press, 2024)

    work page 2024

  9. [9]

    Paeckel, T

    S. Paeckel, T. K¨ ohler, A. Swoboda, S. R. Manmana, U. Schollw¨ ock, and C. Hubig, Time-evolution methods for matrix-product states, Annals of Physics411, 167998 (2019)

    work page 2019

  10. [10]

    H. F. Trotter, On the product of semi-groups of opera- tors, Proceedings of the American Mathematical Society 10, 545 (1959)

    work page 1959

  11. [11]

    Suzuki, General decomposition theory of ordered ex- ponentials, Proceedings of the Japan Academy, Series B 69, 161 (1993)

    M. Suzuki, General decomposition theory of ordered ex- ponentials, Proceedings of the Japan Academy, Series B 69, 161 (1993)

    work page 1993

  12. [12]

    Vidal, Efficient classical simulation of slightly entan- gled quantum computations, Phys

    G. Vidal, Efficient classical simulation of slightly entan- gled quantum computations, Phys. Rev. Lett.91, 147902 (2003)

    work page 2003

  13. [13]

    S. R. White and A. E. Feiguin, Real-time evolution us- ing the density matrix renormalization group, Phys. Rev. Lett.93, 076401 (2004)

    work page 2004

  14. [14]

    A. J. Daley, C. Kollath, U. Schollw¨ ock, and G. Vidal, Time-dependent density-matrix renormalization-group using adaptive effective Hilbert spaces, Journal of Statis- tical Mechanics: Theory and Experiment2004, P04005 (2004)

    work page 2004

  15. [15]

    Haegeman, J

    J. Haegeman, J. I. Cirac, T. J. Osborne, I. Piˇ zorn, H. Ver- schelde, and F. Verstraete, Time-dependent variational principle for quantum lattices, Phys. Rev. Lett.107, 070601 (2011)

    work page 2011

  16. [16]

    Haegeman, C

    J. Haegeman, C. Lubich, I. Oseledets, B. Vandereycken, and F. Verstraete, Unifying time evolution and optimiza- tion with matrix product states, Phys. Rev. B94, 165116 (2016)

    work page 2016

  17. [17]

    Jos´ e Garc´ ıa-Ripoll, Time evolution of matrix product states, New Journal of Physics8, 305 (2006)

    J. Jos´ e Garc´ ıa-Ripoll, Time evolution of matrix product states, New Journal of Physics8, 305 (2006)

    work page 2006

  18. [18]

    P. E. Dargel, A. Honecker, R. Peters, R. M. Noack, and T. Pruschke, Adaptive Lanczos-vector method for dy- namic properties within the density matrix renormaliza- tion group, Phys. Rev. B83, 161104 (2011)

    work page 2011

  19. [19]

    M. L. Wall and L. D. Carr, Out-of-equilibrium dynamics with matrix product states, New Journal of Physics14, 125015 (2012)

    work page 2012

  20. [20]

    M. P. Zaletel, R. S. K. Mong, C. Karrasch, J. E. Moore, and F. Pollmann, Time-evolving a matrix product state with long-ranged interactions, Phys. Rev. B91, 165112 (2015)

    work page 2015

  21. [21]

    Vanhecke, L

    B. Vanhecke, L. Vanderstraeten, and F. Verstraete, Sym- metric cluster expansions with tensor networks, Phys. Rev. A103, L020402 (2021)

    work page 2021

  22. [22]

    Vanhecke, D

    B. Vanhecke, D. Devoogdt, F. Verstraete, and L. Van- derstraeten, Simulating thermal density operators with cluster expansions and tensor networks, SciPost Phys. 14, 085 (2023)

    work page 2023

  23. [23]

    Van Damme, J

    M. Van Damme, J. Haegeman, I. McCulloch, and L. Van- derstraeten, Efficient higher-order matrix product oper- ators for time evolution, SciPost Phys.17, 135 (2024)

    work page 2024

  24. [24]

    D. M. Kennes, A. de la Torre, A. Ron, D. Hsieh, and A. J. Millis, Floquet engineering in quantum chains, Phys. Rev. Lett.120, 127601 (2018)

    work page 2018

  25. [25]

    Osterkorn, C

    A. Osterkorn, C. Meyer, and S. R. Manmana, In-gap band formation in a periodically driven charge density wave insulator, Communications Physics6, 245 (2023)

    work page 2023

  26. [26]

    Gadge and S

    K. Gadge and S. R. Manmana, Stability of Floquet sidebands and quantum coherence in one-dimensional strongly interacting spinless fermions, Phys. Rev. B112, 085144 (2025)

    work page 2025

  27. [27]

    Balada Gaggioli and J

    L. Balada Gaggioli and J. Mareˇ cek, Time evolution of controlled many-body quantum systems with matrix product operators, Phys. Rev. A112, 062612 (2025)

    work page 2025

  28. [28]

    Lloyd, Universal quantum simulators, Science273, 1073 (1996)

    S. Lloyd, Universal quantum simulators, Science273, 1073 (1996)

    work page 1996

  29. [29]

    Huyghebaert and H

    J. Huyghebaert and H. D. Raedt, Product formula meth- ods for time-dependent schrodinger problems, Journal of Physics A: Mathematical and General23, 5777 (1990)

    work page 1990

  30. [30]

    Poulin, A

    D. Poulin, A. Qarry, R. Somma, and F. Verstraete, Quan- tum simulation of time-dependent Hamiltonians and the convenient illusion of Hilbert space, Phys. Rev. Lett.106, 170501 (2011)

    work page 2011

  31. [31]

    Kieferov´ a, A

    M. Kieferov´ a, A. Scherer, and D. W. Berry, Simulat- ing the dynamics of time-dependent Hamiltonians with a truncated Dyson series, Phys. Rev. A99, 042314 (2019)

    work page 2019

  32. [32]

    G. H. Low and N. Wiebe, Hamiltonian simulation in the interaction picture, arXiv:1805.00675 (2019)

    work page internal anchor Pith review Pith/arXiv arXiv 2019

  33. [33]

    D. W. Berry, A. M. Childs, R. Cleve, R. Kothari, and R. D. Somma, Phys. Rev. Lett.114, 090502 (2015)

    work page 2015

  34. [34]

    Fannes, B

    M. Fannes, B. Nachtergaele, and R. F. Werner, Finitely correlated states on quantum spin chains, Communica- tions in Mathematical Physics144, 443 (1992)

    work page 1992

  35. [35]

    Verstraete and J

    F. Verstraete and J. I. Cirac, Matrix product states rep- resent ground states faithfully, Phys. Rev. B73, 094423 (2006)

    work page 2006

  36. [36]

    Vanderstraeten, J

    L. Vanderstraeten, J. Haegeman, and F. Verstraete, Tangent-space methods for uniform matrix product states, SciPost Phys. Lect. Notes , 7 (2019)

    work page 2019

  37. [37]

    Vidal, Classical simulation of infinite-size quantum lattice systems in one spatial dimension, Phys

    G. Vidal, Classical simulation of infinite-size quantum lattice systems in one spatial dimension, Phys. Rev. Lett. 98, 070201 (2007)

    work page 2007

  38. [38]

    I. P. McCulloch, Infinite size density matrix renormaliza- tion group, revisited, arXiv:0804.2509 (2008)

    work page internal anchor Pith review Pith/arXiv arXiv 2008

  39. [39]

    Zauner-Stauber, L

    V. Zauner-Stauber, L. Vanderstraeten, M. T. Fishman, F. Verstraete, and J. Haegeman, Variational optimization algorithms for uniform matrix product states, Phys. Rev. B97, 045145 (2018)

    work page 2018

  40. [40]

    Verstraete, J

    F. Verstraete, J. J. Garc´ ıa-Ripoll, and J. I. Cirac, Ma- trix product density operators: Simulation of finite- temperature and dissipative systems, Phys. Rev. Lett. 93, 207204 (2004)

    work page 2004

  41. [41]

    E. M. Stoudenmire and S. R. White, Minimally entangled typical thermal state algorithms, New Journal of Physics 12, 055026 (2010)

    work page 2010

  42. [42]

    Stoudenmire, G

    M. Stoudenmire, G. Evenbly, S. R. White, and I. Mc- Culloch, MPO-MPS multiplication: Density matrix al- gorithm, tensornetwork.org, accessed 2026-05-20

    work page 2026

  43. [43]

    Renormalization algorithms for Quantum-Many Body Systems in two and higher dimensions

    F. Verstraete and J. I. Cirac, Renormalization algorithms for quantum-many body systems in two and higher di- mensions, arXiv: cond-mat/0407066 (2004)

    work page internal anchor Pith review Pith/arXiv arXiv 2004

  44. [44]

    Vanhecke, M

    B. Vanhecke, M. V. Damme, J. Haegeman, L. Van- derstraeten, and F. Verstraete, Tangent-space methods for truncating uniform MPS, SciPost Phys. Core4, 004 (2021)

    work page 2021

  45. [45]

    Pirvu, V

    B. Pirvu, V. Murg, J. I. Cirac, and F. Verstraete, Matrix 16 product operator representations, New Journal of Physics 12, 025012 (2010)

    work page 2010

  46. [46]

    I. P. McCulloch, From density-matrix renormalization group to matrix product states, Journal of Statistical Me- chanics: Theory and Experiment2007, P10014 (2007)

    work page 2007

  47. [47]

    G. M. Crosswhite and D. Bacon, Finite automata for caching in matrix product algorithms, Phys. Rev. A78, 012356 (2008)

    work page 2008

  48. [48]

    D. E. Parker, X. Cao, and M. P. Zaletel, Local matrix product operators: Canonical form, compression, and control theory, Phys. Rev. B102, 035147 (2020)

    work page 2020

  49. [49]

    Vanderstraeten, M

    L. Vanderstraeten, M. Mari¨ en, J. Haegeman, N. Schuch, J. Vidal, and F. Verstraete, Bridging perturbative expan- sions with tensor networks, Phys. Rev. Lett.119, 070401 (2017)

    work page 2017

  50. [50]

    Y.-H. Chen, K. Hsu, W.-L. Tu, H.-Y. Lee, and Y.-J. Kao, Variational tensor network operator, Phys. Rev. Res.4, 043153 (2022)

    work page 2022

  51. [51]

    Devos, M

    L. Devos, M. Van Damme, and J. Haegeman, MPSKit (2026)

    work page 2026

  52. [52]

    I. P. McCulloch, Improvements to MPO encodings of the Taylor and Dyson series (2026), in preparation

    work page 2026

  53. [53]

    Waintal, C.-H

    X. Waintal, C.-H. Huang, and C. W. Groth, Who can compete with quantum computers? Lecture notes on quantum inspired tensor networks computational tech- niques, arXiv:2601.03035 (2026)

    work page arXiv 2026

  54. [54]

    Kr¨ amer, D

    S. Kr¨ amer, D. Plankensteiner, L. Ostermann, and H. Ritsch, QuantumOptics.jl: A julia framework for sim- ulating open quantum systems, Computer Physics Com- munications227, 109 (2018)

    work page 2018

  55. [55]

    Rackauckas and Q

    C. Rackauckas and Q. Nie, Differentialequations.jl – a performant and feature-rich ecosystem for solving differ- ential equations in julia, Journal of Open Research Soft- ware5, 15 (2017). 17 Appendix A: Approximate row compression In this appendix, we illustrate the row compression algorithm concretely for a 3rd order Dyson MPO with two driving channels:...

    work page 2017

  56. [56]

    physical

    The quantic tensor train representation of functions To encode a functionf(x) on the domain [0,1), we divide the domain in 2 N equally spaced pointsx n = n 2N where n∈ {0, ...,2 N −1}. We denotef n ≡f(x n). We can expressnin terms of its binary representationn N−1 . . . n1n0 as n= PN−1 α=0 nα2α wheren α ∈ {0,1} ∀α. There are several functions that allow f...

    work page

  57. [57]

    Integration using the quantics representation One can perform indefinite integrals on quantic tensor trains by multiplying it by a rank 2 MPO. The main idea is that indefinite integrals can be performed as: F(y n) = Z yn 0 f(x)dx= X m<n f(x m)∆x= X Θ(n−m)f m∆x(C5) We therefore need an implementation of the Heaviside function Θ(n−m) as an MPO. To determine...

    work page