  The development of universal quantum computers has achieved remarkable
success in recent years, culminating with the quantum supremacy reported by
Google. Now is possible to implement short-depth quantum circuits with dozens
of qubits and to obtain results with significant fidelity. Quantum walks are
good candidates to be implemented on the available quantum computers. In this
work, we implement discrete-time quantum walks with one and two interacting
walkers on cycles, two-dimensional lattices, and complete graphs on IBM quantum
computers. We are able to obtain meaningful results using the cycle, the
two-dimensional lattice, and the complete graph with 16 nodes each, which
require 4-qubit quantum circuits up to depth 100.
