Pages that link to "Item:Q835643"
From MaRDI portal
The following pages link to A new quantum lower bound method, with applications to direct product theorems and time-space tradeoffs (Q835643):
Displaying 10 items.
- A direct product theorem for two-party bounded-round public-coin communication complexity (Q343852) (← links)
- A strong direct product theorem for quantum query complexity (Q354645) (← links)
- Optimal direct sum results for deterministic and randomized decision tree complexity (Q407594) (← links)
- Improved direct product theorems for randomized query complexity (Q693002) (← links)
- Evaluation of exact quantum query complexities by semidefinite programming (Q2100824) (← links)
- A new quantum lower bound method, (Q2931423) (← links)
- A new quantum lower bound method, with an application to a strong direct product theorem for quantum search (Q3002814) (← links)
- Quantum and Classical Strong Direct Product Theorems and Optimal Time‐Space Tradeoffs (Q5422496) (← links)
- Quantum lower bounds by quantum arguments (Q5895206) (← links)
- The NISQ complexity of collision finding (Q6637517) (← links)
