Quantum-assisted rendezvous on graphs: explicit algorithms and quantum computer simulations

Joshua Tucker; Paul Strange; Piotr Andrzej Mironowicz; Jorge Quintanilla

doi:10.1088/1367-2630/ad78f8

Quantum-assisted rendezvous on graphs: explicit algorithms and quantum computer simulations

Abstract

We study quantum advantage in one-step rendezvous games on simple graphs analytically, numerically, and using noisy intermediate-scale quantum (NISQ) processors. Our protocols realise the recently discovered (Mironowicz 2023 New J. Phys. 25 013023) optimal bounds for small cycle graphs and cubic graphs. In the case of cycle graphs, we generalise the protocols to arbitrary graph size. The NISQ processor experiments realise the expected quantum advantage with high accuracy for rendezvous on the complete graph K3. In contrast, for the graph , formed by two disconnected 4-vertex complete graphs, the performance of the NISQ hardware is sub-classical, consistent with the deeper circuit and known qubit decoherence and gate error rates.

Citations

0

CrossRef
0

Web of Science
0

Scopus

Authors (4)

Joshua Tucker
- University of Kent
Paul Strange
- University of Kent
Piotr Andrzej Mironowicz (formerly: Piotr Mironowicz) dr inż.
Jorge Quintanilla
- University of Kent

Cite as

Full text

full text is not available in portal

full content of the article see on external site open in new tab

Keywords

Details

Category:

Articles

Type:

artykuły w czasopismach

Published in:

NEW JOURNAL OF PHYSICS no. 26,
ISSN: 1367-2630

Language:

English

Publication year:

2024

Bibliographic description:

Tucker J., Strange P., Mironowicz P., Quintanilla J.: Quantum-assisted rendezvous on graphs: explicit algorithms and quantum computer simulations// NEW JOURNAL OF PHYSICS -,iss. 26 (2024), s.093038-

DOI: