Pages that link to "Item:Q436558"
From MaRDI portal
The following pages link to The quantum query complexity of learning multilinear polynomials (Q436558):
Displaying 5 items.
- A quantum algorithm for Viterbi decoding of classical convolutional codes (Q2516136) (← links)
- Quantum learning Boolean linear functions w.r.t. product distributions (Q2677243) (← links)
- Quantum algorithm for multivariate polynomial interpolation (Q4556869) (← links)
- (Q4614114) (← links)
- Identifying Generalized Reed-Muller Codewords by Quantum Queries (Q4977894) (← links)