Finding Small and Large <inline-formula><tex-math notation="LaTeX">$k$</tex-math></inline-formula>-Clique Instances on a Quantum Computer

Finding Small and Large <inline-formula><tex-math notation="LaTeX">$k$</tex-math></inline-formula>-Clique Instances on a Quantum Computer

Algorithms for triangle finding, the smallest nontrivial instance of the k-clique problem, have been proposed for quantum computers. Still, those algorithms assume the use of fixed access time quantum RAM. In this article, we present a practical gate-based approach to both the triangle-finding probl...

Full description

Bibliographic Details
Main Authors: Sara Ayman Metwalli, Francois Le Gall, Rodney Van Meter
Format: Article
Language:English
Published: IEEE 2020-01-01
Series:IEEE Transactions on Quantum Engineering
Subjects:
Clique finding
graph algorithm
Grover's algorithm
noisy intermediate scale quantum computing (NISQ)
Online Access:https://ieeexplore.ieee.org/document/9298960/

Internet

https://ieeexplore.ieee.org/document/9298960/

Similar Items