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...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
American Physical Society
2025-06-01
|
| Series: | Physical Review X |
| Online Access: | http://doi.org/10.1103/PhysRevX.15.021082 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|