The Complexity of the Continuous Hidden Subgroup Problem

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=_sW_2iRg31A


Duration: 44:08
503 views
11

Koen de Boer, CWI
https://simons.berkeley.edu/talks/complexity-continuous-hidden-subgroup-problem
Quantum Cryptanalysis of Post-Quantum Cryptography



Other Videos By Simons Institute for the Theory of Computing


2020-02-26The Quantum Approximate Optimization Algorithm: Recent Results
2020-02-25Quantum Algorithms on Convex Bodies
2020-02-25Quantum Algorithms for Second-Order Cone Programming
2020-02-25Faster Quantum and Classical SDP Approximations for Quadratic Binary Optimization
2020-02-25A Classical Algorithm Framework for Dequantizing Quantum Machine Learning
2020-02-25Randomized Algorithms in Linear Algebra
2020-02-25How Hard Is It to Train Variational Quantum Circuits?
2020-02-25Quantum Machine Learning: Prospects and Challenges
2020-02-24Drinfeld Modules are not for Isogeny Based Cryptography
2020-02-24On Quantum Attacks to the Code-Equivalence Problem
2020-02-24The Complexity of the Continuous Hidden Subgroup Problem
2020-02-24Overview of Multi-Variate Function Based Public-Key Cryptography and Cryptanalysis
2020-02-24Using Kuperberg's Collimation Sieve to Attack CSIDH
2020-02-24Overview of Attacks on Elliptic Curve Isogenies Based Systems
2020-02-24Overview of Elliptic Curve Isogenies Based Public Key Cryptography Assumptions
2020-02-24Algebraic Techniques for the Reduction of Algebraic Lattices
2020-02-24Recent Results on Attacking Hashed Periodic Functions
2020-02-22Quantum cryptanalysis with Q#
2020-02-22On Attacking Hash functions in Cryptographic schemes
2020-02-22Overview of Quantum Algorithmic Tools
2020-02-22Overview of Code-Based Crypto Assumptions


Tags:
Koen de Boer
Simons Institute
Theory of Computing
Theory of Computation
Theoretical Computer Science
Computer Science
UC Berkeley
Quantum Cryptanalysis of Post-Quantum Cryptography