  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 [arXiv:2207.14404]
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 2K4, 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.
