scientific article; zbMATH DE number 7561760

DOI10.4230/LIPICS.CCC.2020.32MaRDI QIDQ5092483zbMATH OpenFDO

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

Publication date 21 July 2022

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

zbMATH Keywords

quantum query complexityapproximate degreequantum communication complexityapproximate spectral norm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cites work

• scientific article; zbMATH DE number 1256737 (Why is no real title available?)
• scientific article; zbMATH DE number 1775389 (Why is no real title available?)
• scientific article; zbMATH DE number 2086394 (Why is no real title available?)
• scientific article; zbMATH DE number 2103524 (Why is no real title available?)
• A lifting theorem with applications to symmetric functions
• Algorithmic polynomials
• Every monotone graph property has a sharp threshold
• How low can approximate degree and quantum query complexity be for total Boolean functions?
• Improved Bounds on Fourier Entropy and Min-Entropy
• Lower bounds in communication complexity
• On the computational power of depth-2 circuits with threshold and modulo gates
• On the tightness of the Buhrman-Cleve-Wigderson simulation
• Quantum Complexity Theory
• Quantum communication and complexity.
• Quantum communication complexity of symmetric predicates
• Quantum lower bounds by polynomials
• Quantum search of spatial regions
• Robust polynomials and quantum algorithms
• Spectral norm of symmetric functions
• The log-approximate-rank conjecture is false
• Unbounded-error quantum query complexity

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5092483)