Pages that link to "Item:Q5415466"
From MaRDI portal
The following pages link to Span programs for functions with constant-sized 1-certificates (Q5415466):
Displaying 24 items.
- Improving quantum query complexity of Boolean matrix multiplication using graph collision (Q334915) (← links)
- On the power of non-adaptive learning graphs (Q488054) (← links)
- Improved quantum query algorithms for triangle detection and associativity testing (Q513275) (← links)
- Quantum algorithms for finding constant-sized sub-hypergraphs (Q896154) (← links)
- Quantum algorithm for triangle finding in sparse graphs (Q1679241) (← links)
- Quantum algorithm design: techniques and applications (Q1730317) (← links)
- Quantum algorithm for the multicollision problem (Q2006780) (← links)
- Fooling views: a new lower bound technique for distributed computations under congestion (Q2220402) (← links)
- Extended learning graphs for triangle finding (Q2300731) (← links)
- Quantum algorithms for learning symmetric juntas via the adversary bound (Q2351390) (← links)
- Optimal parallel quantum query algorithms (Q2408924) (← links)
- Approximate span programs (Q2414858) (← links)
- Quantum Complexity of Boolean Matrix Multiplication and Related Problems (Q2944887) (← links)
- (Q3179349) (← links)
- Quantum Query Algorithms Are Completely Bounded Forms (Q4634058) (← links)
- (Q4637980) (← links)
- Quantum Query Algorithms are Completely Bounded Forms. (Q4993266) (← links)
- (Q5009613) (← links)
- Quantum Algorithms for Classical Probability Distributions (Q5075751) (← links)
- (Q5089153) (← links)
- (Q5089191) (← links)
- (Q5140844) (← links)
- Quantum Lower Bounds for Tripartite Versions of the Hidden Shift and the Set Equality Problems (Q5889069) (← links)
- Symmetries, graph properties, and quantum speedups (Q6654557) (← links)
