Fixed-Point Grover Adaptive Search for Quadratic Binary Optimization Problems
In this article, we study a Grover-type method for quadratic unconstrained binary optimization (QUBO) problems. For an <inline-formula><tex-math notation="LaTeX">$n$</tex-math></inline-formula>-dimensional QUBO problem with <inline-formula><tex-math notatio...
Saved in:
Main Authors: | Akos Nagy, Jaime Park, Cindy Zhang, Atithi Acharya, Alex Khan |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2024-01-01
|
Series: | IEEE Transactions on Quantum Engineering |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/10726869/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Characterizing Grover search algorithm on large-scale superconducting quantum computers
by: Muhammad AbuGhanem
Published: (2025-01-01) -
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) -
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) -
Quantum algorithms for enhanced educational technologies
by: Basil Hanafi, et al.
Published: (2025-01-01) -
Solving Nonnative Combinatorial Optimization Problems Using Hybrid Quantum–Classical Algorithms
by: Jonathan Wurtz, et al.
Published: (2024-01-01)