Introduces forward-assisted purification via a new spatiotemporal framework that outperforms conventional static purification by up to 50x in copy efficiency and circumvents no-purification theorems for Bell states.
Biamonte,Lectures on quantum tensor networks, 2020
4 Pith papers cite this work, alongside 27 external citations. Polarity classification is still indexing.
4
Pith papers citing it
27
external citations · external index
citation-role summary
background 1
citation-polarity summary
years
2026 4verdicts
UNVERDICTED 4roles
background 1polarities
background 1representative citing papers
The paper introduces compositional interpretability as a category-theoretic framework that casts mechanistic explanations as commuting syntactic-semantic mappings optimized under faithfulness and complexity constraints derived from minimum description length.
Optimal quantum circuit cutting to minimize cuts is NP-complete, with an SMT solver for bounded-size partitions.
The thesis introduces a topology-aware tensor-network heuristic called SpinGlassPEPS.jl and thermodynamic metrics to benchmark quantum annealers on Ising problems while accounting for dissipation and effective temperature.
citing papers explorer
-
Forward-Assisted Purification: A Spatiotemporal Framework Beyond Conventional Limits
Introduces forward-assisted purification via a new spatiotemporal framework that outperforms conventional static purification by up to 50x in copy efficiency and circumvents no-purification theorems for Bell states.
-
From Mechanistic to Compositional Interpretability
The paper introduces compositional interpretability as a category-theoretic framework that casts mechanistic explanations as commuting syntactic-semantic mappings optimized under faithfulness and complexity constraints derived from minimum description length.
-
Quantum Circuit Cutting: Complexity and Optimization
Optimal quantum circuit cutting to minimize cuts is NP-complete, with an SMT solver for bounded-size partitions.
-
Neural and Tensor Networks in the Study of Quantum Annealing Processors
The thesis introduces a topology-aware tensor-network heuristic called SpinGlassPEPS.jl and thermodynamic metrics to benchmark quantum annealers on Ising problems while accounting for dissipation and effective temperature.