Compositional interpretability defines explanations as commuting syntactic-semantic mapping pairs grounded in compositionality and minimum description length, with compressive refinement and a parsimony theorem guaranteeing concise human-aligned decompositions.
A practical introduction to tensor networks: Matrix product states and projected entangled pair states , volume=
8 Pith papers cite this work. Polarity classification is still indexing.
citation-role summary
citation-polarity summary
verdicts
UNVERDICTED 8roles
background 3polarities
background 3representative citing papers
AI coding agents evolve simple ground-state protocols into improved versions for VQE, DMRG, and AFQMC on spin models and molecules by using executable energy scores under fixed compute budgets.
Computational constraints exponentially suppress accessible entanglement for some highly entangled quantum states and can make mixed-state min-entropy appear maximal when the information-theoretic version is negative.
Alternating cross interpolation performs elementwise operations on tensor trains in O(χ³) time with error control, improving on the standard O(χ⁴) scaling when output ranks are controlled.
A matrix product state tensor network method enables numerically exact simulation of coherence and population dynamics in spin networks, including under repeated light pulses.
A quantics tensor train solver resolves the Gross-Pitaevskii equation across seven orders of magnitude in length scale in one dimension and on grids larger than a trillion points in two dimensions.
Tensor networks developed for quantum states are reviewed as tools for machine learning models, with assessment of their potential computational, explanatory, and privacy advantages alongside remaining challenges.
A survey of variational quantum algorithms, quantum neural networks, and tensor networks for addressing scalability challenges in computational fluid dynamics.
citing papers explorer
-
From Mechanistic to Compositional Interpretability
Compositional interpretability defines explanations as commuting syntactic-semantic mapping pairs grounded in compositionality and minimum description length, with compressive refinement and a parsimony theorem guaranteeing concise human-aligned decompositions.
-
Optimizing ground state preparation protocols with autoresearch
AI coding agents evolve simple ground-state protocols into improved versions for VQE, DMRG, and AFQMC on spin models and molecules by using executable energy scores under fixed compute budgets.
-
Accessible Quantum Correlations Under Complexity Constraints
Computational constraints exponentially suppress accessible entanglement for some highly entangled quantum states and can make mixed-state min-entropy appear maximal when the information-theoretic version is negative.
-
Fast elementwise operations on tensor trains with alternating cross interpolation
Alternating cross interpolation performs elementwise operations on tensor trains in O(χ³) time with error control, improving on the standard O(χ⁴) scaling when output ranks are controlled.
-
Numerically exact quantum dynamics with tensor networks: Predicting the decoherence of interacting spin systems
A matrix product state tensor network method enables numerically exact simulation of coherence and population dynamics in spin networks, including under repeated light pulses.
-
Solving the Gross-Pitaevskii equation on multiple different scales using the quantics tensor train representation
A quantics tensor train solver resolves the Gross-Pitaevskii equation across seven orders of magnitude in length scale in one dimension and on grids larger than a trillion points in two dimensions.
-
Quantum-inspired tensor networks in machine learning models
Tensor networks developed for quantum states are reviewed as tools for machine learning models, with assessment of their potential computational, explanatory, and privacy advantages alongside remaining challenges.
-
A review of quantum machine learning and quantum-inspired applied methods to computational fluid dynamics
A survey of variational quantum algorithms, quantum neural networks, and tensor networks for addressing scalability challenges in computational fluid dynamics.