The following pages link to Emanuel Knill (Q291562):
Displaying 9 items.
- The quantum query complexity of the hidden subgroup problem is polynomial (Q2390280) (← links)
- Minimal Residual Method Stronger than Polynomial Preconditioning (Q4717288) (← links)
- Group testing problems in experimental molecular biology (Q6502065) (← links)
- Approximation by Quantum Circuits (Q6502376) (← links)
- Bounds for Approximation in Total Variation Distance by Quantum Circuits (Q6502377) (← links)
- Graph generated union-closed families of sets (Q6503561) (← links)
- Generalized degrees and densities for families of sets (Q6503563) (← links)
- Notes on the connectivity of Cayley coset digraphs (Q6503564) (← links)
- Efficient pooling designs for library screening (Q6503576) (← links)
