Image de couverture de livre

The Quantumly Fast and the Classically Forrious

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Canonne, Clément L., Chen, Kenny, Mestre, Julián
Format:	Preprint
Publié:	2026
Sujets:	Computational Complexity
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Interactive Proofs For Distribution Testing With Conditional Oracles
par: Biswas, Ari, et autres
Publié: (2025)

Communication with Imperfectly Shared Randomness
par: Canonne, Clément L., et autres
Publié: (2014)

Uniformity testing when you have the source code
par: Canonne, Clément L., et autres
Publié: (2024)

With a Little Help From My Friends: Exploiting Probability Distribution Advice in Algorithm Design
par: Canonne, Clément L., et autres
Publié: (2025)

Separating Quantum and Classical Advice with Good Codes
par: Bostanci, John, et autres
Publié: (2026)

Oracle Separations for the Quantum-Classical Polynomial Hierarchy
par: Agarwal, Avantika, et autres
Publié: (2024)

Quantum and Classical Communication Complexity of Permutation-Invariant Functions
par: Guan, Ziyi, et autres
Publié: (2023)

Improved Circuit Lower Bounds and Quantum-Classical Separations
par: Grewal, Sabee, et autres
Publié: (2024)

Classical Simulability of Quantum Circuits with Shallow Magic Depth
par: Zhang, Yifan, et autres
Publié: (2024)

Coherence in Property Testing: Quantum-Classical Collapses and Separations
par: Jeronimo, Fernando Granha, et autres
Publié: (2024)

Quantum Complexity vs Classical Complexity: A Survey
par: Vaezi, Arash, et autres
Publié: (2023)

Benchmarking of Quantum and Classical Computing in Large-Scale Dynamic Portfolio Optimization Under Market Frictions
par: Chen, Ying, et autres
Publié: (2025)

A Lifting Theorem for Hybrid Classical-Quantum Communication Complexity
par: Wu, Xudong, et autres
Publié: (2025)

Lower Bounds on Relative Error Quantum Compression and Classical Shadows
par: Sankar, Kaushik
Publié: (2025)

Quantum versus Classical Separation in Simultaneous Number-on-Forehead Communication
par: Yang, Guangxu, et autres
Publié: (2025)

Classical Verification of Quantum Learning
par: Caro, Matthias C., et autres
Publié: (2023)

Quantum Pseudorandomness and Classical Complexity
par: Kretschmer, William
Publié: (2021)

Classical vs Quantum Advice and Proofs under Classically-Accessible Oracle
par: Li, Xingjian, et autres
Publié: (2023)

Exponential Separation of Quantum and Classical One-Way Numbers-on-Forehead Communication
par: Yang, Guangxu, et autres
Publié: (2026)

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

Raising the Bar: An Asymptotic Comparison of Classical and Quantum Shortest Path Algorithms
par: Do, Phuc Hao, et autres
Publié: (2025)

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

Polynomial-Time Classical Simulation of Noisy Quantum Circuits with Naturally Fault-Tolerant Gates
par: Nelson, Jon, et autres
Publié: (2024)

Faster algorithms for graph homomorphism via tractable constraint satisfaction
par: Carbonnel, Clément
Publié: (2026)

A Perfectly Distributable Quantum-Classical Algorithm for Estimating Triangular Balance in a Signed Edge Stream
par: Kordonowy, Steven, et autres
Publié: (2026)

Quantum-Classical Separations in Shallow-Circuit-Based Learning with and without Noises
par: Zhang, Zhihan, et autres
Publié: (2024)

Semi-Classical Subspaces, The No Synchronization Law, and More
par: Epstein, Samuel
Publié: (2024)

Certificate Games and Consequences for the Classical Adversary Bound
par: Chakraborty, Sourav, et autres
Publié: (2022)

Fast interpolation and multiplication of unbalanced polynomials
par: Giorgi, Pascal, et autres
Publié: (2024)

Fast polynomial computations with space constraints
par: Grenet, Bruno
Publié: (2025)

Classically Sampling Noisy Quantum Circuits in Quasi-Polynomial Time under Approximate Markovianity
par: Zhang, Yifan F., et autres
Publié: (2025)

The Line Traveling Salesman and Repairman Problem with Collaboration
par: Golak, Julian, et autres
Publié: (2025)

On the (Classical and Quantum) Fine-Grained Complexity of Approximate CVP and Max-Cut
par: Huang, Jeremy Ahrens, et autres
Publié: (2024)

Graphs without a partition into two proportionally dense subgraphs
par: Bazgan, Cristina, et autres
Publié: (2018)

On the Classical Hardness of the Semidirect Discrete Logarithm Problem in Finite Groups
par: Arif, Mohammad Ferry Husnil, et autres
Publié: (2025)

Classically Spoofing System Linear Cross Entropy Score Benchmarking
par: Tanggara, Andrew, et autres
Publié: (2024)

Classical versus quantum queries in quantum PCPs with classical proofs
par: Buhrman, Harry, et autres
Publié: (2024)

Toward Separating QMA from QCMA with a Classical Oracle
par: Zhandry, Mark
Publié: (2024)

Quantum Fast Implementation of Functional Bootstrapping and Private Information Retrieval
par: Ma, Guangsheng, et autres
Publié: (2024)

Classical simulability of quantum circuits followed by sparse classical post-processing
par: Takahashi, Yasuhiro, et autres
Publié: (2026)