Grover Search Scaling Benchmark
Benchmark measuring the scaling behavior of Grover's quantum search algorithm on NISQ hardware. Better-than-classical success probabilities have been demonstrated up to five qubits on IBM superconducting platforms using robust dynamical decoupling. The GRADE benchmarking toolkit provides standardized evaluation of quantum hardware reliability using generalized Grover circuits with customizable search configurations.[1]
- Algorithm: Grover's search algorithm
- Category: cryptography
- Qubits: 6
- Framework: Qiskit, GRADE toolkit
- Hardware: IBM Quantum (127-qubit processors)
- Reproducible: Yes
- Published:
- Grover
- search
- scaling
- unstructured-search
- quadratic-speedup
What algorithm does Grover Search Scaling Benchmark use?
Grover Search Scaling Benchmark uses the Grover's search algorithm algorithm, categorized under cryptography.
Frequently Asked Questions
What is the Grover Search Scaling Benchmark benchmark?
Benchmark measuring the scaling behavior of Grover's quantum search algorithm on NISQ hardware. Better-than-classical success probabilities have been demonstrated up to five qubits on IBM superconducting platforms using robust dynamical decoupling. The GRADE benchmarking toolkit provides standardized evaluation of quantum hardware reliability using generalized Grover circuits with customizable search configurations.
Is Grover Search Scaling Benchmark reproducible?
Yes, this benchmark is reproducible.