Optimally generating $\mathfrak{su}(2^N)$ using Pauli strings

Abstract

Any quantum computation consists of a sequence of unitary evolutions described by a finite set of Hamiltonians. When this set is taken to consist of only products of Pauli operators, we show that the minimal such set generating $\mathfrak{su}(2^N)$ contains $2N+1$ elements. We provide a number of examples of such generating sets and furthermore provide an algorithm for producing a sequence of rotations corresponding to any given Pauli rotation, which is shown to have optimal complexity. We also observe that certain sets generate $\mathfrak{su}(2^N)$ at a faster rate than others, and we show how this rate can be optimized by tuning the fraction of anticommuting pairs of generators. Finally, we briefly comment on implications for measurement-based and trapped ion quantum computation as well as the construction of fault-tolerant gate sets.

6+14 pages, v3: close to published version, additional results and updated appendix; v2: additional example, minor edits throughout

References in corpus (7)

• Topological Quantum Distillation
• The cost of universality: A comparative study of the overhead of state distillation and code switching with color codes
• $N$-body interactions between trapped ion qubits via spin-dependent squeezing
• Classification of dynamical Lie algebras for translation-invariant 2-local spin systems in one dimension
• Universal measurement-based quantum computation in a one-dimensional architecture enabled by dual-unitary circuits
• Parity Quantum Computing as YZ-Plane Measurement-Based Quantum Computing
• Measurement-based quantum computation from Clifford quantum cellular automata

Cited by in corpus (2)

• Minimally Universal Parity Quantum Computing
• Sub-Riemannian geometry of measurement based quantum computation