Pages that link to "Item:Q3192035"

The following pages link to Normal subgroup reconstruction and quantum computation using group representations (Q3192035):

Displaying 11 items.

• The independence of reduced subgroup-state (Q458557) (← links)
• The quantum query complexity of the hidden subgroup problem is polynomial (Q2390280) (← links)
• Is Grover's algorithm a quantum hidden subgroup algorithm? (Q2467208) (← links)
• Convergence rates of random walk on irreducible representations of finite groups (Q2481391) (← links)
• Discrete quantum walks hit exponentially faster (Q2571012) (← links)
• (Q5092463) (← links)
• Niederreiter cryptosystems using quasi-cyclic codes that resist quantum Fourier sampling (Q6047445) (← links)
• Polynomial total positivity and high relative accuracy through Schur polynomials (Q6053015) (← links)
• Schur polynomials do not have small formulas if the determinant does not (Q6113104) (← links)
• Applications of finite non-abelian simple groups to cryptography in the quantum era (Q6564014) (← links)
• Quantum complexity for discrete logarithms and related problems (Q6652978) (← links)