Cover Image

From Tensor Networks to Tractable Circuits, and back

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Quist, Arend-Jan, Bartra, Marc Farreras, de Colnet, Alexis, van de Wetering, John, Laarman, Alfons
Format:	Preprint
Published:	2026
Subjects:	Quantum Physics Data Structures and Algorithms Logic in Computer Science
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Quadratic Sums-of-Powers for Fixed-Parameter Tractable Quantum-Circuit Simulation
by: de Colnet, Alexis, et al.
Published: (2026)

The Compilability Thresholds of 2-CNF to OBDD
by: de Colnet, Alexis, et al.
Published: (2026)

Trade-offs between classical and quantum space using spooky pebbling
by: Quist, Arend-Jan, et al.
Published: (2024)

Quantum Graph-State Synthesis with SAT
by: Brand, Sebastiaan, et al.
Published: (2023)

Towards practical FPRAS for #NFA: Exploiting the Power of Dependence
by: Meel, Kuldeep S., et al.
Published: (2025)

#CFG and #DNNF admit FPRAS
by: Meel, Kuldeep S., et al.
Published: (2024)

An FPRAS for Model Counting for Non-Deterministic Read-Once Branching Programs
by: Meel, Kuldeep S., et al.
Published: (2024)

Compact Parallel Hash Tables on the GPU
by: Hegeman, Steef, et al.
Published: (2024)

A Tensor Network based Decision Diagram for Representation of Quantum Circuits
by: Hong, Xin, et al.
Published: (2020)

A Knowledge Compilation Map for Quantum Information
by: Vinkhuijzen, Lieuwe, et al.
Published: (2024)

RIP Linked List
by: Sonntag, Benoît, et al.
Published: (2023)

Algorithms and Complexity of Difference Logic
by: Dabrowski, Konrad K., et al.
Published: (2024)

Subgraph Isomorphism: Prolog vs. Conventional
by: Yin, Claire Y., et al.
Published: (2025)

The Sherali-Adams and Weisfeiler-Leman hierarchies in (Promise Valued) Constraint Satisfaction Problems
by: Barto, Libor, et al.
Published: (2024)

Efficient Coalgebraic Partition Refinement
by: Dorsch, Ulrich, et al.
Published: (2017)

Derivation and Verification of Array Sorting by Merging, and its Certification in Dafny
by: Carbonell, Juan Pablo, et al.
Published: (2025)

Model checking with temporal graphs and their derivative
by: Bui-Xuan, Binh-Minh, et al.
Published: (2026)

MSO Queries on Trees: Enumerating Answers under Updates Using Forest Algebras
by: Kleest-Meißner, Sarah, et al.
Published: (2022)

Approximate Model Counting, Sparse XOR Constraints and Minimum Distance
by: Boreale, Michele, et al.
Published: (2019)

Quantum Circuit Simulation with Fast Tensor Decision Diagram
by: Zhang, Qirui, et al.
Published: (2024)

On merge-models
by: Buffière, Hector, et al.
Published: (2026)

Smaller Circuits for Bit Addition
by: Goncharov, Mikhail, et al.
Published: (2025)

Foundations for an Abstract Proof Theory in the Context of Horn Rules
by: Lyon, Tim S., et al.
Published: (2023)

Exact Exploration
by: Blass, Andreas, et al.
Published: (2024)

Ranked Enumeration for MSO on Trees via Knowledge Compilation
by: Amarilli, Antoine, et al.
Published: (2023)

Direct Access for Answers to Conjunctive Queries with Aggregation
by: Eldar, Idan, et al.
Published: (2023)

Factorised Representations of Join Queries: Tight Bounds and a New Dichotomy
by: Berkholz, Christoph, et al.
Published: (2025)

Tractable Maximization of Budgeted Phylogenetic Diversity on Networks Utilizing Node Scanwidth
by: Holtgrefe, Niels, et al.
Published: (2026)

On the Optimal Linear Contraction Order of Tree Tensor Networks, and Beyond
by: Stoian, Mihail, et al.
Published: (2022)

Merge-width and First-Order Model Checking
by: Dreier, Jan, et al.
Published: (2025)

Elementary first-order model checking for sparse graphs
by: Gajarský, Jakub, et al.
Published: (2024)

CNFs and DNFs with Exactly $k$ Solutions
by: Chandran, L. Sunil, et al.
Published: (2025)

Flipper games for monadically stable graph classes
by: Gajarský, Jakub, et al.
Published: (2023)

Fixed-Parameter Tractability of Hedge Cut
by: Fomin, Fedor V., et al.
Published: (2024)

Digital Zero-Noise Extrapolation with Quantum Circuit Unoptimization
by: Pelofske, Elijah, et al.
Published: (2025)

FeynmanDD: Quantum Circuit Analysis with Classical Decision Diagrams
by: Wang, Ziyuan, et al.
Published: (2025)

Breaking the Treewidth Barrier in Quantum Circuit Simulation with Decision Diagrams
by: Cheng, Bin, et al.
Published: (2025)

Tensor Decompositions and Adiabatic Quantum Computing for Discovering Practical Matrix Multiplication Algorithms
by: Uotila, Valter
Published: (2024)

Smarter k-Partitioning of ZX-Diagrams for Improved Quantum Circuit Simulation
by: Sutcliffe, Matthew
Published: (2024)

Efficient Learning of Structured Quantum Circuits via Pauli Dimensionality and Sparsity
by: Grewal, Sabee, et al.
Published: (2025)