Algebra, Cryptography and Quantum Algorithms: Difference between revisions
From Santa Fe Institute Events Wiki
(Created page with '{{Algebra, Cryptography and Quantum Algorithms}}') |
No edit summary |
||
Line 1: | Line 1: | ||
{{Algebra, Cryptography and Quantum Algorithms}} | {{Algebra, Cryptography and Quantum Algorithms}} | ||
organized by '''Cris Moore''' (SFI)<br> | |||
'''Abstract'''. The Lasserre hierarchy and quantum proofs of classical lower bounds. quantum groups, knot invariants, and manifold invariants. Hamiltonian complexity and progress towards the area law. post-quantum cryptosystems, using tensors, lattices, Learning with Errors, etc. | |||
Other beautiful things at the frontier of quantum algorithms |
Revision as of 20:23, 17 April 2013
Working Group Navigation |
organized by Cris Moore (SFI)
Abstract. The Lasserre hierarchy and quantum proofs of classical lower bounds. quantum groups, knot invariants, and manifold invariants. Hamiltonian complexity and progress towards the area law. post-quantum cryptosystems, using tensors, lattices, Learning with Errors, etc.
Other beautiful things at the frontier of quantum algorithms