Algebra, Cryptography and Quantum Algorithms: Difference between revisions
From Santa Fe Institute Events Wiki
No edit summary |
No edit summary |
||
| Line 3: | Line 3: | ||
organized by '''Cris Moore''' (SFI)<br> | organized by '''Cris Moore''' (SFI)<br> | ||
'''Abstract''' | '''Abstract'''<br> | ||
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. | 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 | Other beautiful things at the frontier of quantum algorithms | ||
Latest revision as of 21:06, 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