scientific article; zbMATH DE number 7561509
From MaRDI portal
Publication:5091164
DOI10.4230/LIPIcs.ICALP.2019.16MaRDI QIDQ5091164
Srinivasan Arunachalam, Manaswi Paraashar, Sourav Chakraborty, Troy Lee, Ronald de Wolf
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/1810.00481
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (4)
Sample complexity of hidden subgroup problem ⋮ Quantum learning Boolean linear functions w.r.t. product distributions ⋮ Quantum Hardness of Learning Shallow Classical Circuits ⋮ Quantum learning of concentrated Boolean functions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A polynomial bound in Freiman's theorem.
- Learning functions of \(k\) relevant variables
- Quantum algorithms for learning and testing juntas
- Near-Optimal Upper Bound on Fourier Dimension of Boolean Functions in Terms of Fourier Sparsity
- On sparse reconstruction from Fourier and Gaussian measurements
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- A theory of the learnable
- Learning DNF over the Uniform Distribution Using a Quantum Example Oracle
- Quantum Complexity Theory
- Equivalences and Separations Between Quantum and Classical Learnability
- The List-Decoding Size of Fourier-Sparse Boolean Functions
- An Entropic Proof of Chang's Inequality
- Analysis of Boolean Functions
- An Improved Estimate in the Restricted Isometry Problem
- Restricted Isometry of Fourier Matrices and List Decodability of Random Linear Codes
- Nearly optimal sparse fourier transform
- Automata, Languages and Programming
- Testing Fourier Dimensionality and Sparsity
- Quantum lower bounds by quantum arguments
This page was built for publication:
