The following pages link to Sean Hallgren (Q1653091):
Displaying 21 items.
- Supersingular isogeny graphs and endomorphism rings: reductions and solutions (Q1653093) (← links)
- Weak Instances of PLWE (Q2798613) (← links)
- Quantum Fourier sampling simplified (Q2819563) (← links)
- (Q2949502) (← links)
- Normal subgroup reconstruction and quantum computation using group representations (Q3192035) (← links)
- Quantum Algorithms for Some Hidden Shift Problems (Q3446818) (← links)
- Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks (Q3519535) (← links)
- Superpolynomial Speedups Based on Almost Any Quantum Circuit (Q3521966) (← links)
- Fast quantum algorithms for computing the unit group and class group of a number field (Q3581441) (← links)
- (Q4471334) (← links)
- The Hidden Subgroup Problem and Quantum Computation Using Group Representations (Q4706239) (← links)
- A quantum algorithm for computing the unit group of an arbitrary degree number field (Q5259563) (← links)
- How Hard Is Deciding Trivial Versus Nontrivial in the Dihedral Coset Problem (Q5278347) (← links)
- (Q5417640) (← links)
- Computing and Combinatorics (Q5716961) (← links)
- Computing endomorphism rings of supersingular elliptic curves and connections to path-finding in isogeny graphs (Q5853799) (← links)
- Limitations of quantum coset states for graph isomorphism (Q5891930) (← links)
- Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem (Q5900520) (← links)
- Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem (Q5901044) (← links)
- Quantum computing (Q5901475) (← links)
- (Q6058189) (← links)
