Imagen de Portada

Quantum Advantage in Decision Trees: A Weighted Graph and $L_1$ Norm Approach

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Grillo, Sebastian Alberto, Dávalos, Bernardo Daniel, Torres, Rodney Fabian Franco, Marquezino, Franklin de Lima, Pezoa, Edgar López
Formato:	Preprint
Publicado:	2026
Materias:	Quantum Physics Computational Complexity
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

A Criterion for Post-Selected Quantum Advantage
por: Karamchedu, Chaitanya, et al.
Publicado: (2024)

Quantum Communication Advantage in TFNP
por: Göös, Mika, et al.
Publicado: (2024)

Formal Framework for Quantum Advantage
por: Buhrman, Harry, et al.
Publicado: (2025)

Quantum Advantage from Sampling Shallow Circuits: Beyond Hardness of Marginals
por: Grier, Daniel, et al.
Publicado: (2025)

The $L^2$-Norm of the Cauchy transform on circular annuli
por: Kalaj, David
Publicado: (2026)

Switching Graph Matrix Norm Bounds: from i.i.d. to Random Regular Graphs
por: Xu, Jeff
Publicado: (2024)

Unconditional Quantum Advantage for Sampling with Shallow Circuits
por: Watts, Adam Bene, et al.
Publicado: (2023)

Sampling Frequency Thresholds for Quantum Advantage of Quantum Approximate Optimization Algorithm
por: Lykov, Danylo, et al.
Publicado: (2022)

The $L^2$ Norm of the Interior Cauchy Transform: Beyond the First Dirichlet Eigenvalue
por: Kalaj, David
Publicado: (2026)

Distributed Quantum Advantage for Local Problems
por: Balliu, Alkida, et al.
Publicado: (2024)

Verifiable Quantum Advantage without Structure
por: Yamakawa, Takashi, et al.
Publicado: (2022)

Quantum Advantage from One-Way Functions
por: Morimae, Tomoyuki, et al.
Publicado: (2023)

On the Advantage of Adaptivity for Sampling with Cell Probes
por: Byramji, Farzan, et al.
Publicado: (2026)

New Limits on Distributed Quantum Advantage: Dequantizing Linear Programs
por: Balliu, Alkida, et al.
Publicado: (2025)

Limitations of Linear Cross-Entropy as a Measure for Quantum Advantage
por: Gao, Xun, et al.
Publicado: (2021)

Quantum Advantages in (n,d)->1 Random Access Codes
por: Ambainis, Andris, et al.
Publicado: (2015)

From FPT Decision to FPT Enumeration
por: Creignou, Nadia, et al.
Publicado: (2025)

New Approaches to Complexity via Quantum Graphs
por: Culf, Eric, et al.
Publicado: (2023)

Hardness of the Binary Covering Radius Problem in Large $\ell_p$ Norms
por: Bennett, Huck, et al.
Publicado: (2026)

Spectral Norm, Economical Sieve, and Linear Invariance Testing of Boolean Functions
por: Datta, Swarnalipa, et al.
Publicado: (2023)

Deterministic Hardness of Approximation For SVP in all Finite $\ell_p$ Norms
por: Hair, Isaac M, et al.
Publicado: (2026)

On the Exact Matching Problem in Dense Graphs
por: Maalouly, Nicolas El, et al.
Publicado: (2024)

Distributed Quantum Advantage in Locally Checkable Labeling Problems
por: Balliu, Alkida, et al.
Publicado: (2025)

On the Induced Norms of Matrices and Grothendieck problems
por: Truong, Lan V., et al.
Publicado: (2026)

The Computational Advantage of MIP* Vanishes in the Presence of Noise
por: Dong, Yangjing, et al.
Publicado: (2023)

Simple Norm Bounds for Polynomial Random Matrices via Decoupling
por: Tulsiani, Madhur, et al.
Publicado: (2024)

Explaining Decisions in ML Models: a Parameterized Complexity Analysis
por: Ordyniak, Sebastian, et al.
Publicado: (2024)

Automated Reencoding Meets Graph Theory
por: Przybocki, Benjamin, et al.
Publicado: (2026)

Deterministic and Strongly Nondeterministic Decision Trees for Decision Tables from Closed Classes
por: Ostonov, Azimkhon, et al.
Publicado: (2023)

Weighted $L^2$ theory for the Euclidean Dirac operator in higher dimensions
por: Ren, Guangbin, et al.
Publicado: (2026)

Quantum Advantage and CSP Complexity
por: Ciardo, Lorenzo
Publicado: (2024)

Planar Graph Homomorphisms: A Dichotomy and a Barrier from Quantum Groups
por: Cai, Jin-Yi, et al.
Publicado: (2026)

Recursive Jump Operators and Optimal Proof Systems
por: Egidy, Fabian
Publicado: (2026)

The SPARSE-Relativization Framework and Applications to Optimal Proof Systems
por: Egidy, Fabian
Publicado: (2026)

Reordering Method and Hierarchies for Quantum and Classical Ordered Binary Decision Diagrams
por: Khadiev, Kamil, et al.
Publicado: (2017)

Improved Quantum Query Upper Bounds Based on Classical Decision Trees
por: Cornelissen, Arjan, et al.
Publicado: (2022)

Parameterized Inapproximability of the Minimum Distance Problem over all Fields and the Shortest Vector Problem in all $\ell_p$ Norms
por: Bennett, Huck, et al.
Publicado: (2022)

A Framework for Computational Lower Bounds in Nontrivial Norm Approximation
por: Tang, Runshi, et al.
Publicado: (2026)

Multicut Problems in Almost-Planar Graphs: The Dependency of Complexity on the Demand Pattern
por: Hörsch, Florian, et al.
Publicado: (2025)

Hazard-free Decision Trees
por: Benson, Deepu, et al.
Publicado: (2025)