Quantum Algorithm for Solving the Continuous Hidden Symmetry Subgroup Problem
Quantum computers are expected to be able to outperform classical computers. In fact, some computational problems such as integer factorization can be solved on quantum computers substantially faster than classical computers. Interestingly, these problems can be cast in a framework of the hidden sym...
| Autors principals: | , |
|---|---|
| Format: | Article |
| Idioma: | English |
| Publicat: |
IEEE
2021-01-01
|
| Col·lecció: | IEEE Access |
| Matèries: | |
| Accés en línia: | https://ieeexplore.ieee.org/document/9466135/ |