scientific article; zbMATH DE number 7716601
From MaRDI portal
Publication:6176153
Recommendations
- Quantum distinguishing complexity, zero-error algorithms, and statistical zero knowledge
- Unbounded-error quantum query complexity
- Unbounded-Error Quantum Query Complexity
- Hardness of approximation for quantum problems
- On exact quantum query complexity
- An entropic analysis of approximate quantum error correction
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Approximate Degree in Classical and Quantum Computing
- Asymptotic error rates in quantum hypothesis testing
Cites work
- Algorithmic polynomials
- An exponential separation between MA and AM proofs of proximity
- Hardness amplification and the approximate degree of constant-depth circuits
- How hard is it to approximate the Jones polynomial?
- scientific article; zbMATH DE number 5899233 (Why is no real title available?)
- Impossibility of succinct quantum proofs for collision-freeness
- On the degree of Boolean functions as real polynomials
- Quantum Arthur-Merlin games
- Quantum cryptanalysis of hash and claw-free functions
- Quantum lower bound for the collision problem with small range
- Quantum lower bounds by polynomials
- Quantum lower bounds for the collision and the element distinctness problems
- Quantum Walk Algorithm for Element Distinctness
- The polynomial method strikes back: tight quantum query bounds via dual polynomials
- The power of asymmetry in constant-depth circuits
- The quantum query complexity of \(\mathrm{AC}^0\)
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 Q6176153)
