Quantum learning Boolean linear functions w.r.t. product distributions
From MaRDI portal
Publication:2677243
DOI10.1007/S11128-020-02661-1OpenAlexW3104287459MaRDI QIDQ2677243FDOQ2677243
Authors: Matthias C. Caro
Publication date: 13 January 2023
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1902.08753
Recommendations
Cites Work
- High-dimensional probability. An introduction with applications in data science
- Probability Inequalities for Sums of Bounded Random Variables
- Understanding machine learning. From theory to algorithms
- The computer as a physical system: a microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines
- Quantum computation and quantum information. 10th anniversary edition
- Analysis of Boolean Functions
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- A theory of the learnable
- Reversing quantum dynamics with near-optimal quantum and classical fidelity
- On lattices, learning with errors, random linear codes, and cryptography
- Quantum complexity theory
- A ‘Pretty Good’ Measurement for Distinguishing Quantum States
- Noise-tolerant learning, the parity problem, and the statistical query model
- The quantum query complexity of learning multilinear polynomials
- Title not available (Why is that?)
- Learning DNF over the Uniform Distribution Using a Quantum Example Oracle
- Equivalences and Separations Between Quantum and Classical Learnability
- Quantum algorithms for learning and testing juntas
- Optimal quantum sample complexity of learning algorithms
- Title not available (Why is that?)
- Quantum hardness of learning shallow classical circuits
Cited In (2)
This page was built for publication: Quantum learning Boolean linear functions w.r.t. product distributions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2677243)