Demonstration of Algorithmic Quantum Speedup for an Abelian Hidden Subgroup Problem
Simon’s problem is to find a hidden period (a bitstring) encoded into an unknown 2-to-1 function. It is one of the earliest problems for which an exponential quantum speedup was proven for ideal, noiseless quantum computers, albeit in the oracle model. Here, using two different 127-qubit IBM Quantum...
Сохранить в:
| Главные авторы: | , , , , |
|---|---|
| Формат: | Artigo |
| Язык: | Inglês |
| Опубликовано: |
American Physical Society
2025-06-01
|
| Серии: | Physical Review X |
| Online-ссылка: | http://doi.org/10.1103/PhysRevX.15.021082 |
| Метки: |
Нет меток, Требуется 1-ая метка записи!
|