Influences of Fourier completely bounded polynomials and classical simulation of quantum algorithms

DOI10.4086/CJTCS.2024.002MaRDI QIDQ6646783

Francisco Gutierrez

Publication date: 3 December 2024

Published in: Chicago Journal of Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

polynomialsfunctional analysisquantum query complexitycompletely bounded norminfluence of Boolean functions

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On an inequality of von Neumann and an application of the metric theory of tensor products to operators theory. (Appendix by S. Kaijser and N. Th. Varopoulos.)
• On the Fourier spectrum of functions on Boolean cubes
• Some applications of hypercontractive inequalities in quantum information theory
• On the fourier tails of bounded functions over the discrete cube
• Forrelation
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• On the Power of Quantum Computation
• Quantum Query Algorithms Are Completely Bounded Forms
• UNDERSTANDING QUANTUM ALGORITHMS VIA QUERY COMPLEXITY
• Polynomials, quantum query complexity, and Grothendieck's inequality
• Quantum lower bounds by polynomials
• Quantum Walk Algorithm for Element Distinctness
• An optimal separation of randomized and Quantum query complexity
• k-forrelation optimally separates Quantum and classical query complexity
• On the impossibility of key agreements from quantum random oracles

This page was built for publication: Influences of Fourier completely bounded polynomials and classical simulation of quantum algorithms

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