Evaluation of exact quantum query complexities by semidefinite programming
From MaRDI portal
Publication:2100824
DOI10.1007/s11128-019-2297-3zbMath1502.68126OpenAlexW2941132523MaRDI QIDQ2100824
Publication date: 25 November 2022
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11128-019-2297-3
Semidefinite programming (90C22) Quantum algorithms and complexity in the theory of computing (68Q12)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quantum algorithm for the asymmetric weight decision problem and its generalization to multiple weights
- A new quantum lower bound method, with applications to direct product theorems and time-space tradeoffs
- Equality relating Euclidean distance cone to positive semidefinite cone
- Complexity measures and decision tree complexity: a survey.
- On rank vs. communication complexity
- On exact quantum query complexity
- A new sure-success generalization of Grover iteration and its application to weight decision problem of Boolean functions
- The quantum adversary method and classical formula size power bounds
- Polynomial degree vs. quantum query complexity
- Superlinear Advantage for Exact Quantum Algorithms
- From Quantum Query Complexity to State Complexity
- Generalizations of the distributed Deutsch–Jozsa promise problem
- Graph Implementations for Nonsmooth Convex Programs
- Symmetric Boolean Functions
- The complexity of promise problems with applications to public-key cryptography
- Rapid solution of problems by quantum computation
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- On the Power of Quantum Computation
- Strengths and Weaknesses of Quantum Computing
- Separations in Query Complexity Based on Pointer Functions
- Quantum lower bounds by polynomials
- Quantum Walk Algorithm for Element Distinctness
- Quantum lower bounds by quantum arguments
This page was built for publication: Evaluation of exact quantum query complexities by semidefinite programming
