scientific article; zbMATH DE number 7561760

DOI10.4230/LIPIcs.CCC.2020.32MaRDI QIDQ5092483

Arkadev Chattopadhyay, Nikhil S. Mande, Sourav Chakraborty, Manaswi Paraashar

Publication date: 21 July 2022

Full work available at URL: https://arxiv.org/abs/1909.10428

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

quantum query complexityapproximate degreequantum communication complexityapproximate spectral norm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• How low can approximate degree and quantum query complexity be for total Boolean functions?
• Unbounded-error quantum query complexity
• On the computational power of depth-2 circuits with threshold and modulo gates
• Quantum communication and complexity.
• Robust polynomials and quantum algorithms
• Spectral Norm of Symmetric Functions
• Lower Bounds in Communication Complexity
• On the Tightness of the Buhrman-Cleve-Wigderson Simulation
• Quantum Complexity Theory
• Quantum communication complexity of symmetric predicates
• Every monotone graph property has a sharp threshold
• A Lifting Theorem with Applications to Symmetric Functions
• The log-approximate-rank conjecture is false
• Algorithmic polynomials
• Quantum lower bounds by polynomials
• Improved Bounds on Fourier Entropy and Min-Entropy

This page was built for publication: