:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Grillo, Sebastian Alberto, Dávalos, Bernardo Daniel, Torres, Rodney Fabian Franco, Marquezino, Franklin de Lima, Pezoa, Edgar López
Format:	Preprint
Publié:	2026
Sujets:	Quantum Physics Computational Complexity
Accès en ligne:	https://arxiv.org/abs/2602.04700
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

A Criterion for Post-Selected Quantum Advantage
par: Karamchedu, Chaitanya, et autres
Publié: (2024)

Quantum Communication Advantage in TFNP
par: Göös, Mika, et autres
Publié: (2024)

Formal Framework for Quantum Advantage
par: Buhrman, Harry, et autres
Publié: (2025)

Quantum Advantage from Sampling Shallow Circuits: Beyond Hardness of Marginals
par: Grier, Daniel, et autres
Publié: (2025)

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

Unconditional Quantum Advantage for Sampling with Shallow Circuits
par: Watts, Adam Bene, et autres
Publié: (2023)

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

Distributed Quantum Advantage for Local Problems
par: Balliu, Alkida, et autres
Publié: (2024)

Sampling Frequency Thresholds for Quantum Advantage of Quantum Approximate Optimization Algorithm
par: Lykov, Danylo, et autres
Publié: (2022)

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

Verifiable Quantum Advantage without Structure
par: Yamakawa, Takashi, et autres
Publié: (2022)

Quantum Advantage from One-Way Functions
par: Morimae, Tomoyuki, et autres
Publié: (2023)

On the Advantage of Adaptivity for Sampling with Cell Probes
par: Byramji, Farzan, et autres
Publié: (2026)

New Limits on Distributed Quantum Advantage: Dequantizing Linear Programs
par: Balliu, Alkida, et autres
Publié: (2025)

Limitations of Linear Cross-Entropy as a Measure for Quantum Advantage
par: Gao, Xun, et autres
Publié: (2021)

Quantum Advantages in (n,d)->1 Random Access Codes
par: Ambainis, Andris, et autres
Publié: (2015)

Analytical results for the Quantum Alternating Operator Ansatz with Grover Mixer
par: Bridi, Guilherme Adamatti, et autres
Publié: (2024)

Distributed Quantum Advantage in Locally Checkable Labeling Problems
par: Balliu, Alkida, et autres
Publié: (2025)

New Approaches to Complexity via Quantum Graphs
par: Culf, Eric, et autres
Publié: (2023)

From FPT Decision to FPT Enumeration
par: Creignou, Nadia, et autres
Publié: (2025)

Automated Reencoding Meets Graph Theory
par: Przybocki, Benjamin, et autres
Publié: (2026)

On the Induced Norms of Matrices and Grothendieck problems
par: Truong, Lan V., et autres
Publié: (2026)

Hardness of the Binary Covering Radius Problem in Large $\ell_p$ Norms
par: Bennett, Huck, et autres
Publié: (2026)

Spectral Norm, Economical Sieve, and Linear Invariance Testing of Boolean Functions
par: Datta, Swarnalipa, et autres
Publié: (2023)

Deterministic Hardness of Approximation For SVP in all Finite $\ell_p$ Norms
par: Hair, Isaac M, et autres
Publié: (2026)

The Computational Advantage of MIP* Vanishes in the Presence of Noise
par: Dong, Yangjing, et autres
Publié: (2023)

On the Exact Matching Problem in Dense Graphs
par: Maalouly, Nicolas El, et autres
Publié: (2024)

Quantum Advantage and CSP Complexity
par: Ciardo, Lorenzo
Publié: (2024)

Simple Norm Bounds for Polynomial Random Matrices via Decoupling
par: Tulsiani, Madhur, et autres
Publié: (2024)

Explaining Decisions in ML Models: a Parameterized Complexity Analysis
par: Ordyniak, Sebastian, et autres
Publié: (2024)

Weighted $L^2$ theory for the Euclidean Dirac operator in higher dimensions
par: Ren, Guangbin, et autres
Publié: (2026)

Complexity of Injectivity and Verification of ReLU Neural Networks
par: Froese, Vincent, et autres
Publié: (2024)

Hypercontractivity on HDX II: Symmetrization and q-Norms
par: Hopkins, Max
Publié: (2024)

Recursive Jump Operators and Optimal Proof Systems
par: Egidy, Fabian
Publié: (2026)

The SPARSE-Relativization Framework and Applications to Optimal Proof Systems
par: Egidy, Fabian
Publié: (2026)

A Framework for Computational Lower Bounds in Nontrivial Norm Approximation
par: Tang, Runshi, et autres
Publié: (2026)

Reordering Method and Hierarchies for Quantum and Classical Ordered Binary Decision Diagrams
par: Khadiev, Kamil, et autres
Publié: (2017)

Improved Quantum Query Upper Bounds Based on Classical Decision Trees
par: Cornelissen, Arjan, et autres
Publié: (2022)

Deterministic and Strongly Nondeterministic Decision Trees for Decision Tables from Closed Classes
par: Ostonov, Azimkhon, et autres
Publié: (2023)

Parameterized Inapproximability of the Minimum Distance Problem over all Fields and the Shortest Vector Problem in all $\ell_p$ Norms
par: Bennett, Huck, et autres
Publié: (2022)