Pages that link to "Item:Q3191607"
From MaRDI portal
The following pages link to The need for structure in quantum speedups (Q3191607):
Displaying 22 items.
- On the sum of the \(L_1\) influences of bounded functions (Q312259) (← links)
- The asymptotic growth of the constants in the Bohnenblust-Hille inequality is optimal (Q442185) (← links)
- Fourier 1-norm and quantum speed-up (Q670032) (← links)
- Pattern recognition in non-Kolmogorovian structures (Q1616110) (← links)
- Classical vs quantum random oracles (Q2056754) (← links)
- Book review of: F. Bassino et al., Complexity and randomness in group theory. GAGTA book 1 (Q2143337) (← links)
- Polynomial inequalities on the Hamming cube (Q2200497) (← links)
- On the Fourier spectrum of functions on Boolean cubes (Q2423426) (← links)
- Unifying presampling via concentration bounds (Q2695631) (← links)
- Quantum Property Testing for Bounded-Degree Graphs (Q3088108) (← links)
- (Q5090392) (← links)
- On the need for large Quantum depth (Q5144976) (← links)
- (Q5368760) (← links)
- Lower bounds for the constants in the Bohnenblust–Hille inequality: The case of real scalars (Q5398132) (← links)
- Almost all decision trees do not allow significant quantum speed-up (Q5414603) (← links)
- On query complexity measures and their relations for symmetric functions (Q6547823) (← links)
- On the (im)plausibility of public-key quantum money from collision-resistant hash functions (Q6562579) (← links)
- On the (im)possibility of time-lock puzzles in the quantum random oracle model (Q6604881) (← links)
- An introduction to quantum computing for statisticians and data scientists (Q6620130) (← links)
- Quantum advantage from one-way functions (Q6652974) (← links)
- How (not) to build quantum PKE in Minicrypt (Q6653006) (← links)
- Symmetries, graph properties, and quantum speedups (Q6654557) (← links)
