Reducing circuit depth with qubitwise diagonalization

Abstract

A variety of quantum algorithms employ Pauli operators as a convenient basis for studying the spectrum or evolution of Hamiltonians or measuring multi-body observables. One strategy to reduce circuit depth in such algorithms involves simultaneous diagonalization of Pauli operators generating unitary evolution operators or observables of interest. We propose an algorithm yielding quantum circuits with depths $O(n\log r)$ diagonalizing $n$-qubit operators generated by $r$ Pauli operators. Moreover, as our algorithm iteratively diagonalizes all operators on at least one qubit per step, it is well suited to maintain low circuit depth even on hardware with limited qubit connectivity. We observe that our algorithm performs favorably in producing quantum circuits diagonalizing randomly generated Hamiltonians as well as molecular Hamiltonians with short depths and low two-qubit gate counts.

11 pages, 3 figures

References in corpus (6)

• Array Programming with NumPy
• Experimental Quantum State Tomography of Optical Fields and Ultrafast Statistical Sampling
• Efficient quantum state tomography
• Exact and efficient Lanczos method on a quantum computer
• How many quantum gates do gauge theories require?
• On Subsystem Codes Beating the Hamming or Singleton Bound

Cited by in corpus (1)

• Fuzzy gauge theory for quantum computers