Image de couverture de livre

Improved Quantum Query Upper Bounds Based on Classical Decision Trees

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Cornelissen, Arjan, Mande, Nikhil S., Patro, Subhasree
Format:	Preprint
Publié:	2022
Sujets:	Quantum Physics Computational Complexity
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Quantum Sabotage Complexity
par: Cornelissen, Arjan, et autres
Publié: (2024)

Quantum Search With Generalized Wildcards
par: Cornelissen, Arjan, et autres
Publié: (2025)

Quantum algorithms for path and cycle containment problems
par: Cornelissen, Arjan, et autres
Publié: (2026)

Tight Bounds for Quantum Phase Estimation and Related Problems
par: Mande, Nikhil S., et autres
Publié: (2023)

Fine-Grained Complexity via Quantum Natural Proofs
par: Chen, Yanlin, et autres
Publié: (2025)

Lower bounds for quantum-inspired classical algorithms via communication complexity
par: Mande, Nikhil S., et autres
Publié: (2024)

Quantum algorithms through graph composition
par: Cornelissen, Arjan
Publié: (2025)

Quantum walks through generalized graph composition
par: Cornelissen, Arjan
Publié: (2025)

Query and Depth Upper Bounds for Quantum Unitaries via Grover Search
par: Rosenthal, Gregory
Publié: (2021)

On the communication complexity of finding a king in a tournament
par: Mande, Nikhil S., et autres
Publié: (2024)

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

Query Complexity with Unknowns
par: Mande, Nikhil S., et autres
Publié: (2024)

QSETH strikes again: finer quantum lower bounds for lattice problem, strong simulation, hitting set problem, and more
par: Chen, Yanlin, et autres
Publié: (2023)

Quantum Query-Space Lower Bounds Using Branching Programs
par: Bera, Debajyoti, et autres
Publié: (2024)

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

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

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

On query complexity measures and their relations for symmetric functions
par: Mittal, Rajat, et autres
Publié: (2021)

How to compute the volume in low dimension?
par: Cornelissen, Arjan, et autres
Publié: (2025)

A List of Complexity Bounds for Property Testing by Quantum Sample-to-Query Lifting
par: Chen, Kean, et autres
Publié: (2025)

A Brief Introduction to Quantum Query Complexity
par: Hamoudi, Yassine
Publié: (2025)

Modifications of Quantum Computation and Adaptive Queries to PP
par: Miloschewsky, David, et autres
Publié: (2025)

Improved Lower Bounds for QAC0
par: Joshi, Malvika Raj, 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)

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)

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

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

Quantum Advantage in Decision Trees: A Weighted Graph and $L_1$ Norm Approach
par: Grillo, Sebastian Alberto, et autres
Publié: (2026)

Bounds on Eventually Universal Quantum Gate Sets
par: Karamchedu, Chaitanya, et autres
Publié: (2025)

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

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

Quantum Lovász Local Lemma: Shearer's Bound is Tight
par: He, Kun, et autres
Publié: (2018)

Learning Quantum Processes with Quantum Statistical Queries
par: Wadhwa, Chirag, et autres
Publié: (2023)

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

Sensitivity and Query Complexity under Uncertainty
par: Benson, Deepu, et autres
Publié: (2025)

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