scientific article; zbMATH DE number 7559363
From MaRDI portal
Publication:5089146
DOI10.4230/LIPIcs.TQC.2019.2MaRDI QIDQ5089146
Shalev Ben-David, Robin Kothari
Publication date: 18 July 2022
Full work available at URL: https://arxiv.org/abs/1902.03660
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A strong direct product theorem for quantum query complexity
- On the power of Ambainis lower bounds
- Complexity measures and decision tree complexity: a survey.
- Separation of the monotone NC hierarchy
- Quantum certificate complexity
- Polynomial degree vs. quantum query complexity
- Zero-knowledge against quantum attacks
- Adversary lower bound for the k-sum problem
- A complete problem for statistical zero knowledge
- Quantum lower bounds for the collision and the element distinctness problems
- Strengths and Weaknesses of Quantum Computing
- Deterministic Communication vs. Partition Number
- The Theory of Quantum Information
- Separations in Query Complexity Based on Pointer Functions
- Separations in query complexity using cheat sheets
- Making polynomials robust to noise
- Quantum lower bounds by polynomials
- Quantum Query Complexity of State Conversion
- Rectangles Are Nonnegative Juntas
- Quantum lower bounds by quantum arguments
This page was built for publication:
