Acceleration of Quantum Algorithm with Multi-qubit Gates

Jiaan Qi, Zhihai Liu, H. Q. Xu

Abstract The prospect of large-scale quantum computation with an integrated chip of spin qubits is imminent as technology improves. This invites us to think beyond the traditional two-qubit-gate framework and consider a naturally supported ‘instruction set’ of multi-qubit gates. In this work, we systematically study such a family of multi-qubit gates implementable over an array of quantum dots by DC evolution. A useful representation of the computational Hamiltonian is proposed for a dot-array with strong spin–orbit coupling effects, distinctive g -factor tensors and varying interdot couplings. Adopting a perturbative treatment, we model a multi-qubit DC gate by the first-order dynamics in the qubit frame and develop a detailed formalism for decomposing the resulting gate, estimating and optimizing the coherent gate errors with appropriate local phase shifts for arbitrary array connectivity. Examples of such multi-qubit gates and their applications in quantum error correction and quantum algorithms are also explored, demonstrating their potential advantage in accelerating complex tasks and reducing overall errors.

Samuel L. Braunstein, Arun Kumar Pati

Pascal Baßler, Markus Heinrich, Martin Kliesch

Multi-qubit entangling interactions arise naturally in several quantum computing platforms and promise advantages over traditional two-qubit gates. In particular, a fixed multi-qubit Ising-type interaction together with single-qubit X-gates can be used to synthesize global ZZ-gates (GZZ gates). In this work, we first show that the synthesis of such quantum gates that are time-optimal is NP-hard. Second, we provide explicit constructions of special time-optimal multi-qubit gates. They have constant gate times and can be implemented with linearly many X-gate layers. Third, we develop a heuristic algorithm with polynomial runtime for synthesizing fast multi-qubit gates. Fourth, we derive lower and upper bounds on the optimal GZZ gate-time. Based on explicit constructions of GZZ gates and numerical studies, we conjecture that any GZZ gate can be executed in a time O( n ) for n qubits. Our heuristic synthesis algorithm leads to GZZ gate-times with a similar scaling, which is optimal in this sense. We expect that our efficient synthesis of fast multi-qubit gates allows for faster and, hence, also more error-robust execution of quantum algorithms.

Lewis, Dylan, Roeland Wiersema, Juan Carrasquilla +1 more

Larger multi-qubit quantum gates allow shallower, more efficient quantum circuits, which could decrease the prohibitive effect of noise on algorithms for noisy intermediate-scale quantum (NISQ) devices and fault-tolerant error correction schemes. Such multi-qubit gates can potentially be generated by time-independent Hamiltonians comprising only physical (one- and two-local) interaction terms. Here, we present an algorithm that finds the time-independent Hamiltonian for a target quantum gate on $n$ qubits by using the geodesic on the Riemannian manifold of $\mathrm{SU}(2^n)$. Differential programming is used to determine how the Hamiltonian should be updated in order to follow the geodesic to the target unitary as closely as possible. We show that our geodesic algorithm outperforms gradient descent methods for standard multi-qubit gates such as Toffoli and Fredkin. The geodesic algorithm is then used to find previously unavailable multi-qubit gates implementing high fidelity parity checks, which could be used in a wide array of quantum codes and increase the clock speed of fault-tolerant quantum computers. The geodesic algorithm is demonstrated on an example relevant to current experimental hardware, illustrating a circuit speed up.

Mario Mastriani