pith. machine review for the scientific record. sign in

arxiv: 2512.11967 · v2 · submitted 2025-12-12 · 🪐 quant-ph · cond-mat.str-el

Recognition: 2 theorem links

· Lean Theorem

Holographic Representation of One-Dimensional Many-Body Quantum States via Isometric Tensor Networks

Kaito Kobayashi , Benjamin Sappler , Frank Pollmann
Authors on Pith no claims yet

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

classification 🪐 quant-ph cond-mat.str-el
keywords tensor networksholographic statesisometric tensorsvolume law entanglementquantum many-body physicsfermionic Gaussian statesClifford statesTEBD algorithm
0
0 comments X

The pith

Holographic isometric tensor networks represent highly entangled quantum states in one dimension at fixed bond dimension.

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

The paper proposes holographic isometric tensor network states to overcome the limitations of standard tensor networks in representing volume-law entangled states. By embedding one-dimensional systems into two-dimensional networks of isometric tensors, the method enlarges the space of representable wavefunctions while keeping contractions efficient. Analytic constructions show that holographic isoTNS can exactly capture arbitrary fermionic Gaussian states, Clifford states, rainbow state extensions, and short-time local evolutions. Variational methods and a TEBD algorithm are developed to optimize and evolve these states. This approach opens tensor network methods to the study of highly entangled regimes without exponential resource costs.

Core claim

Holographic isoTNS use (D+1)-dimensional isometric tensor networks to represent D-dimensional quantum states. In one dimension, they exhibit volume-law entanglement when randomly initialized and can faithfully represent a broad class of highly entangled low-complexity states including fermionic Gaussian states, Clifford states, extensions of rainbow states, and certain short-time evolved states.

What carries the argument

Holographic isometric tensor network states, consisting of isometric tensors arranged in an additional spatial dimension to simulate the target quantum system while preserving efficient contractibility through isometry constraints.

If this is right

  • Random holographic isoTNS display volume-law entanglement at fixed bond dimension.
  • The ansatz exactly represents arbitrary fermionic Gaussian states, Clifford states, rainbow extensions, and short-time local evolutions.
  • A scalable TEBD algorithm can be run on these networks for time evolution.
  • Error accumulation in TEBD suggests need for algorithmic refinements.

Where Pith is reading between the lines

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

  • Such networks may allow efficient simulation of dynamics in volume-law entangled phases.
  • The holographic structure could link to ideas for quantum many-body systems with extra dimensions.
  • Generalization to higher dimensions might yield similar expressivity gains.
  • Optimization landscapes for these states could differ from standard MPS due to the enlarged manifold.

Load-bearing premise

Isometric constraints keep tensor contractions efficient even as the extra dimension captures the increased entanglement entropy.

What would settle it

Demonstrating a low-complexity high-entanglement state that requires bond dimension scaling exponentially with system size for exact representation in holographic isoTNS, or measuring contraction costs that grow exponentially.

Figures

Figures reproduced from arXiv: 2512.11967 by Benjamin Sappler, Frank Pollmann, Kaito Kobayashi.

Figure 1
Figure 1. Figure 1: FIG. 1: Graphical notation for tensor networks. Each circle is a ten [PITH_FULL_IMAGE:figures/full_fig_p002_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: FIG. 2: (a) Diagrammatic representation of the holographic isoTNS ansatz for [PITH_FULL_IMAGE:figures/full_fig_p004_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: FIG. 3: (a) Contraction scheme for the calculation of the half-chain [PITH_FULL_IMAGE:figures/full_fig_p005_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: FIG. 4: Variational optimization of holographic isoTNS (blue) and [PITH_FULL_IMAGE:figures/full_fig_p008_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: FIG. 5: The TEBD algorithm on holographic isoTNS. The time [PITH_FULL_IMAGE:figures/full_fig_p009_5.png] view at source ↗
Figure 6
Figure 6. Figure 6: FIG. 6: (a) Time evolution of the mean value of [PITH_FULL_IMAGE:figures/full_fig_p010_6.png] view at source ↗
Figure 7
Figure 7. Figure 7: FIG. 7: A sketch of the Moses move algorithm. (a) The tripartite [PITH_FULL_IMAGE:figures/full_fig_p013_7.png] view at source ↗
read the original abstract

Tensor network methods, most prominently matrix product states (MPS), have become fundamental tools in modern quantum many-body physics. While MPS and extensions like the multiscale entanglement renormalization ansatz (MERA) and tree tensor networks (TTN) efficiently capture area-law entanglement and its logarithmic violations, they inherently struggle to represent highly entangled wavefunctions. Specifically, reaching the volume-law regime typically demands exponential resources within these conventional frameworks. Motivated by this challenge, we propose holographic isometric tensor network states (holographic isoTNS) that simulate quantum lattice models in $D$ spatial dimensions via $(D+1)$-dimensional networks of tensors. The additional dimension substantially enlarges the representational manifold, while isometric constraints on each tensor ensure efficient contractibility. Using one-dimensional systems as testbeds, we analyze the properties of holographic isoTNS. First, we show that randomly initialized holographic isoTNS typically display volume-law entanglement at fixed bond dimension. Second, through analytic constructions and variational optimization, we demonstrate that holographic isoTNS can faithfully describe a broad class of highly entangled yet low-complexity states. In particular, the ansatz can represent arbitrary fermionic Gaussian states, Clifford states, extensions of rainbow states, and certain short-time-evolved states under local evolution. Third, to exploit this expressivity in broader contexts, we implement a time-evolving block decimation (TEBD) algorithm on holographic isoTNS. While the method remains efficient and scalable, error accumulation over TEBD sweeps suggests the need for further algorithmic improvement. Overall, holographic isoTNS broaden the scope of tensor-network methods, opening new avenues to study physics in the volume-law regime.

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 holographic isometric tensor network states (holographic isoTNS) as (D+1)-dimensional isometric tensor networks for representing one-dimensional many-body quantum states. It shows that randomly initialized holographic isoTNS produce volume-law entanglement entropy at fixed bond dimension, supplies explicit isometric constructions that exactly reproduce arbitrary fermionic Gaussian states, Clifford states, rainbow-state extensions, and certain short-time locally evolved states, and implements a TEBD algorithm whose contractions remain polynomial in system size and bond dimension.

Significance. If the central representational claims hold, the work meaningfully enlarges the class of states accessible to tensor networks beyond area-law regimes while preserving efficient contractibility. The provision of explicit, exact constructions for Gaussian, Clifford, and rainbow states together with direct numerical verification of volume-law scaling via contraction constitutes a concrete, falsifiable advance that could enable new studies of highly entangled yet low-complexity dynamics.

major comments (2)
  1. [TEBD implementation] In the TEBD implementation section, error accumulation over successive sweeps is noted qualitatively but no quantitative scaling (e.g., dependence on sweep count, bond dimension, or Trotter step size) or comparison against standard MPS-TEBD error metrics is supplied; this directly affects the claim that the algorithm remains practical for broader applications.
  2. [variational optimization] In the variational optimization results for the target state classes, no error bars, convergence tolerances, or statistics over random initializations are reported; without these data the assertion of faithful representation rests on limited visible evidence and cannot be fully assessed.
minor comments (2)
  1. [Abstract] The abstract refers to 'certain short-time-evolved states under local evolution' without specifying the Hamiltonian class or maximum evolution time; a brief clarification would improve precision.
  2. [Introduction] Notation for the additional holographic dimension and the precise isometric constraints on each tensor could be introduced with a small diagram or equation in the opening section to aid readers unfamiliar with the construction.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the constructive feedback and positive overall assessment of our work on holographic isometric tensor networks. We address each major comment below and will incorporate the suggested improvements in a revised manuscript.

read point-by-point responses

  1. Referee: In the TEBD implementation section, error accumulation over successive sweeps is noted qualitatively but no quantitative scaling (e.g., dependence on sweep count, bond dimension, or Trotter step size) or comparison against standard MPS-TEBD error metrics is supplied; this directly affects the claim that the algorithm remains practical for broader applications.

    Authors: We agree that quantitative characterization of the error accumulation is necessary to substantiate the practicality of the TEBD algorithm. In the revised manuscript we will add numerical results that explicitly show the dependence of the accumulated error on the number of sweeps, bond dimension, and Trotter step size. We will also include a side-by-side comparison with the error metrics obtained from standard MPS-TEBD on the same short-time evolution problems, thereby clarifying the regimes in which the holographic isoTNS approach remains competitive. revision: yes

  2. Referee: In the variational optimization results for the target state classes, no error bars, convergence tolerances, or statistics over random initializations are reported; without these data the assertion of faithful representation rests on limited visible evidence and cannot be fully assessed.

    Authors: We acknowledge that the current presentation of the variational results would benefit from additional statistical information. In the revised manuscript we will report error bars (standard deviations over multiple runs), the convergence tolerances employed in the optimization, and statistics collected over several random initializations for each target state class (Gaussian, Clifford, rainbow, and short-time evolved states). These additions will provide a clearer assessment of the reliability of the reported fidelities. revision: yes

Circularity Check

0 steps flagged

No significant circularity detected

full rationale

The paper's central claims rest on explicit analytic constructions that exactly reproduce target states (fermionic Gaussian, Clifford, rainbow extensions, short-time evolutions) at finite bond dimension, plus direct contraction of randomly initialized networks to exhibit volume-law entanglement. These steps are independent of any fitted parameters renamed as predictions, self-referential definitions, or load-bearing self-citations. The isometric constraints are used only to guarantee polynomial contractibility, with no internal reduction of the representational result to its own inputs. TEBD is presented with explicit caveats on accumulating errors, preserving the self-contained nature of the derivation.

Axiom & Free-Parameter Ledger

1 free parameters · 1 axioms · 1 invented entities

The central claim rests on the new holographic isoTNS construction, the domain assumption that isometric tensors remain efficiently contractible in the extra dimension, and the standard tensor-network axiom that bond dimension controls expressivity versus cost.

free parameters (1)
  • bond dimension
    Controls tensor size and is chosen to achieve desired entanglement scaling; appears as the fixed parameter in all reported tests.
axioms (1)
  • domain assumption Isometric constraints on tensors ensure efficient contractibility
    Invoked to guarantee that the (D+1)-dimensional network remains tractable despite the added dimension.
invented entities (1)
  • holographic isoTNS no independent evidence
    purpose: New ansatz that uses an extra dimension to capture volume-law entanglement while preserving efficient contraction
    Introduced in the paper as the core representational object; no independent falsifiable evidence outside the constructions is provided.

pith-pipeline@v0.9.0 · 5607 in / 1270 out tokens · 69222 ms · 2026-05-16T22:40:00.709185+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

82 extracted references · 82 canonical work pages · 6 internal anchors

  1. [1]

    In this case, one can extremize the cost function by iteratively optimizing one ten- sor at a time

    Alternating linearized optimization Assume first that the cost function is linear in all its argu- ments, i.e., given by the contraction of a tensor network in which each tensor appears only once. In this case, one can extremize the cost function by iteratively optimizing one ten- sor at a time. To optimize an isometryW i ∈C ni×mi, we first contract the t...

    work page

  2. [2]

    Additionally, the method often con- verges only very slowly, especially if the cost function de- pends on many tensors

    Riemannian Optimization The alternating linearized optimization can only be used if the cost functions can be expressed as the contraction of a tensor network. Additionally, the method often con- verges only very slowly, especially if the cost function de- pends on many tensors. Riemannian optimization generalizes known euclidean optimization algorithms l...

    work page

  3. [3]

    P. W. Anderson, More is different, Science177, 393 (1972)

    work page 1972

  4. [4]

    P. A. Lee, N. Nagaosa, and X.-G. Wen, Doping a mott insula- tor: Physics of high-temperature superconductivity, Rev. Mod. Phys.78, 17 (2006)

    work page 2006

  5. [5]

    M. Z. Hasan and C. L. Kane, Colloquium: Topological insula- tors, Rev. Mod. Phys.82, 3045 (2010)

    work page 2010

  6. [6]

    J. I. Cirac, D. P ´erez-Garc´ıa, N. Schuch, and F. Verstraete, Ma- trix product states and projected entangled pair states: Con- cepts, symmetries, theorems, Rev. Mod. Phys.93, 045003 (2021)

    work page 2021

  7. [7]

    S. R. White, Density matrix formulation for quantum renormal- ization groups, Phys. Rev. Lett.69, 2863 (1992)

    work page 1992

  8. [8]

    S. R. White, Density-matrix algorithms for quantum renormal- ization groups, Phys. Rev. B48, 10345 (1993)

    work page 1993

  9. [9]

    Schollw ¨ock, The density-matrix renormalization group, Rev

    U. Schollw ¨ock, The density-matrix renormalization group, Rev. Mod. Phys.77, 259 (2005)

    work page 2005

  10. [10]

    Verstraete and J

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

    work page 2006

  11. [11]

    M. B. Hastings, An area law for one-dimensional quantum sys- tems, J. Stat. Mech2007, P08024 (2007)

    work page 2007

  12. [12]

    Verstraete, V

    F. Verstraete, V . Murg, and J. Cirac, Matrix product states, projected entangled pair states, and variational renormalization group methods for quantum spin systems, Adv. Phys.57, 143 (2008)

    work page 2008

  13. [13]

    Schollw ¨ock, The density-matrix renormalization group in the age of matrix product states, Ann

    U. Schollw ¨ock, The density-matrix renormalization group in the age of matrix product states, Ann. Phys.326, 96 (2011), january 2011 Special Issue

    work page 2011

  14. [14]

    Or ´us, A practical introduction to tensor networks: Matrix product states and projected entangled pair states, Ann

    R. Or ´us, A practical introduction to tensor networks: Matrix product states and projected entangled pair states, Ann. Phys. 349, 117 (2014)

    work page 2014

  15. [15]

    There are different ways a complexity measure on quantum states can be defined. We adapt the following definition: The complexity of a quantum state|Ψ⟩is the minimal circuit depth needed to transform the computational basis state to a state|Ψ′⟩ with∥|Ψ⟩ − |Ψ ′⟩∥< εusing only local two-qubit unitaries

    work page

  16. [16]

    Shi, L.-M

    Y .-Y . Shi, L.-M. Duan, and G. Vidal, Classical simulation of quantum many-body systems with a tree tensor network, Phys. Rev. A74, 022320 (2006)

    work page 2006

  17. [17]

    Vidal, Entanglement renormalization, Phys

    G. Vidal, Entanglement renormalization, Phys. Rev. Lett.99, 220405 (2007)

    work page 2007

  18. [18]

    Vidal, Class of quantum many-body states that can be effi- ciently simulated, Phys

    G. Vidal, Class of quantum many-body states that can be effi- ciently simulated, Phys. Rev. Lett.101, 110501 (2008)

    work page 2008

  19. [19]

    V . Murg, F. Verstraete, O. Legeza, and R. M. Noack, Simulating strongly correlated quantum systems with tree tensor networks, Phys. Rev. B82, 205105 (2010)

    work page 2010

  20. [20]

    Poulin, A

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

    work page 2011

  21. [21]

    S.-H. Lin, R. Dilip, A. G. Green, A. Smith, and F. Pollmann, Real- and imaginary-time evolution with compressed quantum circuits, PRX Quantum2, 010342 (2021)

    work page 2021

  22. [22]

    F. G. Brand˜ao, W. Chemissany, N. Hunter-Jones, R. Kueng, and J. Preskill, Models of quantum complexity growth, PRX Quan- tum2, 030316 (2021)

    work page 2021

  23. [23]

    M. P. Zaletel and F. Pollmann, Isometric tensor network states in two dimensions, Phys. Rev. Lett.124, 037201 (2020)

    work page 2020

  24. [24]

    Haghshenas, M

    R. Haghshenas, M. J. O’Rourke, and G. K.-L. Chan, Conver- sion of projected entangled pair states into a canonical form, Phys. Rev. B100, 054404 (2019)

    work page 2019

  25. [25]

    Hyatt and E

    K. Hyatt and E. M. Stoudenmire, Dmrg approach to op- timizing two-dimensional tensor networks, arXiv preprint arXiv:1908.08833 (2019)

    work page arXiv 1908

  26. [26]

    Diagonal Isometric Form for Tensor Product States in Two Dimensions

    B. Sappler, M. Kawano, M. P. Zaletel, and F. Pollmann, Diago- nal isometric form for tensor product states in two dimensions, arXiv preprint arXiv:2507.08080 (2025)

    work page internal anchor Pith review Pith/arXiv arXiv 2025

  27. [27]

    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 dimensions, arXiv preprint cond-mat/0407066 (2004)

    work page internal anchor Pith review Pith/arXiv arXiv 2004

  28. [28]

    Verstraete, M

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

    work page 2006

  29. [29]

    Schuch, M

    N. Schuch, M. M. Wolf, F. Verstraete, and J. I. Cirac, Computa- tional complexity of projected entangled pair states, Phys. Rev. Lett.98, 140506 (2007)

    work page 2007

  30. [30]

    Arad and Z

    I. Arad and Z. Landau, Quantum computation and the evalua- tion of tensor networks, SIAM J. Comput.39, 3089 (2010)

    work page 2010

  31. [31]

    Vidal, Efficient classical simulation of slightly entangled quantum computations, Phys

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

    work page 2003

  32. [32]

    Vidal, Efficient simulation of one-dimensional quantum many-body systems, Phys

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

    work page 2004

  33. [33]

    Surace and L

    J. Surace and L. Tagliacozzo, Fermionic Gaussian states: an in- troduction to numerical approaches, SciPost Phys. Lect. Notes , 54 (2022)

    work page 2022

  34. [34]

    Gottesman, Theory of fault-tolerant quantum computation, 15 Phys

    D. Gottesman, Theory of fault-tolerant quantum computation, 15 Phys. Rev. A57, 127 (1998)

    work page 1998

  35. [35]

    Soejima, K

    T. Soejima, K. Siva, N. Bultinck, S. Chatterjee, F. Pollmann, and M. P. Zaletel, Isometric tensor network representation of string-net liquids, Phys. Rev. B101, 085117 (2020)

    work page 2020

  36. [36]

    S.-H. Lin, M. P. Zaletel, and F. Pollmann, Efficient simulation of dynamics in two-dimensional quantum spin systems with iso- metric tensor networks, Phys. Rev. B106, 245102 (2022)

    work page 2022

  37. [37]

    Z. Dai, Y . Wu, T. Wang, and M. P. Zaletel, Fermionic isometric tensor network states in two dimensions, Phys. Rev. Lett.134, 026502 (2025)

    work page 2025

  38. [38]

    Y . Wu, Z. Dai, S. Anand, S.-H. Lin, Q. Yang, L. Wang, F. Poll- mann, and M. P. Zaletel, Alternating and gaussian fermionic isometric tensor network states, PRX Quantum6, 040324 (2025)

    work page 2025

  39. [39]

    Kadow, F

    W. Kadow, F. Pollmann, and M. Knap, Isometric tensor network representations of two-dimensional thermal states, Phys. Rev. B 107, 205106 (2023)

    work page 2023

  40. [40]

    Y . Wu, S. Anand, S.-H. Lin, F. Pollmann, and M. P. Zaletel, Two-dimensional isometric tensor networks on an infinite strip, Phys. Rev. B107, 245118 (2023)

    work page 2023

  41. [41]

    M. S. J. Tepaske and D. J. Luitz, Three-dimensional isometric tensor networks, Phys. Rev. Res.3, 023236 (2021)

    work page 2021

  42. [42]

    Slattery and B

    L. Slattery and B. K. Clark, Quantum circuits for two- dimensional isometric tensor networks, arXiv preprint arXiv:2108.02792 (2021)

    work page arXiv 2021

  43. [43]

    Z.-Y . Wei, D. Malz, and J. I. Cirac, Sequential generation of projected entangled-pair states, Phys. Rev. Lett.128, 010607 (2022)

    work page 2022

  44. [44]

    Malz and R

    D. Malz and R. Trivedi, Computational complexity of isometric tensor-network states, PRX Quantum6, 020310 (2025)

    work page 2025

  45. [45]

    T. J. Osborne, J. Eisert, and F. Verstraete, Holographic quantum states, Phys. Rev. Lett.105, 260401 (2010)

    work page 2010

  46. [46]

    Gopalakrishnan, Push-down automata as sequential gener- ators of highly entangled states, J

    S. Gopalakrishnan, Push-down automata as sequential gener- ators of highly entangled states, J. Phys. A: Math. Theor.58, 055301 (2025)

    work page 2025

  47. [47]

    Sch ¨on, E

    C. Sch ¨on, E. Solano, F. Verstraete, J. I. Cirac, and M. M. Wolf, Sequential generation of entangled multiqubit states, Phys. Rev. Lett.95, 110503 (2005)

    work page 2005

  48. [48]

    Haghshenas, J

    R. Haghshenas, J. Gray, A. C. Potter, and G. K.-L. Chan, Vari- ational power of quantum circuit tensor networks, Phys. Rev. X 12, 011047 (2022)

    work page 2022

  49. [49]

    Anand, J

    S. Anand, J. Hauschild, Y . Zhang, A. C. Potter, and M. P. Za- letel, Holographic quantum simulation of entanglement renor- malization circuits, PRX Quantum4, 030334 (2023)

    work page 2023

  50. [50]

    D. Malz, G. Styliaris, Z.-Y . Wei, and J. I. Cirac, Preparation of matrix product states with log-depth quantum circuits, Phys. Rev. Lett.132, 040404 (2024)

    work page 2024

  51. [51]

    M ¨uller-Lennert, F

    M. M ¨uller-Lennert, F. Dupuis, O. Szehr, S. Fehr, and M. Tomamichel, On quantum r ´enyi entropies: A new general- ization and some properties, J. Math. Phys.54, 122203 (2013)

    work page 2013

  52. [52]

    Lubkin, Entropy of an n-system from its correlation with a k-reservoir, J

    E. Lubkin, Entropy of an n-system from its correlation with a k-reservoir, J. Math. Phys.19, 1028 (1978)

    work page 1978

  53. [53]

    D. N. Page, Average entropy of a subsystem, Phys. Rev. Lett. 71, 1291 (1993)

    work page 1993

  54. [54]

    S. K. Foong and S. Kanno, Proof of page’s conjecture on the av- erage entropy of a subsystem, Phys. Rev. Lett.72, 1148 (1994)

    work page 1994

  55. [55]

    D. M. Greenberger, M. A. Horne, A. Shimony, and A. Zeilinger, Bell’s theorem without inequalities, Am. J. Phys.58, 1131 (1990)

    work page 1990

  56. [56]

    D ¨ur, G

    W. D ¨ur, G. Vidal, and J. I. Cirac, Three qubits can be entangled in two inequivalent ways, Phys. Rev. A62, 062314 (2000)

    work page 2000

  57. [57]

    Dasgupta and S.-k

    C. Dasgupta and S.-k. Ma, Low-temperature properties of the random heisenberg antiferromagnetic chain, Phys. Rev. B22, 1305 (1980)

    work page 1980

  58. [58]

    Vitagliano, A

    G. Vitagliano, A. Riera, and J. I. Latorre, V olume-law scaling for the entanglement entropy in spin-1/2 chains, New J. Phys. 12, 113049 (2010)

    work page 2010

  59. [59]

    Ram ´ırez, J

    G. Ram ´ırez, J. Rodr´ıguez-Laguna, and G. Sierra, From confor- mal to volume law for the entanglement entropy in exponen- tially deformed critical spin 1/2 chains, J. Stat. Mech.2014, P10004 (2014)

    work page 2014

  60. [60]

    Fermionic Linear Optics and Matchgates

    E. Knill, Fermionic linear optics and matchgates, arXiv preprint quant-ph/0108033 (2001)

    work page internal anchor Pith review Pith/arXiv arXiv 2001

  61. [61]

    L. G. Valiant, Quantum circuits that can be simulated classically in polynomial time, SIAM J. Comput.31, 1229 (2002)

    work page 2002

  62. [62]

    B. M. Terhal and D. P. DiVincenzo, Classical simulation of noninteracting-fermion quantum circuits, Phys. Rev. A65, 032325 (2002)

    work page 2002

  63. [63]

    Jozsa and A

    R. Jozsa and A. Miyake, Matchgates and classical simulation of quantum circuits, Proc. R. Soc. A464, 3089 (2008)

    work page 2008

  64. [64]

    Jozsa, B

    R. Jozsa, B. Kraus, A. Miyake, and J. Watrous, Matchgate and space-bounded quantum computations are equivalent, Proc. R. Soc. A466, 809 (2010)

    work page 2010

  65. [65]

    Hebenstreit, R

    M. Hebenstreit, R. Jozsa, B. Kraus, S. Strelchuk, and M. Yo- ganathan, All pure fermionic non-gaussian states are magic states for matchgate computations, Phys. Rev. Lett.123, 080503 (2019)

    work page 2019

  66. [66]

    Disentangling strategies and entanglement transitions in unitary circuit games with matchgates

    R. Morral-Yepes, M. Langer, A. Gammon-Smith, B. Kraus, and F. Pollmann, Disentangling strategies and entanglement transi- tions in unitary circuit games with matchgates, arXiv preprint arXiv:2507.05055 (2025)

    work page internal anchor Pith review Pith/arXiv arXiv 2025

  67. [67]

    Maslov and M

    D. Maslov and M. Roetteler, Shorter Stabilizer Circuits via Bruhat Decomposition and Quantum Circuit Transformations, IEEE Trans. Inf. Theory64, 4729 (2018)

    work page 2018

  68. [68]

    Maslov and W

    D. Maslov and W. Yang, CNOT circuits need little help to im- plement arbitrary Hadamard-free Clifford transformations they generate, npj Quantum Inf.9, 96 (2023)

    work page 2023

  69. [69]

    Quantum computing with Qiskit

    A. Javadi-Abhari, M. Treinish, K. Krsulich, C. J. Wood, J. Lish- man, J. Gacon, S. Martiel, P. D. Nation, L. S. Bishop, A. W. Cross, B. R. Johnson, and J. M. Gambetta, Quantum comput- ing with Qiskit (2024), arXiv:2405.08810 [quant-ph]

    work page internal anchor Pith review Pith/arXiv arXiv 2024

  70. [70]

    Prosen, General relation between quantum ergodicity and fi- delity of quantum dynamics, Phys

    T. Prosen, General relation between quantum ergodicity and fi- delity of quantum dynamics, Phys. Rev. E65, 036208 (2002)

    work page 2002

  71. [71]

    Chaos and Complexity of quantum motion

    T. Prosen, Chaos and Complexity of quantum motion, J. Phys. A: Math. Theor.40, 7881 (2007), arXiv:0704.2247 [quant-ph]

    work page internal anchor Pith review Pith/arXiv arXiv 2007

  72. [72]

    Evenbly and G

    G. Evenbly and G. Vidal, Algorithms for entanglement renor- malization, Phys. Rev. B79, 144108 (2009)

    work page 2009

  73. [73]

    E. G and V . G, Algorithms for Entanglement Renormalization: Boundaries, Impurities and Interfaces, J. Stat. Phys.157, 931 (2014)

    work page 2014

  74. [74]

    This choice is related to the conventional one by a global rotation and leaves the physics unchanged, while rendering Eq

    We apply the Jordan-Wigner transformation by taking the fermionic vacuum to be|+ +· · ·+⟩; equivalentlyn j =(1− σx j)/2. This choice is related to the conventional one by a global rotation and leaves the physics unchanged, while rendering Eq. (5) purely quadratic in fermions

    work page

  75. [75]

    Kobayashi, B

    K. Kobayashi, B. Sappler, and F. Pollmann, Holographic rep- resentation of one-dimensional many-body quantum states via isometric tensor networks, 10.5281/zenodo.17907383 (2025)

    work page doi:10.5281/zenodo.17907383 2025

  76. [76]

    Absil, R

    P.-A. Absil, R. Mahony, and R. Sepulchre, Optimization Algorithms on Matrix Manifolds: (Princeton University Press, 2008)

    work page 2008

  77. [77]

    I. A. Luchnikov, M. E. Krechetov, and S. N. Filippov, Rieman- nian geometry and automatic differentiation for optimization problems of quantum physics and quantum technologies, New J. Phys.23, 073006 (2021)

    work page 2021

  78. [78]

    Hauru, M

    M. Hauru, M. Van Damme, and J. Haegeman, Riemannian op- timization of isometric tensor networks, SciPost Phys.10, 040 (2021). 16

    work page 2021

  79. [79]

    Zhu, A Riemannian conjugate gradient method for opti- mization on the Stiefel manifold, Comput

    X. Zhu, A Riemannian conjugate gradient method for opti- mization on the Stiefel manifold, Comput. Optim. Appl.67, 73 (2017)

    work page 2017

  80. [80]

    Absil, C

    P.-A. Absil, C. Baker, and K. Gallivan, Trust-Region Meth- ods on Riemannian Manifolds, Found. Comput. Math.7, 303 (2007)

    work page 2007

Showing first 80 references.