Characterizing Grover search algorithm on large-scale superconducting quantum computers
Abstract Quantum computing is on the cusp of transforming the way we tackle complex problems, and the Grover search algorithm exemplifying its potential to revolutionize the search for unstructured large datasets, offering remarkable speedups over classical methods. Here, we report results for the i...
Saved in:
Main Author: | Muhammad AbuGhanem |
---|---|
Format: | Article |
Language: | English |
Published: |
Nature Portfolio
2025-01-01
|
Series: | Scientific Reports |
Subjects: | |
Online Access: | https://doi.org/10.1038/s41598-024-80188-6 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Using a Simplified Quantum Counter to Implement Quantum Circuits Based on Grover’s Algorithm to Tackle the Exact Cover Problem
by: Jehn-Ruey Jiang, et al.
Published: (2024-12-01) -
Fixed-Point Grover Adaptive Search for Quadratic Binary Optimization Problems
by: Akos Nagy, et al.
Published: (2024-01-01) -
ECC fault attack algorithm based on Grover's quantum search algorithm with 0.1π phase rotation
by: Chao WANG, et al.
Published: (2017-08-01) -
Scalable Full-Stack Benchmarks for Quantum Computers
by: Jordan Hines, et al.
Published: (2024-01-01) -
Multiobjective Optimization and Network Routing With Near-Term Quantum Computers
by: Shao-Hen Chiew, et al.
Published: (2024-01-01)