Quantum walks, the quantum analogue of the classical random walk, have been shown to underpin quantum algorithms for fluid dynamics. We propose the quantum half-adder gate method for quantum walks as a good benchmark algorithm, specifically to compare native two-qubit gate and native multiqubit gate implementations. Neutral atom hardware is a promising choice of platform for implementing quantum walks due to its ability to implement native multiqubit (>2-qubit) gates and to dynamically re-arrange qubits. Using detailed realistic error modelling for multiqubit Rydberg gates via two-photon adiabatic rapid passage, we present the gate sequences and predicted final state fidelities for some small one dimensional quantum walks, including lazy quantum walks; lazy quantum walks include a rest state, which is needed for quantum walks for fluid simulation. Our simulations pinpoint the sweet spot where native multiqubit gates provide an advantage compared with decomposing the gate into multiple smaller higher fidelity gates.
Non-local higher-energy auxiliary states have been successfully used to entangle pairs of qubits in different quantum computing systems. Typically a longer-span non-local state or sequential application of few-qubit entangling gates are needed to produce a non-trivial multiqubit gate. In many cases a single non-local state that span over the entire system is difficult to use due to spectral crowding or impossible to have. At the same time, many multiqubit systems can naturally develop a network of multiple nonlocal higher-energy states that span over few qubits each. We show that continuous time quantum walks can be used to address this problem by involving multiple such states to perform local and entangling operations concurrently on many qubits. This introduces an alternative approach to multiqubit gate compression based on available physical resources. We formulate general requirements for such walks and discuss configurations of non-local auxiliary states that can emerge in quantum computing architectures based on self-assembled quantum dots, defects in diamond, and superconducting qubits, as examples. Specifically, we discuss a scalable multiqubit quantum register constructed as a single chain with nearest-neighbor interactions. We illustrate how quantum walks can be configured to perform single-, two- and three-qubit gates, including Hadamard, Control-NOT, and Toffoli gates. Continuous time quantum walks on graphs involved in these gates are investigated.
It was recently shown that continuous-time quantum walks on dynamic graphs, i.e., sequences of static graphs whose edges change at specific times, can implement a universal set of quantum gates. This result treated all isolated vertices as having self-loops, so they all evolved by a phase under the quantum walk. In this paper, we permit isolated vertices to be loopless or looped, and loopless isolated vertices do not evolve at all under the quantum walk. Using this distinction, we construct simpler dynamic graphs that implement the Pauli gates and a set of universal quantum gates consisting of the Hadamard,
T, and controlled-not gates, and these gates are easily extended to multiqubit systems. For example, the
T gate is simplified from a sequence of six graphs to a single graph, and the number of vertices is reduced by a factor of 4. We also construct a generalized phase gate, of which
Z,
S, and
T are specific instances. Finally, we validate our implementations by numerically simulating a quantum circuit consisting of layers of one- and two-qubit gates, similar to those in recent quantum supremacy experiments, using a quantum walk.