The following pages link to (Q2921784):
Displaying 9 items.
- Computational indistinguishability between quantum states and its cryptographic application (Q434349) (← links)
- Graph matching using the interference of continuous-time quantum walks (Q1010111) (← links)
- Query complexity of generalized Simon's problem (Q2051810) (← links)
- Deterministic algorithms for the hidden subgroup problem (Q2105456) (← links)
- The hidden subgroup problem and MKTP (Q2330111) (← links)
- Convergence rates of random walk on irreducible representations of finite groups (Q2481391) (← links)
- Sample complexity of hidden subgroup problem (Q2672576) (← links)
- On the Complexity of the Hidden Subgroup Problem (Q3502634) (← links)
- Niederreiter cryptosystems using quasi-cyclic codes that resist quantum Fourier sampling (Q6047445) (← links)
