Pages that link to "Item:Q3446818"
From MaRDI portal
The following pages link to Quantum Algorithms for Some Hidden Shift Problems (Q3446818):
Displayed 18 items.
- The quantum query complexity of learning multilinear polynomials (Q436558) (← links)
- Quantum pattern matching fast on average (Q513289) (← links)
- Polynomial interpolation and identity testing from high powers over finite fields (Q1709581) (← links)
- Quantum algorithm design: techniques and applications (Q1730317) (← links)
- Identity testing and interpolation from high powers of polynomials of large degree over finite fields (Q1791682) (← links)
- A novel fault-tolerant quantum divider and its simulation (Q2107957) (← links)
- A fusion algorithm for solving the hidden shift problem in finite abelian groups (Q2118532) (← links)
- Post-quantum security of the Even-Mansour cipher (Q2170099) (← links)
- Quantum computing: survey and analysis (Q2320203) (← links)
- Quantum Fourier transform in computational basis (Q2412616) (← links)
- Products with variables from low-dimensional affine spaces and shifted power identity testing in finite fields (Q2437318) (← links)
- Quantum algorithms for typical hard problems: a perspective of cryptanalysis (Q2677252) (← links)
- Quantum algorithm based on the \(\varepsilon\)-random linear disequations for the continuous hidden shift problem (Q2685660) (← links)
- Quantum algorithms for algebraic problems (Q3077033) (← links)
- Quantum machine learning: a classical perspective (Q4556858) (← links)
- Identifying Generalized Reed-Muller Codewords by Quantum Queries (Q4977894) (← links)
- Homomorphic encryption: a mathematical survey (Q6118172) (← links)
- Quantum linear key-recovery attacks using the QFT (Q6190139) (← links)
