Back to News
quantum-computing

Grover search may lose speedup as local quantum noise increases rapidly

Muhammad Rohail T.
Loading...
1 min read
0 likes
⚡ Quantum Brief
The promise of Grover’s search, finding an item in a list using only its square root's worth of steps, vanishes surprisingly quickly as errors accumulate; this work reveals that permissible error rates must fall even *faster* than previously understood when scaling up quantum computers. Unlike prior analyses offering bounds or thresholds, these new equations precisely quantify how different types of qubit noise erode the algorithm’s speedup, explaining which errors inflict the most damage. This unified framework offers explicit expressions to compare channels and understand error sensitivities better.
AI Audio Summary
0:00 / 0:00
Click to play
page-081-object-085.webp
Quantum News · Media Library

The promise of Grover’s search, finding an item in a list using only its square root's worth of steps, vanishes surprisingly quickly as errors accumulate; this work reveals that permissible error rates must fall even *faster* than previously understood when scaling up quantum computers. Unlike prior analyses offering bounds or thresholds, these new equations precisely quantify how different types of qubit noise erode the algorithm’s speedup, explaining which errors inflict the most damage. This unified framework offers explicit expressions to compare channels and understand error sensitivities better.

Read Original

Tags

quantum-computing
quantum-algorithms
quantum-hardware

Source Information

Source: Quantum Zeitgeist

Discussion

0 professional contributions

Sign in to join this professional discussion.

Be the first to add a constructive contribution.