Pith. sign in

REVIEW 3 major objections 5 minor 51 references

Fast-forwardability of Jordan-Wigner-transformed Fermion models based on Cartan decomposition

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

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

Pith's one-line read This paper proves that Jordan-Wigner-transformed interacting fermion models with a single-site Coulomb interaction have exponentially large Hamiltonian algebras, so the Cartan-based fast-forwarding method requires exponentially deep…

desk verdict A likely-true exponential lower bound for JW-interacting fermion algebras, but the key lemma's commutator identities are wrong and need repair before the result is established. read the letter →

arxiv 2502.04620 v1 pith:LGOMDO5N submitted 2025-02-07 quant-ph

Yuichiro Hidaka , Shoichiro Tsutsui , Shota Kanasugi , Norifumi Matsumoto , Kazunori Maruyama , Hirotaka Oshima This is my paper · ORCID
classification quant-ph MSC 81P68 PACS 03.67.Ac
keywords HamiltonianalgebradynamicalLieJordan-Wignertransformationfast-forwardingCartandecompositionAndersonimpuritymodelHubbardquantumsimulation
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 proves a sharp distinction between free and interacting fermion models after Jordan-Wigner mapping to qubits. For a free-fermion model the Hamiltonian algebra is at most quadratic in the number of sites, so efficient Cartan-based fast-forwarding is not blocked by the algebra. For a fermion model with a single-site Coulomb interaction, the Hamiltonian algebra has dimension at least $2^{N-1}$, and every Cartan decomposition has a $k$-subspace of dimension at least $2^{N-3}$, so the circuit depth of the Cartan-based method is exponential in $N$. The same lower bound carries over to the Anderson impurity model and the Hubbard model, on any connected hopping graph. The upshot is that these standard condensed-matter target models cannot be efficiently simulated by this particular algebraic fast-forwarding route.

What carries the argument

The load-bearing object is the Hamiltonian algebra $g(H)$, the real Lie algebra generated by the Pauli strings appearing in the qubit Hamiltonian; its dimension is the controlling cost parameter for Cartan-based fast-forwarding. A Cartan decomposition is a splitting of the Lie algebra into even and odd parts under an involution, with $k$ the even subalgebra and $m$ the odd complement. The paper's construction enumerates non-crossing paths on a ladder graph with $N-1$ steps: each path, together with a two-fold choice of the first Pauli operator, is turned into a Pauli string in $g(H_{1,JW})$ by a sequence of commutators, using the hopping strings of $H_{0,JW}$ and the onsite term $Z_{u(0)}Z_{d(0)}$ to switch between the upper and lower lanes. The Cartan machinery enters through the KHK theorem, which represents every element of the subspace $m$ as $K h K^\dagger$ with $h$ in a Cartan subalgebra and $K$ built from exponentials of $k$; hence the dimension of $k$ plus $h$ bounds the circuit depth. The lower bound on $\dim(k)$ is obtained by feeding the path-constructed strings through commutators with fixed strings $S^u_{X,Y}$ and $S^d_{X,Y}$, yielding at least $2^{N-3}$ independent elements of $k$.

What would settle it

Take a small instance, say $N=3$ or $N=4$, write down $H_{1,JW}$ explicitly, and close its Pauli strings under commutators by brute force. Theorem III.1(2) predicts the closure has dimension at least $2^{N-1}$ and that the ladder construction yields that many distinct strings; either failure would falsify the exponential claim. Separately, enumerate every ladder path and check the step-2 anticommutation rule directly: any path whose next commutator vanishes is a counterexample to the structural induction on which the proof rests.

Watch

Extended reading notes

Core claim

On the paper's own terms, the central discovery is Theorem III.1(2): for the Jordan-Wigner-transformed Hamiltonian $H_{1,JW}=H_{0,JW}+U Z_{u(0)}Z_{d(0)}$, the Hamiltonian algebra satisfies $\dim(g(H_{1,JW})) \geq 2^{N-1}$. Theorem IV.1 then shows that for any Cartan decomposition $g(H_{1,JW}) = k \oplus m$ satisfying the fast-forwarding conditions, $\dim(k) \geq 2^{N-3}$. Since the Cartan-based method builds the time evolution from the $k$ and Cartan subalgebra $h$ parts, these inequalities force its circuit depth to grow exponentially with the number of sites. Applying the containment monotonicity of generated Lie algebras, the same exponential lower bound holds for the Anderson impurity model and the Hubbard model in their Jordan-Wigner forms. This proves, for the first time rigorously, what earlier numerical work had observed: the qubit Hamiltonians of these interacting fermion models are not efficiently simulable by Cartan-based fast-forwarding.

Load-bearing premise

The proof's exponential count rests on an unproved structural induction: at every ladder step the intermediate Pauli string must have exactly the declared pattern of X/Y at some early sites and Z at all others, guaranteeing that the next commutator is nonzero and that distinct paths give distinct final strings; if that pattern fails at any step, the constructed string vanishes and the $2^{N-1}$ lower bound collapses.

Editorial extensions

If this is right

  • For the Anderson impurity model and the Hubbard model in Jordan-Wigner form, the Cartan-based fast-forwarding circuit depth is at least exponential in the number of sites, so these models cannot be handled by that method at large $N$.
  • The exponential behavior appears as soon as one onsite Coulomb term $U Z_{u(0)}Z_{d(0)}$ is added to a connected free-fermion hopping Hamiltonian; free fermions alone remain polynomially bounded.
  • Because adding more Hamiltonian terms can only enlarge the generated algebra, common extensions such as chemical potentials and additional interaction terms preserve the exponential lower bound.
  • No reorganization of the Cartan decomposition can rescue polynomial depth for these particular qubit Hamiltonians, since the lower bound $\dim(k) \geq 2^{N-3}$ holds for every valid decomposition.

Reading between the lines

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

  • The exponential lower bound is for exact Cartan-based fast-forwarding; it leaves open the possibility of polynomial-depth approximate simulation under finite error, which the paper explicitly sets aside.
  • Because the blow-up is tied to the Jordan-Wigner encoding and the alignment of spin-up and spin-down sites, an obvious testable extension is whether alternative fermion-to-qubit mappings, such as encodings that spread each fermion over several qubits, can reduce the algebra dimension for the same physical model; the paper notes the mapping choice can change the scaling.
  • Resolving the small counting inconsistency in the path enumeration (two choices times $2^{N-2}$ paths versus the claimed $2^{N-1}$) would tighten the constant in the lower bound; the exponential scaling itself would likely survive.
  • The same ladder construction can be applied to other fermion models containing both connected hopping and at least one onsite density-density interaction to predict exponential Hamiltonian algebras, even when the full model does not have exactly one single-site interaction.
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 / 5 minor

Summary. The paper studies the dynamical Lie algebra (called Hamiltonian algebra) of qubit Hamiltonians obtained by Jordan-Wigner transforming fermion models. For a free-fermion Hamiltonian on a connected graph, it proves a polynomial upper bound dim(g(H_0,JW)) ≤ 2N(2N−1). For a fermion model with one additional single-site Coulomb interaction, it claims an exponential lower bound dim(g(H_1,JW)) ≥ 2^{N−1}, and then claims that for every Cartan decomposition of this algebra the subalgebra k satisfies dim(k) ≥ 2^{N−3}, so that Cartan-based fast-forwarding requires exponential circuit depth. These results are applied to the Anderson impurity model and the Hubbard model to conclude that their JW-transformed qubit models are not efficiently fast-forwardable by the Cartan method.

Significance. If the main theorem were correct, the paper would resolve an important question: it would rigorously show that the empirical exponential growth of the dynamical Lie algebra for JW-transformed interacting fermion models is real, and it would give a general no-go for Cartan-based fast-forwarding of the Anderson and Hubbard models. The free-fermion upper bound is a useful, clean contribution. The paper is self-contained and does not rely on fitted parameters or numerical extrapolation. However, the exponential lower bound currently rests on a concrete algebraic error in the rung-string construction and on an asserted but unproven induction for the ladder paths, so the significance is conditional on a successful repair of the proof.

major comments (3)
  1. [Sec. III.C, Lemma III.2, Eqs. (36)-(37)] The commutator identities in Eqs. (36)-(37) are algebraically incorrect. For u(0) < u(i) < u(i+1) and P_{u(i)} = X, the two strings are X_{u0} Z ... X_{u(i)} and X_{u0} Z ... X_{u(i+1)}; the common X_{u0} cancels and the overlap at u(i) is X versus Z, which produces \overline{P}_{u(i)} = Y at that site rather than P_{u(i)}. Explicitly, [X0 X1, X0 Z1 X2] ∝ Y1 X2, not X1 X2. The Y-Y version suffers the same problem. Consequently, the assertion in Eq. (28) that both \overrightarrow{P_{u(i)}P_{u(i+1)}} and \overrightarrow{\overline{P}_{u(i)}\overline{P}_{u(i+1)}} belong to g(H_1,JW) is not established by the displayed commutators. Since the ladder construction in Sec. III.C repeatedly uses these rung strings to advance Q_k, this algebraic error is load-bearing for Theorem III.1(2). The theorem may be salvageable with a different commutator sequence, but the present proof does not supply one.
  2. [Sec. III.C, step 2 and the paragraph 'The reason why these operations succeed'] The structural induction for the Pauli strings Q_k is asserted rather than proved. The text claims that Q_k has a specific support pattern and anticommutes with the selected rung string in each of cases (a)-(d), but no inductive proof is given that the support pattern is preserved, that the required anticommutation indeed holds at every step, and that the resulting Q_{k+1} has the form needed for the next step. The distinctness claim — that different ladder paths produce different final Pauli strings — is also asserted without proof. These are not cosmetic gaps: without them the enumeration of 2^{N-1} distinct elements of g(H_1,JW) in Eq. (54) is not rigorous. A complete proof must either supply the induction or replace the construction with a different explicit set of commutator-generated strings.
  3. [Sec. III.C, Eq. (54)] The path counting is internally inconsistent. The paths are defined by choosing, for each k = 1, ..., N−1, either the upper edge (u(k), u(k+1)) or the lower edge (d(k), d(k+1)), which gives 2^{N-1} paths, not 2^{N-2}. Multiplying by the stated factor of 2 from step 1 would give 2^N total strings, while the text writes 'for each choice, there are 2^{N-2} possible paths' and concludes 2^{N-1}. Even if the final exponential scaling is unaffected, the constant in the lower bound depends on the correct count, and the present text is not self-consistent.
minor comments (5)
  1. [Sec. III.C, Lemma III.2 proof] In the k=2 case the text reads 'the claim holds by setting P_{u(j_2)} = Y_{u(2)}'; the argument of Y should be u(j_2), not u(2).
  2. [Sec. III.C, first paragraph] The phrase 'distinct 2 n Pauli strings' should read 'distinct 2^N Pauli strings'; the superscript is missing.
  3. [Sec. IV, Theorem IV.1 proof] The counting of distinct elements of k via positions (u(i), d(i)) for i = 2, ..., N−2 should be stated more explicitly; as written, the range of i and the claimed bound 2^{N-3} are easy to misread as an off-by-one error, even though the number of positions is N−3.
  4. [Throughout] The notation \overrightarrow{Q_i Q_j} is used with variable arrow lengths and sometimes without the arrow (e.g., Eq. (28) and the switch cases in Sec. III.C); standardizing the notation would improve readability.
  5. [Sec. VI, Eq. (77)] The dimension statement dim(g(H_X)) = 2N + 1 is correct for the displayed spanning set, but the set is not shown to be linearly independent; a one-sentence justification would help.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the exponential lower bound is constructed directly from the Hamiltonian's Pauli terms by commutator closure, with no fitted inputs or load-bearing self-citations.

full rationale

The derivation is self-contained. Theorem III.1(2) is proven by starting from the explicit Pauli terms in H1,JW (Eq. (11)) and repeatedly closing under commutators: Lemma III.2 constructs strings X/Y at u(0) and P at u(i) from hopping terms, Lemma III.3 builds rung strings using the interaction term Zu(0)Zd(0), and the ladder construction enumerates 2^(N-1) distinct Pauli strings in g(H1,JW). Each step is justified by the defining closure property of the generated Lie algebra (Proposition II.1), not by assuming the claimed lower bound. Theorem IV.1 additionally uses only the involution parity of the Cartan decomposition and the same constructed strings to lower-bound dim(k). The only cited results used as tools are external: the Cartan/KHK decomposition [37,40,41] and the DLA classification [39], and earlier self-citations are not load-bearing. No parameter is fitted and no 'prediction' is renamed input; the possible algebraic gap in Eqs. (36)-(37) would be a mathematical correctness issue, not circularity, and is outside this pass.

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

The central claim rests on standard Lie algebra facts (closure, Cartan decomposition KHK theorem) and on the domain assumption that the hopping graph is connected and that both X and Y hopping strings are present after Jordan-Wigner transformation. No free parameters are fitted and no new entities are postulated.

assumptions (3)
  • domain assumption The Jordan-Wigner transformed hopping terms include both X...X and Y...Y strings for every edge of the connected graph G.
    Lemma III.2 relies on the presence of both Pauli strings to build the required commutators; the paper notes in Sec. VI that if one is missing (e.g., Eq. (75)) the exponential lower bound fails.
  • standard math The Cartan decomposition KHK theorem applies to the Hamiltonian algebra with the given involution.
    Invoked in Sec. IV, step 3, following Refs. [37,40,41].
  • domain assumption The graph G representing hopping terms is connected.
    The paper restricts to connected graphs in Sec. III.A; disconnected graphs reduce to direct sums.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Fast-forwardability of Jordan-Wigner-transformed Fermion models based on Cartan decomposition." pith.science (2026). https://pith.science/paper/LGOMDO5N

@misc{pith2026250204620,
  author       = {Pith},
  title        = {Pith review of: Fast-forwardability of Jordan-Wigner-transformed Fermion models based on Cartan decomposition},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/LGOMDO5N}},
  note         = {Machine review of arXiv:2502.04620}
}
read the original abstract

We study the Hamiltonian algebra of Jordan-Wigner-transformed interacting fermion models and its fast-forwardability. We prove that the dimension of the Hamiltonian algebra of the fermion model with single-site Coulomb interaction is bounded from below by the exponential function of the number of sites, and the circuit depth of the Cartan-based fast-forwarding method for such model also exhibits the same scaling. We apply this proposition to the Anderson impurity model and the Hubbard model and show that the dimension of the Hamiltonian algebra of these models scales exponentially with the number of sites. These behaviors of the Hamiltonian algebras imply that the qubit models obtained by the Jordan-Wigner transformation of these fermion models cannot be efficiently simulated using the Cartan-based fast-forwarding method.

Figures

Figures reproduced from arXiv: 2502.04620 by the authors.

Figure 1
Figure 1. FIG. 1. Examples of connected graphs [PITH_FULL_IMAGE:figures/full_fig_p003_1.png] view at source ↗
Figure 2
Figure 2. FIG. 2. Schematic description of calculation to obtain [PITH_FULL_IMAGE:figures/full_fig_p005_2.png] view at source ↗
Figure 3
Figure 3. FIG. 3. Ladder graph. The length of the graph is equal to [PITH_FULL_IMAGE:figures/full_fig_p006_3.png] view at source ↗
Figures from the paper (4 more)
Figure 4
Figure 4. Figure 4: FIG. 4. Example of a path of the ladder diagram. [PITH_FULL_IMAGE:figures/full_fig_p006_4.png]
Figure 5
Figure 5. Figure 5: FIG. 5. Schematic representation of the procedure of con [PITH_FULL_IMAGE:figures/full_fig_p007_5.png]
Figure 6
Figure 6. Figure 6: FIG. 6. The relation of the subalgebra [PITH_FULL_IMAGE:figures/full_fig_p008_6.png]
Figure 7
Figure 7. Figure 7: FIG. 7. Graph representing hopping terms appearing in the [PITH_FULL_IMAGE:figures/full_fig_p009_7.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

51 extracted references · 32 canonical work pages

  1. [1]

    If ( i1, j1) = (d(1), d(2)), we set a Pauli string either Q1 =− − − − − − → Pd(1)Pd(2) or Q1 = − − − − − − → Pd(1)Pd(2)

    If ( i1, j1) = (u(1), u(2)), we set a Pauli string either Q1 = − − − − − − − → Pu(1)Pu(2) or Q1 = − − − − − − − → Pu(1)Pu(2). If ( i1, j1) = (d(1), d(2)), we set a Pauli string either Q1 =− − − − − − → Pd(1)Pd(2) or Q1 = − − − − − − → Pd(1)Pd(2). All these strings belong to g(H1,JW) according to Lemma. III.2. 6

    work page

  2. [2]

    We iterate the following operation for k = 1, 2, · · ·, N− 2: Depending on the combination of edges (ik, jk) and (ik+1, jk+1), we generate the new Pauli string Qk+1 from Qk. (a) ( ik, jk) = ( u(k), u(k + 1)) and ( ik+1, jk+1) = (u(k + 1), u(k + 2)): The string Qk anticommutes with one of the strings − − − − − − − − − − → Pu(k+1)Pu(k+2) or − − − − − − − − ...

    work page

  3. [3]

    to the path

    We assign the resulting Pauli string QN −1 obtained in step 2. to the path. We graphically represent the process of step 2. in Fig. 5. The reason why these operations succeed is as follows. At step 2. with k, if ( ik, jk) = (u(k), u(k + 1)) the tentative string Qk consists of • Pu(k+1) or Pu(k+1), • X or Y Pauli matrices at some spin-up sites with indices...

    work page

  4. [4]

    (58) In addition, k and m need to be constructed so that all of the Pauli strings appearing in the terms of the Hamiltonian H belong to m

    We decompose the Hamiltonian algebra g(H) into two subspaces k and m: g(H) = k ⊕ m, (55) where these subspaces k and m must satisfy the following conditions; [k, k] ⊂ k, (56) [m, m] ⊂ k, (57) [m, k] ⊂ m. (58) In addition, k and m need to be constructed so that all of the Pauli strings appearing in the terms of the Hamiltonian H belong to m. That is, if th...

    work page

  5. [5]

    Then, by using the involution θ, the subspace k (m) can be defined as the eigenspace of θ with eigenvalue +1 (−1)

    work page

  6. [6]

    We denote it as h

    We generate the maximal abelian subalgebra of m called the Cartan subalgebra. We denote it as h. The schematic picture of the relations among m, k, and h is shown in Fig. 6

    work page

  7. [7]

    We apply this theorem to the qubit Hamiltonian H ∈ m to construct the time evolution operator, eiHt = Ke ithK †

    According to the ”KHK” theorem [37, 40, 41], for any m ∈ m, there exist h ∈ h and K = Q j eiθj kj ({kj} is the Pauli-string basis of k and θj ∈ R) such that m = KhK †. We apply this theorem to the qubit Hamiltonian H ∈ m to construct the time evolution operator, eiHt = Ke ithK †. (60) According to the above process, the circuit depth of the Cartan-based f...

    work page

  8. [8]

    Both − − − − − − − →Xu(0)Pu(1) and − − − − − − → Yu(0)Pu(1) belong to m

    work page

Show all 51 references
  1. [9]

    In the case 2., because of Zu(0)Zd(0) ∈ m and Eq

    Both − − − − − − − →Xu(0)Pu(1) and − − − − − − → Yu(0)Pu(1) belong to k. In the case 2., because of Zu(0)Zd(0) ∈ m and Eq. (58), both − − − − − − − →Xu(0)Pu(1) · Zu(0)Zd(0) and − − − − − − → Yu(0)Pu(1) · Zu(0)Zd(0) belong to m. A similar argument holds for − − − − − − − →Xd(0)...

  2. [10]

    Aspuru-Guzik, A

    A. Aspuru-Guzik, A. D. Dutoi, P. J. Love, and M. Head- Gordon, Simulated quantum computation of molecular energies, Science 309, 1704 (2005)

    2005

  3. [11]

    Y. Cao, J. Romero, J. P. Olson, M. Degroote, P. D. John- son, M. Kieferov´ a, I. D. Kivlichan, T. Menke, B. Per- opadre, N. P. D. Sawaya, S. Sim, L. Veis, and A. Aspuru- Guzik, Quantum chemistry in the age of quantum com- puting, Chemical Reviews 119, 10856 (2019), pMID: 31469277

    2019

  4. [12]

    Bauer, S

    B. Bauer, S. Bravyi, M. Motta, and G. K.-L. Chan, Quantum algorithms for quantum chemistry and quan- tum materials science, Chemical Reviews 120, 12685 (2020), pMID: 33090772

    2020

  5. [13]

    McArdle, S

    S. McArdle, S. Endo, A. Aspuru-Guzik, S. C. Benjamin, and X. Yuan, Quantum computational chemistry, Rev. Mod. Phys. 92, 015003 (2020)

    2020

  6. [14]

    Motta and J

    M. Motta and J. E. Rice, Emerging quantum comput- ing algorithms for quantum chemistry, Wiley Interdisci- plinary Reviews: Computational Molecular Science 12, e1580 (2022)

    2022

  7. [15]

    Herman, C

    D. Herman, C. Googin, X. Liu, A. Galda, I. Safro, Y. Sun, M. Pistoia, and Y. Alexeev, A survey of quantum computing for finance, arXiv preprint arXiv:2201.02773 (2022)

    2022 arXiv

  8. [16]

    Bouland, W

    A. Bouland, W. van Dam, H. Joorati, I. Kerenidis, and A. Prakash, Prospects and challenges of quantum finance, arXiv preprint arXiv:2011.06492 (2020)

    2020 arXiv

  9. [17]

    R. P. Feynman, Simulating physics with computers, International Journal of Theoretical Physics 21, 467 (1999)

    1999

  10. [18]

    M. A. Nielsen and I. L. Chuang, Quantum computation and quantum information (Cambridge university press, 2010)

    2010

  11. [19]

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

    1959

  12. [20]

    M. Suzuki, Generalized trotter’s formula and systematic approximants of exponential operators and inner deriva- tions with applications to many-body problems, Commu- nications in Mathematical Physics 51, 183 (1976)

    1976

  13. [21]

    Lloyd, Universal quantum simulators, Science 273, 1073 (1996)

    S. Lloyd, Universal quantum simulators, Science 273, 1073 (1996)

    1996

  14. [22]

    A. T. Sornborger and E. D. Stewart, Higher-order meth- ods for simulations on quantum computers, Phys. Rev. A 60, 1956 (1999)

    1999

  15. [23]

    Li and S

    Y. Li and S. C. Benjamin, Efficient variational quantum simulator incorporating active error minimization, Phys. Rev. X 7, 021050 (2017)

    2017

  16. [24]

    X. Yuan, S. Endo, Q. Zhao, Y. Li, and S. C. Benjamin, Theory of variational quantum simulation, Quantum 3, 191 (2019)

    2019

  17. [25]

    K. Heya, K. M. Nakanishi, K. Mitarai, Z. Yan, K. Zuo, Y. Suzuki, T. Sugiyama, S. Tamate, Y. Tabuchi, K. Fujii, and Y. Nakamura, Subspace variational quantum simu- lator, Phys. Rev. Res. 5, 023078 (2023)

    2023

  18. [26]

    S. Endo, J. Sun, Y. Li, S. C. Benjamin, and X. Yuan, Variational quantum simulation of general processes, Phys. Rev. Lett. 125, 010501 (2020)

    2020

  19. [27]

    Benedetti, M

    M. Benedetti, M. Fiorentini, and M. Lubasch, Hardware- efficient variational quantum algorithms for time evolu- tion, Phys. Rev. Res. 3, 033083 (2021)

    2021

  20. [28]

    S.-H. Lin, R. Dilip, A. G. Green, A. Smith, and F. Poll- mann, Real- and imaginary-time evolution with com- pressed quantum circuits, PRX Quantum 2, 010342 12 (2021)

    2021

  21. [29]

    N. F. Berthusen, T. V. Trevisan, T. Iadecola, and P. P. Orth, Quantum dynamics simulations beyond the coher- ence time on noisy intermediate-scale quantum hardware by variational trotter compression, Phys. Rev. Res. 4, 023097 (2022)

    2022

  22. [30]

    Mizuta, Y

    K. Mizuta, Y. O. Nakagawa, K. Mitarai, and K. Fujii, Lo- cal variational quantum compilation of large-scale hamil- tonian dynamics, PRX Quantum 3, 040302 (2022)

    2022

  23. [31]

    Akahoshi, R

    Y. Akahoshi, R. Toshio, J. Fujisaki, H. Oshima, S. Sato, and K. Fujii, Compilation of trotter-based time evolution for partially fault-tolerant quantum computing architec- ture, arXiv preprint arXiv:2408.14929 (2024)

    2024 arXiv

  24. [32]

    Kanasugi, S

    S. Kanasugi, S. Tsutsui, Y. O. Nakagawa, K. Maruyama, H. Oshima, and S. Sato, Computation of green’s function by local variational quantum compilation, Phys. Rev. Res. 5, 033070 (2023)

    2023

  25. [33]

    Kanasugi, Y

    S. Kanasugi, Y. Hidaka, Y. O. Nakagawa, S. Tsutsui, N. Matsumoto, K. Maruyama, H. Oshima, and S. Sato, Subspace-based local compilation of variational quantum circuits for large-scale quantum many-body simulation, arXiv preprint arXiv:2407.14163 (2024)

    2024 arXiv

  26. [34]

    Campbell, Random compiler for fast hamiltonian sim- ulation, Phys

    E. Campbell, Random compiler for fast hamiltonian sim- ulation, Phys. Rev. Lett. 123, 070503 (2019)

    2019

  27. [35]

    G. H. Low and I. L. Chuang, Hamiltonian Simulation by Qubitization, Quantum 3, 163 (2019)

    2019

  28. [36]

    Babbush, C

    R. Babbush, C. Gidney, D. W. Berry, N. Wiebe, J. Mc- Clean, A. Paler, A. Fowler, and H. Neven, Encoding elec- tronic spectra in quantum circuits with linear t complex- ity, Phys. Rev. X 8, 041015 (2018)

    2018

  29. [37]

    Atia and D

    Y. Atia and D. Aharonov, Fast-forwarding of hamilto- nians and exponentially precise measurements, Nature communications 8, 1572 (2017)

    2017

  30. [38]

    Chia, K.-M

    N.-H. Chia, K.-M. Chung, Y.-C. Hsieh, H.-H. Lin, Y.- T. Lin, and Y.-C. Shen, On the impossibility of general parallel fast-forwarding of hamiltonian simulation, arXiv preprint arXiv:2305.12444 (2023)

    2023 arXiv

  31. [39]

    S. Gu, R. D. Somma, and B. S ¸ahino˘ glu, Fast-forwarding quantum evolution, Quantum 5, 577 (2021)

    2021

  32. [40]

    D. W. Berry, G. Ahokas, R. Cleve, and B. C. Sanders, Ef- ficient quantum algorithms for simulating sparse hamil- tonians, Communications in Mathematical Physics 270, 359 (2007)

    2007

  33. [41]

    K. H. Lim, T. Haug, L. C. Kwek, and K. Bharti, Fast- forwarding with nisq processors without feedback loop, Quantum Science and Technology 7, 015001 (2021)

    2021

  34. [42]

    Dong and L

    Y. Dong and L. Lin, Multi-level quantum signal pro- cessing with applications to ground state preparation us- ing fast-forwarded hamiltonian evolution, arXiv preprint arXiv:2406.02086 (2024)

    2024 arXiv

  35. [43]

    Cirstoiu, Z

    C. Cirstoiu, Z. Holmes, J. Iosue, L. Cincio, P. J. Coles, and A. Sornborger, Variational fast forwarding for quan- tum simulation beyond the coherence time, npj Quantum Information 6, 82 (2020)

    2020

  36. [44]

    Gibbs, K

    J. Gibbs, K. Gili, Z. Holmes, B. Commeau, A. Arrasmith, L. Cincio, P. J. Coles, and A. Sornborger, Long-time sim- ulations for fixed input states on quantum hardware, npj Quantum Information 8, 135 (2022)

    2022

  37. [45]

    Commeau, M

    B. Commeau, M. Cerezo, Z. Holmes, L. Cincio, P. J. Coles, and A. Sornborger, Variational hamiltonian di- agonalization for dynamical quantum simulation, arXiv preprint arXiv:2009.02559 (2020)

    2020 arXiv

  38. [46]

    K¨ okc¨ u, T

    E. K¨ okc¨ u, T. Steckmann, Y. Wang, J. K. Freericks, E. F. Dumitrescu, and A. F. Kemper, Fixed depth hamiltonian simulation via cartan decomposition, Phys. Rev. Lett. 129, 070501 (2022)

    2022

  39. [47]

    d’Alessandro, Introduction to quantum control and dy- namics (Chapman and hall/CRC, 2021)

    D. d’Alessandro, Introduction to quantum control and dy- namics (Chapman and hall/CRC, 2021)

    2021

  40. [48]

    Wiersema, E

    R. Wiersema, E. K¨ okc¨ u, A. F. Kemper, and B. N. Bakalov, Classification of dynamical lie algebras of 2- local spin systems on linear, circular and fully connected topologies, npj Quantum Information 10, 110 (2024)

    2024

  41. [49]

    Helgason, Differential Geometry, Lie Groups, and Symmetric Spaces , Crm Proceedings & Lecture Notes (American Mathematical Society, 2001)

    S. Helgason, Differential Geometry, Lie Groups, and Symmetric Spaces , Crm Proceedings & Lecture Notes (American Mathematical Society, 2001)

    2001

  42. [50]

    H. N. S. Earp and J. K. Pachos, A constructive algo- rithm for the cartan decomposition of su(2n), Journal of Mathematical Physics 46, 082108 (2005)

    2005

  43. [51]

    Steckmann, T

    T. Steckmann, T. Keen, E. K¨ okc¨ u, A. F. Kemper, E. F. Dumitrescu, and Y. Wang, Mapping the metal-insulator phase diagram by algebraically fast-forwarding dynamics on a cloud quantum computer, Phys. Rev. Res.5, 023198 (2023)

    2023

Pith tools

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