Pages that link to "Item:Q5696935"
From MaRDI portal
The following pages link to EFFICIENT QUANTUM ALGORITHMS FOR SOME INSTANCES OF THE NON-ABELIAN HIDDEN SUBGROUP PROBLEM (Q5696935):
Displaying 11 items.
- Quantum property testing of group solvability (Q627520) (← links)
- Complexity classes of equivalence problems revisited (Q716333) (← links)
- An efficient quantum algorithm for the hidden subgroup problem in nil-2 groups (Q2428678) (← links)
- Is Grover's algorithm a quantum hidden subgroup algorithm? (Q2467208) (← links)
- Permutation groups, minimal degrees and quantum computing. (Q2469771) (← links)
- Graph Isomorphism is in SPP (Q2495656) (← links)
- Sample complexity of hidden subgroup problem (Q2672576) (← links)
- Quantum algorithms for algebraic problems (Q3077033) (← links)
- (Q5005126) (← links)
- Quantum Algorithms for a Set of Group Theoretic Problems (Q5261611) (← links)
- Niederreiter cryptosystems using quasi-cyclic codes that resist quantum Fourier sampling (Q6047445) (← links)
