Quantum lower bounds by quantum arguments
From MaRDI portal
Recommendations
- Quantum lower bounds by quantum arguments
- Quantum lower bounds by polynomials
- A new quantum lower bound method, with an application to a strong direct product theorem for quantum search
- Adversary lower bounds for nonadaptive quantum algorithms
- A new quantum lower bound method, with applications to direct product theorems and time-space tradeoffs
Cited in
(48)- Quantum lower bounds for the Goldreich-Levin problem
- Quantum query as a state decomposition
- Entropy lower bounds for quantum decision tree complexity
- A lower bound on the quantum query complexity of read-once functions
- A lower bound method for quantum circuits
- Intricacies of quantum computational paths
- Being a permutation is also orthogonal to one-wayness in quantum world: impossibilities of quantum one-way permutations from one-wayness primitives
- Quantum and classical tradeoffs
- Quantum adversary (upper) bound
- A new quantum lower bound method, with applications to direct product theorems and time-space tradeoffs
- Explicit relation between all lower bound techniques for quantum query complexity
- Explicit relation between all lower bound techniques for quantum query complexity
- Adversary lower bound for the k-sum problem
- A new quantum lower bound method, with an application to a strong direct product theorem for quantum search
- Inverting a permutation is as hard as unordered search
- Lower bound for quantum phase estimation
- Quantum adversary lower bound for element distinctness with small range
- All classical adversary methods are equivalent for total functions
- Tight quantum bounds for computational geometry problems
- Quantum lower bound for recursive Fourier sampling
- Quantum and Randomized Lower Bounds for Local Search on Vertex-Transitive Graphs
- Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments
- Exact quantum lower bound for Grover's problem
- scientific article; zbMATH DE number 1754604 (Why is no real title available?)
- Quantum vs. classical proofs and subset verification
- Quantum adversary (upper) bound
- Quantum lower bounds by polynomials
- Lower Bounds for Local Search by Quantum Arguments
- Quantum weakest preconditions
- On the power of Ambainis lower bounds
- Automata, Languages and Programming
- Deriving Grover's lower bound from simple physical principles
- Quantum lower bounds by quantum arguments
- Lower bounds for QCDCL via formula gauge
- Quantum algorithm for lexicographically minimal string rotation
- On query complexity measures and their relations for symmetric functions
- Decoherence and quantum threats in voice biometric authentication with post-quantum countermeasures
- BQP, meet NP: search-to-decision reductions and approximate counting
- The space-time cost of purifying quantum computations
- A framework of quantum strong exponential-time hypotheses
- On quantum query complexities of collision-finding in non-uniform random functions
- Parameterized quantum query algorithms for graph problems
- Tight quantum time-space tradeoffs for permutation inversion
- How to compute the volume in low dimension?
- Entanglement rates and the stability of the area law for the entanglement entropy
- A new quantum lower bound method, with applications to direct product theorems and time-space tradeoffs
- Quantum separation of local search and fixed point computation
- Adversary lower bounds for nonadaptive quantum algorithms
This page was built for publication: Quantum lower bounds by quantum arguments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5895206)
