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...
Na minha lista:
| Principais autores: | , , , , |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
American Physical Society
2025-06-01
|
| coleção: | Physical Review X |
| Acesso em linha: | http://doi.org/10.1103/PhysRevX.15.021082 |
| Tags: |
Sem tags, seja o primeiro a adicionar uma tag!
|