Quantum Query-Space Lower Bounds Using Branching Programs
Fuente:
arXiv
Guardado en:
| Autores principales: | Bera, Debajyoti, SAPV, Tharrmashastha |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
Efficient Quantum Agnostic Improper Learning of Decision Trees
por: Chatterjee, Sagnik, et al.
Publicado: (2022)
por: Chatterjee, Sagnik, et al.
Publicado: (2022)
Improved Circuit Lower Bounds and Quantum-Classical Separations
por: Grewal, Sabee, et al.
Publicado: (2024)
por: Grewal, Sabee, et al.
Publicado: (2024)
Lower Bounds on Relative Error Quantum Compression and Classical Shadows
por: Sankar, Kaushik
Publicado: (2025)
por: Sankar, Kaushik
Publicado: (2025)
Query and Depth Upper Bounds for Quantum Unitaries via Grover Search
por: Rosenthal, Gregory
Publicado: (2021)
por: Rosenthal, Gregory
Publicado: (2021)
Improved Quantum Query Upper Bounds Based on Classical Decision Trees
por: Cornelissen, Arjan, et al.
Publicado: (2022)
por: Cornelissen, Arjan, et al.
Publicado: (2022)
Tight Quantum Depth Lower Bound for Solving Systems of Linear Equations
por: Wang, Qisheng, et al.
Publicado: (2024)
por: Wang, Qisheng, et al.
Publicado: (2024)
Improved Lower Bounds for QAC0
por: Joshi, Malvika Raj, et al.
Publicado: (2025)
por: Joshi, Malvika Raj, et al.
Publicado: (2025)
Lower Bounds for Unitary Property Testing with Proofs and Advice
por: Weggemans, Jordi
Publicado: (2024)
por: Weggemans, Jordi
Publicado: (2024)
Quantum Lower Bounds by Sample-to-Query Lifting
por: Wang, Qisheng, et al.
Publicado: (2023)
por: Wang, Qisheng, et al.
Publicado: (2023)
Unentanglement and Post-Measurement Branching in Quantum Interactive Proofs
por: Grewal, Sabee, et al.
Publicado: (2025)
por: Grewal, Sabee, et al.
Publicado: (2025)
A List of Complexity Bounds for Property Testing by Quantum Sample-to-Query Lifting
por: Chen, Kean, et al.
Publicado: (2025)
por: Chen, Kean, et al.
Publicado: (2025)
A Brief Introduction to Quantum Query Complexity
por: Hamoudi, Yassine
Publicado: (2025)
por: Hamoudi, Yassine
Publicado: (2025)
Modifications of Quantum Computation and Adaptive Queries to PP
por: Miloschewsky, David, et al.
Publicado: (2025)
por: Miloschewsky, David, et al.
Publicado: (2025)
Lower Bounds for Set-Multilinear Branching Programs
por: Chatterjee, Prerona, et al.
Publicado: (2023)
por: Chatterjee, Prerona, et al.
Publicado: (2023)
New Lower-bounds for Quantum Computation with Non-Collapsing Measurements
por: Miloschewsky, David, et al.
Publicado: (2024)
por: Miloschewsky, David, et al.
Publicado: (2024)
Bounds on Eventually Universal Quantum Gate Sets
por: Karamchedu, Chaitanya, et al.
Publicado: (2025)
por: Karamchedu, Chaitanya, et al.
Publicado: (2025)
Lower Bounds for Learning Quantum States with Single-Copy Measurements
por: Lowe, Angus, et al.
Publicado: (2022)
por: Lowe, Angus, et al.
Publicado: (2022)
Tight Bounds for Quantum Phase Estimation and Related Problems
por: Mande, Nikhil S., et al.
Publicado: (2023)
por: Mande, Nikhil S., et al.
Publicado: (2023)
Quantum Lovász Local Lemma: Shearer's Bound is Tight
por: He, Kun, et al.
Publicado: (2018)
por: He, Kun, et al.
Publicado: (2018)
Learning Quantum Processes with Quantum Statistical Queries
por: Wadhwa, Chirag, et al.
Publicado: (2023)
por: Wadhwa, Chirag, et al.
Publicado: (2023)
The Space-Time Cost of Purifying Quantum Computations
por: Zhandry, Mark
Publicado: (2024)
por: Zhandry, Mark
Publicado: (2024)
Quantum Search with In-Place Queries
por: Holman, Blake, et al.
Publicado: (2025)
por: Holman, Blake, et al.
Publicado: (2025)
Benchmarking Classical and Quantum Optimization Approaches for Rider-Order Assignment
por: SAPV, Tharrmashastha, et al.
Publicado: (2026)
por: SAPV, Tharrmashastha, et al.
Publicado: (2026)
The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth
por: Kahanamoku-Meyer, Gregory D., et al.
Publicado: (2024)
por: Kahanamoku-Meyer, Gregory D., et al.
Publicado: (2024)
On Bounded Advice Classes
por: Marshall, Simon, et al.
Publicado: (2024)
por: Marshall, Simon, et al.
Publicado: (2024)
Lower bounds for quantum-inspired classical algorithms via communication complexity
por: Mande, Nikhil S., et al.
Publicado: (2024)
por: Mande, Nikhil S., et al.
Publicado: (2024)
Quadratic Lower bounds on the Approximate Stabilizer Rank: A Probabilistic Approach
por: Mehraban, Saeed, et al.
Publicado: (2023)
por: Mehraban, Saeed, et al.
Publicado: (2023)
Bounding the computational power of bosonic systems
por: Upreti, Varun, et al.
Publicado: (2025)
por: Upreti, Varun, et al.
Publicado: (2025)
The Round Complexity of Proofs in the Bounded Quantum Storage Model
por: Grilo, Alex B., et al.
Publicado: (2024)
por: Grilo, Alex B., et al.
Publicado: (2024)
Information-Theoretic Lower Bounds for Approximating Monomials via Optimal Quantum Tsallis Entropy Estimation
por: Wang, Qisheng
Publicado: (2025)
por: Wang, Qisheng
Publicado: (2025)
Certificate Games and Consequences for the Classical Adversary Bound
por: Chakraborty, Sourav, et al.
Publicado: (2022)
por: Chakraborty, Sourav, et al.
Publicado: (2022)
Entanglement-Dependent Error Bounds for Hamiltonian Simulation
por: Kulkarni, Prateek P.
Publicado: (2026)
por: Kulkarni, Prateek P.
Publicado: (2026)
An Unconditional Barrier for Proving Multilinear Algebraic Branching Program Lower Bounds
por: Kush, Deepanshu
Publicado: (2026)
por: Kush, Deepanshu
Publicado: (2026)
Lower Bounds for Conjunctive Query Evaluation
por: Mengel, Stefan
Publicado: (2025)
por: Mengel, Stefan
Publicado: (2025)
Generalization Error Bound for Quantum Machine Learning in NISQ Era -- A Survey
por: Khanal, Bikram, et al.
Publicado: (2024)
por: Khanal, Bikram, et al.
Publicado: (2024)
Quantum First-Order Logics That Capture Logarithmic-Time/Space Quantum Computability
por: Yamakami, Tomoyuki
Publicado: (2025)
por: Yamakami, Tomoyuki
Publicado: (2025)
The Space Just Above One Clean Qubit
por: Jacobs, Dale, et al.
Publicado: (2024)
por: Jacobs, Dale, et al.
Publicado: (2024)
Space-bounded quantum interactive proof systems
por: Gall, François Le, et al.
Publicado: (2024)
por: Gall, François Le, et al.
Publicado: (2024)
Elementary Quantum Recursion Schemes That Capture Quantum Polylogarithmic Time Computability of Quantum Functions
por: Yamakami, Tomoyuki
Publicado: (2023)
por: Yamakami, Tomoyuki
Publicado: (2023)
Dequantizing the Quantum Singular Value Transformation: Hardness and Applications to Quantum Chemistry and the Quantum PCP Conjecture
por: Gharibian, Sevag, et al.
Publicado: (2021)
por: Gharibian, Sevag, et al.
Publicado: (2021)
Ejemplares similares
-
Efficient Quantum Agnostic Improper Learning of Decision Trees
por: Chatterjee, Sagnik, et al.
Publicado: (2022) -
Improved Circuit Lower Bounds and Quantum-Classical Separations
por: Grewal, Sabee, et al.
Publicado: (2024) -
Lower Bounds on Relative Error Quantum Compression and Classical Shadows
por: Sankar, Kaushik
Publicado: (2025) -
Query and Depth Upper Bounds for Quantum Unitaries via Grover Search
por: Rosenthal, Gregory
Publicado: (2021) -
Improved Quantum Query Upper Bounds Based on Classical Decision Trees
por: Cornelissen, Arjan, et al.
Publicado: (2022)