Quantum sabotage complexity
From MaRDI portal
Cites work
- A composition theorem for randomized query complexity
- A composition theorem for randomized query complexity via max-conflict complexity
- A tight composition theorem for the randomized query complexity of partial functions (extended abstract)
- Composition limits and separating examples for some Boolean function complexity measures
- CREW PRAM<scp>s</scp> and Decision Trees
- Degree vs. approximate degree and Quantum implications of Huang’s sensitivity theorem
- scientific article; zbMATH DE number 5899240 (Why is no real title available?)
- scientific article; zbMATH DE number 1256737 (Why is no real title available?)
- scientific article; zbMATH DE number 6913819 (Why is no real title available?)
- Induced subgraphs of hypercubes and a proof of the sensitivity conjecture
- Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments
- On fractional block sensitivity
- On the composition of randomized query complexity and approximate degree
- Polynomial degree vs. quantum query complexity
- Quantum distinguishing complexity, zero-error algorithms, and statistical zero knowledge
- Quantum lower bounds by polynomials
- Quantum lower bounds by quantum arguments
- Quantum Query Complexity of State Conversion
- Randomised composition and small-bias minimax
- Randomized communication versus partition number
- Randomized query composition and product distributions
- Separations in query complexity using cheat sheets
- Strengths and Weaknesses of Quantum Computing
- The power of many samples in query complexity
This page was built for publication: Quantum sabotage complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7263579)
