Imagen de Portada

Quadratic Sums-of-Powers for Fixed-Parameter Tractable Quantum-Circuit Simulation

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	de Colnet, Alexis, Geerts, Floris, Hai, Rihan, Laarman, Alfons, Lee, Joon Hyung, Pérez, Guillermo A.
Formato:	Preprint
Publicado:	2026
Materias:	Quantum Physics Data Structures and Algorithms Logic in Computer Science
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

From Tensor Networks to Tractable Circuits, and back
por: Quist, Arend-Jan, et al.
Publicado: (2026)

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

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

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

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

Planar Disjoint Shortest Paths is Fixed-Parameter Tractable
por: Pilipczuk, Michał, et al.
Publicado: (2025)

Simulating Quantum Circuits by Model Counting
por: Mei, Jingyi, et al.
Publicado: (2024)

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

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

Fixed-Parameter Tractable Submodular Maximization over a Matroid
por: Nematollahi, Shamisa, et al.
Publicado: (2025)

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

Leveraging Fixed-Parameter Tractability for Robot Inspection Planning
por: Mizutani, Yosuke, et al.
Publicado: (2024)

Search-Driven Clause Learning for Product-State Quantum $k$-SAT (PRODSAT-QSAT)
por: González-Castillo, Samuel, et al.
Publicado: (2026)

On Fixed-Parameter Tractability of Weighted 0-1 Timed Matching Problem on Temporal Graphs
por: Kumar, Rinku, et al.
Publicado: (2025)

Faster Fixed Parameter Tractable Algorithms for Counting Markov Equivalence Classes with Special Skeletons
por: Sharma, Vidya Sagar
Publicado: (2023)

A Fixed Parameter Tractable Approach for Solving the Vertex Cover Problem in Polynomial Time Complexity
por: Tayal, Mumuksh
Publicado: (2025)

Homogeneous Network Caching is Fixed-Parameter Tractable Parameterized by the Number of Caches
por: Pintér, József, et al.
Publicado: (2026)

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

RIP Linked List
por: Sonntag, Benoît, et al.
Publicado: (2023)

Smaller Circuits for Bit Addition
por: Goncharov, Mikhail, et al.
Publicado: (2025)

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

Exact Exploration
por: Blass, Andreas, et al.
Publicado: (2024)

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

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

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

Efficient Coalgebraic Partition Refinement
por: Dorsch, Ulrich, et al.
Publicado: (2017)

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

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

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

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

Inverse Quadratic Decay in Random Subset Sum
por: Chen, Edwin, et al.
Publicado: (2026)

Data Structures for Finite Downsets of Natural Vectors: Theory and Practice
por: Cadilhac, Michaël, et al.
Publicado: (2025)

Diversity of Solutions: An Exploration Through the Lens of Fixed-Parameter Tractability Theory
por: Baste, Julien, et al.
Publicado: (2019)

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

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

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

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

A Fixed-Parameter Tractable Algorithm for Counting Markov Equivalence Classes with the same Skeleton
por: Sharma, Vidya Sagar
Publicado: (2023)

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

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