Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Truncated Tensor-Train Reservoirs Are Reservoirs in Their Own Right: A Two-Resource Law for Memory Beyond the State Wall

Takuya Okamura

Published Jul 18, 2026• 0 citations
Publisher

Abstract

Compressing the connectivity of a reservoir removes the O(N²) memory wall, but the state vector itself still costs O(N) — the state wall, at N = 4¹⁵ > 10⁹ an unallocatable 8.6 GB. We introduce a reservoir whose state evolves natively in tensor-train (TT) form: TT matrix–vector product, TT input injection, rounding to bond dimension χx, and the hypersphere normalization, which is a scalar division of one core and therefore exactly rank-neutral. When χx reaches the maximal rank of the tensorization the evolution is exact to machine precision; below it, the reservoir is not a degraded copy of the exact one. We show that the exact attractor of sphere-TT dynamics at large N is near-maximally entangled (one-shot truncation error 0.93 at χx = 16, N = 65,536; flat middle-bond Schmidt spectrum), so post-hoc state compression is impossible; the truncated system instead carves out its own low-rank attractor, characterized by a per-step rounding error δ̄ that is measurable at runtime for free. Two quantitative laws organize this regime. First, a decomposition law: δ̄² ≈ (c·(1−β))² + δstock², fitting a 5×3 grid in the orthogonal-mixing weight β and χx within 2–5%; the flow term is injected by the random part of the connectivity, while the floor δstock — measured directly at β = 1, where the rank-1 Kronecker-orthogonal connectivity injects nothing — is the rank cost of the retained memory itself. Second, a two-resource memory law: linear memory capacity follows MC ≈ min{K₀·χx², MC_noise(δ̄)}, with a threshold regime, a quadratic capacity regime (measured MC/χx² constant across χx at fixed β), and a noise-limited regime where δ̄ saturates at the flow floor. Following these laws — raise β and χx together — we demonstrate memory capacity 30–74 (three seeds) at N = 1,073,741,824, where the dense state cannot be allocated, with the entire model (connectivity, state, input coupling) in 861 KB at ~1 s/step on a CPU; the naive configuration scores ≈ 0.1 there. A nonlinear task (NARMA10) reaches r² = 0.64 in the same regime. We state the open problems honestly: the microscopic mechanism of the χ_x² law, the growth of δ̄ with tensor order, and a residual quality-of-dynamics constraint at high β. Code and experiment logs: https://github.com/Volta-0936/sphertt (archived: DOI 10.5281/zenodo.21433254). Companion paper: DOI 10.5281/zenodo.21433291.

DOI
10.5281/zenodo.21433406

Related papers

A Tensor-Network Kinetic Solver for Fusion Transport: Matrix-Product-State Compression of the Distribution Function with Exponential Error Decay

Priyanca Ford

Kinetic descriptions of fusion plasmas are throttled by the curse of dimensionality: a distribution function on a six-dimensional phase space is intractable to store on a dense grid, let alone to advance in time. We show that the kinetic distribution function is strongly compressible in a low-rank tensor-network (matrix-product-state, or tensor-train) representation and that this yields a practical solver on present-day classical hardware, not merely a storage economy. We cast the problem formally: the discretized distribution is a high-order tensor, its matrix-product-state factorization is exact up to a truncation error bounded by the discarded Schmidt weight (Eckart–Young), and the number of retained modes needed for a target accuracy scales with the entanglement entropy of the state. On a one-dimensional-in-space, one-dimensional-in-velocity Bhatnagar–Gross–Krook (BGK) kinetic test problem, discretized on a periodic N_x=128× N_v=64 grid and advanced by operator-split upwind streaming and implicit relaxation, a matrix-product-state truncation reaches a relative-L^2 error of 2.9×10^-6 at bond dimension =8 while storing 0.19× the dense grid, and the error falls exponentially in the bond dimension — from 1.8×10^-1 at =1 to 2.2×10^-10 at =16 and to the double-precision floor (~10^-14) by =24. The velocity moments inherit the same convergence (density error 1.1×10^-6, temperature error 2.8×10^-6 at =8), and the converged distribution carries a Schmidt entanglement entropy below 0.1 nats — the area-law signature that makes it compressible. Every headline quantity is a frozen anchor in the Kronos de-risking register (gate KX-L1-A16). Beyond the anchor we give the general-dimensional machinery that carries the method to the five- and six-dimensional gyrokinetic problem — matrix-product-operator representations of the streaming and collision maps, dimension-linear tensor-train construction by cross interpolation, and a rank-adaptive, conservative dynamical-low-rank integrator that evolves the state on the low-rank manifold without inverting small singular values — together with the derived exponential-to-linear crossover in both storage and per-step arithmetic that motivates it. The result is a classical, deployable-today complement to the fault-tolerant-horizon quantum kinetic route, and we place it as a cross-cutting, verification-first module inside the Kronos autonomous control architecture: an advisory/supervisory reduced-kinetics solver, exercised twin-first beneath a deterministic safety clamp, that hands authority back to the deterministic floor on out-of-distribution inputs. The single honest gate is that the demonstration is a collision-dominated reduced problem, and the rank growth of the fully nonlinear, collisionless six-dimensional gyrokinetic distribution at reactor parameters remains the open question we scope explicitly. Key results (frozen anchors): v = 2 v; t = 3.27 ×10^-3; sigma_1 = 9.4 ×10^-2; sigma_1 = 2.5 ×10^-3; sigma_1 = 4.7 ×10^-5. Methods & codes: CGYRO, TGLF, GENE, Sauter, VQE, ADAPT-VQE. Live verification: 1 gate validator(s) with live-recompute cards (1 reproduced). See the Verification section and data/verification.csv. Related: Paper page · De-risking register · 3D model · Learn more about Kronos Part of the 2026 Kronos publication series; independently re-run and stamped in the Kronos de-risking register (DOI 10.5281/zenodo.22645689). All numerical values are frozen design-point anchors; see the register. Public research artifact. No proprietary, financial, or supply-chain information is included. Previous version: DOI 10.5281/zenodo.22132192. Please cite this version.

•Sep 7, 2026•2 citations

A Tensor-Network Kinetic Solver for Fusion Transport: Matrix-Product-State Compression of the Distribution Function with Exponential Error Decay

Priyanca Ford, P I Ford

Kinetic descriptions of fusion plasmas are throttled by the curse of dimensionality: a distribution function on a six-dimensional phase space is intractable to store on a dense grid, let alone to advance in time. We show that the kinetic distribution function is strongly compressible in a low-rank tensor-network (matrix-product-state, or tensor-train) representation and that this yields a practical solver on present-day classical hardware, not merely a storage economy. We cast the problem formally: the discretized distribution is a high-order tensor, its matrix-product-state factorization is exact up to a truncation error bounded by the discarded Schmidt weight (Eckart–Young), and the number of retained modes needed for a target accuracy scales with the entanglement entropy of the state. On a one-dimensional-in-space, one-dimensional-in-velocity Bhatnagar–Gross–Krook (BGK) kinetic test problem, discretized on a periodic N_x=128× N_v=64 grid and advanced by operator-split upwind streaming and implicit relaxation, a matrix-product-state truncation reaches a relative-L^2 error of 2.9×10^-6 at bond dimension =8 while storing 0.19× the dense grid, and the error falls exponentially in the bond dimension — from 1.8×10^-1 at =1 to 2.2×10^-10 at =16 and to the double-precision floor (~10^-14) by =24. The velocity moments inherit the same convergence (density error 1.1×10^-6, temperature error 2.8×10^-6 at =8), and the converged distribution carries a Schmidt entanglement entropy below 0.1 nats — the area-law signature that makes it compressible. Every headline quantity is a frozen anchor in the Kronos de-risking register (gate KX-L1-A16). Beyond the anchor we give the general-dimensional machinery that carries the method to the five- and six-dimensional gyrokinetic problem — matrix-product-operator representations of the streaming and collision maps, dimension-linear tensor-train construction by cross interpolation, and a rank-adaptive, conservative dynamical-low-rank integrator that evolves the state on the low-rank manifold without inverting small singular values — together with the derived exponential-to-linear crossover in both storage and per-step arithmetic that motivates it. The result is a classical, deployable-today complement to the fault-tolerant-horizon quantum kinetic route, and we place it as a cross-cutting, verification-first module inside the Kronos autonomous control architecture: an advisory/supervisory reduced-kinetics solver, exercised twin-first beneath a deterministic safety clamp, that hands authority back to the deterministic floor on out-of-distribution inputs. The single honest gate is that the demonstration is a collision-dominated reduced problem, and the rank growth of the fully nonlinear, collisionless six-dimensional gyrokinetic distribution at reactor parameters remains the open question we scope explicitly.Key results (frozen anchors): v = 2 v; t = 3.27 ×10^-3; N_v = 128 ×64; sigma_1 = 9.4 ×10^-2; sigma_1 = 2.5 ×10^-3; sigma_1 = 4.7 ×10^-5.Methods & codes: CGYRO, TGLF, GENE, Sauter, VQE, ADAPT-VQE.Live verification: 1 gate validator(s) with live-recompute cards (1 reproduced). See the Verification section and data/verification.csv.Related: Paper page · De-risking register · 3D model · Learn more about KronosPart of the 2026 Kronos publication series; independently re-run and stamped in the Kronos de-risking register (DOI 10.5281/zenodo.22645689).All numerical values are frozen design-point anchors; see the register.Public research artifact. No proprietary, financial, or supply-chain information is included.Note (REPLACE): This record replaces and supersedes DOI 10.5281/zenodo.22132192; please cite this version.

•Sep 9, 2026•0 citations

Task-Resolved Fisher Spectroscopy for Quantum Reservoir Computing

Yang Peng

Quantum reservoir computing (QRC) uses fixed quantum dynamics to encode a time series and trains only a classical readout, but a benchmark capacity alone does not reveal whether task information is lost in the reservoir, the measurement, feature compression, or finite sampling. We introduce \emph{task-resolved Fisher spectroscopy}, in which prediction targets define orthonormal score coordinates on the stationary distribution of input histories. Reweighting labeled histories along these scores generates an exactly affine family of reservoir states and measurement outcomes. In the same coordinates, we obtain a many-body Fisher-information hierarchy relating the state quantum Fisher information, the Fisher information of the complete measurement record, and moment matrices retained through many-body order $r$. The quadratic form of each moment matrix is exactly the stationary capacity of the optimal linear readout, while a finite-measurement extension predicts the approach from one-shot records to ideal expectation-value features. The measurement-level quantities require only stationary labeled records and measured outcome strings, not an input model or quantum-state tomography. In a five-spin open reservoir, interactions route fourth-order temporal information into higher-body correlations, so low-order compression can incur orders-of-magnitude sampling overhead even when a conventional parity target remains accessible. For correlated inputs and outputs, record-defined task scores predict held-out capacities, the required feature order, and measurement-budget dependence; optimizing the local measurement axis recovers otherwise hidden task information. The framework connects benchmark performance to experimentally actionable diagnoses of reservoir encoding, measurement choice, classical representation, and shot allocation.

quant-pharXiv:2609.29570•Aug 28, 2026•0 citations

A Block Tensor Train Burer-Monteiro Framework for Low-Rank Quantum State Tomography

Shakir Showkat Sofi, Charlotte Vermeylen, Fatemeh Mohammadi +1 more

Quantum state tomography is a fundamental technique for estimating the state of a quantum system from measured data and plays a crucial role in evaluating the performance of quantum devices. However, standard estimation methods become computationally prohibitive as the system size increases due to the exponential growth of the density matrix, describing a quantum state, with the number of qubits. We propose a low-rank tensor-network framework for mixed-state quantum state tomography based on a block tensor train (Block-TT) factorization. Specifically, the density matrix is represented as the contraction of a Block-TT with its Hermitian transpose, yielding a TT analogue of the Burer-Monteiro factorization. This parameterization guarantees Hermiticity and positive semidefiniteness by construction while compressing the number of optimization variables from exponential to linear in the number of qubits. Building on this representation, we develop single-site and two-site density matrix renormalization group (DMRG) algorithms for estimating quantum states from compressed measurements. The resulting methods operate directly on the compressed parameterization, support adaptive rank refinement, and exploit efficient tensor-network contractions for expectation-value evaluation. The framework is applicable to a broad class of low-rank quantum states, including pure states, nearly pure states, and ground states that admit accurate tensor-network approximations. Numerical experiments demonstrate accurate state reconstruction from limited measurements together with substantial reductions in memory requirements and computational cost compared with conventional low-rank tomography methods.

quant-pharXiv:2609.09457•Sep 10, 2026•0 citations

Approximate strong simulation of one-dimensional quantum dynamics via reduced transition matrix

Matilde Grassi

Tensor networks enable the classical simulation of quantum many-body systems by restricting the description to the weakly entangled region of the Hilbert space. For the real-time dynamics of one-dimensional chains, the standard Time-Evolving Block Decimation algorithm compresses the evolved state as a matrix product state, whose bond dimension grows exponentially in time after a global quench (the entanglement barrier). This thesis addresses the approximate strong simulation of the dynamics: the computation of a single amplitude between two product states, to a prescribed relative precision. The spatio-temporal network is contracted along the spatial direction rather than in time (transverse contraction), and the amplitude becomes the overlap of a left and a right temporal matrix product state. Instead of truncating each half on its reduced density matrix, we truncate on the reduced transition matrix (RTM), built from both halves at once, so as to retain the directions relevant to their overlap. The resulting self-consistency problem is solved by sweeping the cut across the system until the amplitude converges. The algorithm, based on recent proposals and modified in its convergence criteria and bond-dimension schedule, was implemented from scratch in Julia and tested on kicked Ising and random brickwork circuits, and on the Trotterised mixed-field Ising chain in the gapped, critical and chaotic regimes. For circuits, we find numerical evidence that the required bond dimension grows subexponentially over the accessible time window. We relate this behaviour to the exponential decay of the RTM singular values: the cost is set by the tail of the spectrum, while the RTM entropy serves as a diagnostic of its structure. For Hamiltonian evolution, the accessible window is too short to determine the growth law. This method evaluates single probabilities without representing the evolved state, with potential applications to cross-entropy benchmarking.

•Oct 29, 2026•0 citations

Dimension truncation for open quantum systems in terms of tensor networks

I. A. Luchnikov, Stephen Vintskevich, Sergey N. Filippov

We present novel and simple estimation of a minimal dimension required for an effective reservoir in open quantum systems. Using a tensor network formalism we introduce a new object called a reservoir network (RN). The reservoir network is the tensor network in the form of a Matrix Product State, which contains all effects of open dynamics. This object is especially useful for understanding memory effects. We discuss possible applications of the reservoir network and the estimation of dimension to develop new numerical and machine learning based methods for open quantum systems.

arXiv:1801.07418•Jan 23, 2018•6 citations
Compressing the connectivity of a reservoir removes the O(N²) memory wall, but the state vector itself still costs O(N) — the state wall, at N = 4¹⁵ > 10⁹ an unallocatable 8.6 GB. We introduce a reservoir whose state evolves natively in tensor-train (TT) form: TT matrix–vector product, TT input injection, rounding to bond dimension χx, and the hypersphere normalization, which is a scalar division of one core and therefore exactly rank-neutral. When χx reaches the maximal rank of the tensorization the evolution is exact to machine precision; below it, the reservoir is not a degraded copy of the exact one. We show that the exact attractor of sphere-TT dynamics at large N is near-maximally entangled (one-shot truncation error 0.93 at χx = 16, N = 65,536; flat middle-bond Schmidt spectrum), so post-hoc state compression is impossible; the truncated system instead carves out its own low-rank attractor, characterized by a per-step rounding error δ̄ that is measurable at runtime for free. Two quantitative laws organize this regime. First, a decomposition law: δ̄² ≈ (c·(1−β))² + δstock², fitting a 5×3 grid in the orthogonal-mixing weight β and χx within 2–5%; the flow term is injected by the random part of the connectivity, while the floor δstock — measured directly at β = 1, where the rank-1 Kronecker-orthogonal connectivity injects nothing — is the rank cost of the retained memory itself. Second, a two-resource memory law: linear memory capacity follows MC ≈ min{K₀·χx², MC_noise(δ̄)}, with a threshold regime, a quadratic capacity regime (measured MC/χx² constant across χx at fixed β), and a noise-limited regime where δ̄ saturates at the flow floor. Following these laws — raise β and χx together — we demonstrate memory capacity 30–74 (three seeds) at N = 1,073,741,824, where the dense state cannot be allocated, with the entire model (connectivity, state, input coupling) in 861 KB at ~1 s/step on a CPU; the naive configuration scores ≈ 0.1 there. A nonlinear task (NARMA10) reaches r² = 0.64 in the same regime. We state the open problems honestly: the microscopic mechanism of the χ_x² law, the growth of δ̄ with tensor order, and a residual quality-of-dynamics constraint at high β. Code and experiment logs: https://github.com/Volta-0936/sphertt (archived: DOI 10.5281/zenodo.21433254). Companion paper: DOI 10.5281/zenodo.21433291.
Kinetic descriptions of fusion plasmas are throttled by the curse of dimensionality: a distribution function on a six-dimensional phase space is intractable to store on a dense grid, let alone to advance in time. We show that the kinetic distribution function is strongly compressible in a low-rank tensor-network (matrix-product-state, or tensor-train) representation and that this yields a practical solver on present-day classical hardware, not merely a storage economy. We cast the problem formally: the discretized distribution is a high-order tensor, its matrix-product-state factorization is exact up to a truncation error bounded by the discarded Schmidt weight (Eckart–Young), and the number of retained modes needed for a target accuracy scales with the entanglement entropy of the state. On a one-dimensional-in-space, one-dimensional-in-velocity Bhatnagar–Gross–Krook (BGK) kinetic test problem, discretized on a periodic N_x=128× N_v=64 grid and advanced by operator-split upwind streaming and implicit relaxation, a matrix-product-state truncation reaches a relative-L^2 error of 2.9×10^-6 at bond dimension =8 while storing 0.19× the dense grid, and the error falls exponentially in the bond dimension — from 1.8×10^-1 at =1 to 2.2×10^-10 at =16 and to the double-precision floor (~10^-14) by =24. The velocity moments inherit the same convergence (density error 1.1×10^-6, temperature error 2.8×10^-6 at =8), and the converged distribution carries a Schmidt entanglement entropy below 0.1 nats — the area-law signature that makes it compressible. Every headline quantity is a frozen anchor in the Kronos de-risking register (gate KX-L1-A16). Beyond the anchor we give the general-dimensional machinery that carries the method to the five- and six-dimensional gyrokinetic problem — matrix-product-operator representations of the streaming and collision maps, dimension-linear tensor-train construction by cross interpolation, and a rank-adaptive, conservative dynamical-low-rank integrator that evolves the state on the low-rank manifold without inverting small singular values — together with the derived exponential-to-linear crossover in both storage and per-step arithmetic that motivates it. The result is a classical, deployable-today complement to the fault-tolerant-horizon quantum kinetic route, and we place it as a cross-cutting, verification-first module inside the Kronos autonomous control architecture: an advisory/supervisory reduced-kinetics solver, exercised twin-first beneath a deterministic safety clamp, that hands authority back to the deterministic floor on out-of-distribution inputs. The single honest gate is that the demonstration is a collision-dominated reduced problem, and the rank growth of the fully nonlinear, collisionless six-dimensional gyrokinetic distribution at reactor parameters remains the open question we scope explicitly. Key results (frozen anchors): v = 2 v; t = 3.27 ×10^-3; sigma_1 = 9.4 ×10^-2; sigma_1 = 2.5 ×10^-3; sigma_1 = 4.7 ×10^-5. Methods & codes: CGYRO, TGLF, GENE, Sauter, VQE, ADAPT-VQE. Live verification: 1 gate validator(s) with live-recompute cards (1 reproduced). See the Verification section and data/verification.csv. Related: Paper page · De-risking register · 3D model · Learn more about Kronos Part of the 2026 Kronos publication series; independently re-run and stamped in the Kronos de-risking register (DOI 10.5281/zenodo.22645689). All numerical values are frozen design-point anchors; see the register. Public research artifact. No proprietary, financial, or supply-chain information is included. Previous version: DOI 10.5281/zenodo.22132192. Please cite this version.
Kinetic descriptions of fusion plasmas are throttled by the curse of dimensionality: a distribution function on a six-dimensional phase space is intractable to store on a dense grid, let alone to advance in time. We show that the kinetic distribution function is strongly compressible in a low-rank tensor-network (matrix-product-state, or tensor-train) representation and that this yields a practical solver on present-day classical hardware, not merely a storage economy. We cast the problem formally: the discretized distribution is a high-order tensor, its matrix-product-state factorization is exact up to a truncation error bounded by the discarded Schmidt weight (Eckart–Young), and the number of retained modes needed for a target accuracy scales with the entanglement entropy of the state. On a one-dimensional-in-space, one-dimensional-in-velocity Bhatnagar–Gross–Krook (BGK) kinetic test problem, discretized on a periodic N_x=128× N_v=64 grid and advanced by operator-split upwind streaming and implicit relaxation, a matrix-product-state truncation reaches a relative-L^2 error of 2.9×10^-6 at bond dimension =8 while storing 0.19× the dense grid, and the error falls exponentially in the bond dimension — from 1.8×10^-1 at =1 to 2.2×10^-10 at =16 and to the double-precision floor (~10^-14) by =24. The velocity moments inherit the same convergence (density error 1.1×10^-6, temperature error 2.8×10^-6 at =8), and the converged distribution carries a Schmidt entanglement entropy below 0.1 nats — the area-law signature that makes it compressible. Every headline quantity is a frozen anchor in the Kronos de-risking register (gate KX-L1-A16). Beyond the anchor we give the general-dimensional machinery that carries the method to the five- and six-dimensional gyrokinetic problem — matrix-product-operator representations of the streaming and collision maps, dimension-linear tensor-train construction by cross interpolation, and a rank-adaptive, conservative dynamical-low-rank integrator that evolves the state on the low-rank manifold without inverting small singular values — together with the derived exponential-to-linear crossover in both storage and per-step arithmetic that motivates it. The result is a classical, deployable-today complement to the fault-tolerant-horizon quantum kinetic route, and we place it as a cross-cutting, verification-first module inside the Kronos autonomous control architecture: an advisory/supervisory reduced-kinetics solver, exercised twin-first beneath a deterministic safety clamp, that hands authority back to the deterministic floor on out-of-distribution inputs. The single honest gate is that the demonstration is a collision-dominated reduced problem, and the rank growth of the fully nonlinear, collisionless six-dimensional gyrokinetic distribution at reactor parameters remains the open question we scope explicitly.Key results (frozen anchors): v = 2 v; t = 3.27 ×10^-3; N_v = 128 ×64; sigma_1 = 9.4 ×10^-2; sigma_1 = 2.5 ×10^-3; sigma_1 = 4.7 ×10^-5.Methods & codes: CGYRO, TGLF, GENE, Sauter, VQE, ADAPT-VQE.Live verification: 1 gate validator(s) with live-recompute cards (1 reproduced). See the Verification section and data/verification.csv.Related: Paper page · De-risking register · 3D model · Learn more about KronosPart of the 2026 Kronos publication series; independently re-run and stamped in the Kronos de-risking register (DOI 10.5281/zenodo.22645689).All numerical values are frozen design-point anchors; see the register.Public research artifact. No proprietary, financial, or supply-chain information is included.Note (REPLACE): This record replaces and supersedes DOI 10.5281/zenodo.22132192; please cite this version.
Quantum reservoir computing (QRC) uses fixed quantum dynamics to encode a time series and trains only a classical readout, but a benchmark capacity alone does not reveal whether task information is lost in the reservoir, the measurement, feature compression, or finite sampling. We introduce \emph{task-resolved Fisher spectroscopy}, in which prediction targets define orthonormal score coordinates on the stationary distribution of input histories. Reweighting labeled histories along these scores generates an exactly affine family of reservoir states and measurement outcomes. In the same coordinates, we obtain a many-body Fisher-information hierarchy relating the state quantum Fisher information, the Fisher information of the complete measurement record, and moment matrices retained through many-body order rrr. The quadratic form of each moment matrix is exactly the stationary capacity of the optimal linear readout, while a finite-measurement extension predicts the approach from one-shot records to ideal expectation-value features. The measurement-level quantities require only stationary labeled records and measured outcome strings, not an input model or quantum-state tomography. In a five-spin open reservoir, interactions route fourth-order temporal information into higher-body correlations, so low-order compression can incur orders-of-magnitude sampling overhead even when a conventional parity target remains accessible. For correlated inputs and outputs, record-defined task scores predict held-out capacities, the required feature order, and measurement-budget dependence; optimizing the local measurement axis recovers otherwise hidden task information. The framework connects benchmark performance to experimentally actionable diagnoses of reservoir encoding, measurement choice, classical representation, and shot allocation.
Quantum state tomography is a fundamental technique for estimating the state of a quantum system from measured data and plays a crucial role in evaluating the performance of quantum devices. However, standard estimation methods become computationally prohibitive as the system size increases due to the exponential growth of the density matrix, describing a quantum state, with the number of qubits. We propose a low-rank tensor-network framework for mixed-state quantum state tomography based on a block tensor train (Block-TT) factorization. Specifically, the density matrix is represented as the contraction of a Block-TT with its Hermitian transpose, yielding a TT analogue of the Burer-Monteiro factorization. This parameterization guarantees Hermiticity and positive semidefiniteness by construction while compressing the number of optimization variables from exponential to linear in the number of qubits. Building on this representation, we develop single-site and two-site density matrix renormalization group (DMRG) algorithms for estimating quantum states from compressed measurements. The resulting methods operate directly on the compressed parameterization, support adaptive rank refinement, and exploit efficient tensor-network contractions for expectation-value evaluation. The framework is applicable to a broad class of low-rank quantum states, including pure states, nearly pure states, and ground states that admit accurate tensor-network approximations. Numerical experiments demonstrate accurate state reconstruction from limited measurements together with substantial reductions in memory requirements and computational cost compared with conventional low-rank tomography methods.
Tensor networks enable the classical simulation of quantum many-body systems by restricting the description to the weakly entangled region of the Hilbert space. For the real-time dynamics of one-dimensional chains, the standard Time-Evolving Block Decimation algorithm compresses the evolved state as a matrix product state, whose bond dimension grows exponentially in time after a global quench (the entanglement barrier). This thesis addresses the approximate strong simulation of the dynamics: the computation of a single amplitude between two product states, to a prescribed relative precision. The spatio-temporal network is contracted along the spatial direction rather than in time (transverse contraction), and the amplitude becomes the overlap of a left and a right temporal matrix product state. Instead of truncating each half on its reduced density matrix, we truncate on the reduced transition matrix (RTM), built from both halves at once, so as to retain the directions relevant to their overlap. The resulting self-consistency problem is solved by sweeping the cut across the system until the amplitude converges. The algorithm, based on recent proposals and modified in its convergence criteria and bond-dimension schedule, was implemented from scratch in Julia and tested on kicked Ising and random brickwork circuits, and on the Trotterised mixed-field Ising chain in the gapped, critical and chaotic regimes. For circuits, we find numerical evidence that the required bond dimension grows subexponentially over the accessible time window. We relate this behaviour to the exponential decay of the RTM singular values: the cost is set by the tail of the spectrum, while the RTM entropy serves as a diagnostic of its structure. For Hamiltonian evolution, the accessible window is too short to determine the growth law. This method evaluates single probabilities without representing the evolved state, with potential applications to cross-entropy benchmarking.
We present novel and simple estimation of a minimal dimension required for an effective reservoir in open quantum systems. Using a tensor network formalism we introduce a new object called a reservoir network (RN). The reservoir network is the tensor network in the form of a Matrix Product State, which contains all effects of open dynamics. This object is especially useful for understanding memory effects. We discuss possible applications of the reservoir network and the estimation of dimension to develop new numerical and machine learning based methods for open quantum systems.