scientific article; zbMATH DE number 5485488
From MaRDI portal
Publication:3549652
Cited in
(42)- Quantum Algorithms for Classical Probability Distributions
- Quantum algorithms for learning symmetric juntas via the adversary bound
- Quantum query as a state decomposition
- 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 query complexities of local search are polynomially related
- Quantum vs. classical proofs and subset verification
- On exact quantum query complexity
- Quantum separation of local search and fixed point computation
- Provably secure key establishment against quantum adversaries
- A stronger LP bound for formula size lower bounds via clique constraints
- Quantum counterfeit coin problems
- Quantum attacks against iterated block ciphers
- Algorithms and lower bounds for De Morgan formulas of low-communication leaf gates
- On convex complexity measures
- Quantum Lower Bounds for Tripartite Versions of the Hidden Shift and the Set Equality Problems
- Sensitivity conjecture and signed hypercubes
- Evaluation of exact quantum query complexities by semidefinite programming
- Quantum Speedup for Graph Sparsification, Cut Approximation, and Laplacian Solving
- All classical adversary methods are equivalent for total functions
- The power of many samples in query complexity
- Quantum algorithms for finding constant-sized sub-hypergraphs
- Improved quantum query algorithms for triangle detection and associativity testing
- Quantum query algorithms are completely bounded forms
- A direct reduction from the polynomial to the adversary method
- Quantum non-identical mean estimation: efficient algorithms and fundamental limits
- scientific article; zbMATH DE number 7561557 (Why is no real title available?)
- A strong direct product theorem for quantum query complexity
- On the power of non-adaptive learning graphs
- scientific article; zbMATH DE number 7716603 (Why is no real title available?)
- Superlinear advantage for exact quantum algorithms
- An exponential separation between quantum query complexity and the polynomial degree
- A query-efficient quantum algorithm for maximum matching on general graphs
- Quantum query algorithms are completely bounded forms
- Exploring the limits of subadditive approaches: parallels between optimization and complexity theory
- Quantum distinguishing complexity, zero-error algorithms, and statistical zero knowledge
- Span-program-based quantum algorithm for evaluating unbalanced formulas
- A new quantum lower bound method, with applications to direct product theorems and time-space tradeoffs
- Optimal deterministic quantum algorithm for the promised element distinctness problem
- Key establishment à la Merkle in a quantum world
- Extended learning graphs for triangle finding
- Quantum lower bounds by sample-to-query lifting
- Quantum property testing for bounded-degree graphs
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 Q3549652)
