Reducing circuit depth with qubitwise diagonalization
arXiv:2306.00170 · doi:10.1103/PhysRevA.108.062414
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 diagonalizing -qubit operators generated by 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.
arXiv comment11 pages, 3 figures
References in corpus (17)
- Array Programming with NumPy
- A variational eigenvalue solver on a quantum processor
- On the Measurement of Qubits
- Improved Simulation of Stabilizer Circuits
- Fermionic quantum computation
- Experimental Quantum State Tomography of Optical Fields and Ultrafast Statistical Sampling
- Unknown Quantum States and Operations, a Bayesian View
- Efficient quantum state tomography
- Simulation of Electronic Structure Hamiltonians Using Quantum Computers
- Efficient quantum measurement of Pauli operators in the presence of finite sampling error
- Quantum Circuits with Unbounded Fan-out
- Exact and efficient Lanczos method on a quantum computer
- How to efficiently select an arbitrary Clifford group element
- Circuit optimization of Hamiltonian simulation by simultaneous diagonalization of Pauli clusters
- Information-theoretic interpretation of quantum error-correcting codes
- How many quantum gates do gauge theories require?
- On Subsystem Codes Beating the Hamming or Singleton Bound