Theoretical study showing promise problems behave fundamentally differently from languages in relativized settings. Improves upper bound on Quantum-Classical Polynomial Hierarchy and proves self-lowness of PromiseBQP under robust oracle access.

#QuantumComplexity #TheoreticalCS #Research

We prove quantum algorithms achieve quadratic speedup for counting positive Bernoulli distributions, establishing near-matching bounds: Õ(√ρ/(Δϵ)) upper and Ω(√ρ/(Δϵ)) lower via novel Boolean-over-average-case composition theorem.

#QuantumAlgorithms #QuantumComplexity #Research

Quantitative lower bounds established on semidefinite program complexity for approximating separable quantum state properties, improving previous quasipolynomial bounds and providing insights into entanglement certification hardness.

#QuantumComplexity #QuantumInformation #Research

Establishes upper and lower bounds for sample complexity of the generalized hidden shift problem over arbitrary finite groups using quantum information theory and representation-theoretic techniques.

#QuantumAlgorithms #QuantumComplexity #Research

Constant-depth quantum circuits and controlled fanout gates are equivalent for symmetric Boolean functions. The required fanout size is precisely determined by the function's transition radius, unifying prior quantum circuit complexity results.

#QuantumCircuits #QuantumComplexity #Research

Researchers establish universal bounds linking entanglement spectrum structure to quantum nonstabilizerness, revealing that spectral non-uniformity and entropy distribution independently govern quantum complexity in many-body systems.

#QuantumEntanglement #QuantumComplexity #Research