The need for structure in quantum speedups
From MaRDI portal
Recommendations
Cites work
Cited in
(37)- Pattern recognition in non-Kolmogorovian structures
- Classical vs quantum random oracles
- Book review of: F. Bassino et al., Complexity and randomness in group theory. GAGTA book 1
- Polynomial inequalities on the Hamming cube
- On the Fourier spectrum of functions on Boolean cubes
- Unifying presampling via concentration bounds
- Quantum property testing for bounded-degree graphs
- On the sum of the L₁ influences of bounded functions
- Impossibility of succinct quantum proofs for collision-freeness
- Superpolynomial Speedups Based on Almost Any Quantum Circuit
- The asymptotic growth of the constants in the Bohnenblust-Hille inequality is optimal
- A note on the quantum query complexity of permutation symmetric functions
- On the need for large Quantum depth
- The structure of promises in quantum speedups
- scientific article; zbMATH DE number 6789291 (Why is no real title available?)
- Lower bounds for the constants in the Bohnenblust–Hille inequality: The case of real scalars
- Almost all decision trees do not allow significant quantum speed-up
- On the impossibility of key agreements from quantum random oracles
- Black-box separations for non-interactive classical commitments in a quantum world
- Simple tests of quantumness also certify qubits
- Certified randomness from quantum supremacy
- Quantum depth in the random oracle model
- On query complexity measures and their relations for symmetric functions
- On the (im)plausibility of public-key quantum money from collision-resistant hash functions
- On the (im)possibility of time-lock puzzles in the quantum random oracle model
- An introduction to quantum computing for statisticians and data scientists
- Quantum advantage from one-way functions
- How (not) to build quantum PKE in Minicrypt
- Symmetries, graph properties, and quantum speedups
- Fourier 1-norm and quantum speed-up
- Quantum and classical communication complexity of permutation-invariant functions
- A qubit, a coin, and an advice string walk into a relational problem
- On the fine-grained query complexity of symmetric functions
- Russo-Dye type theorem, Stinespring representation, and Radon-Nikodým derivative for invariant block multilinear completely positive maps
- On the fine-grained query complexity of symmetric functions
- Verifiable quantum advantage without structure
- Analysis of quantum primitives for quantum utility
This page was built for publication: The need for structure in quantum speedups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3191607)
