Circuit optimization of Hamiltonian simulation by simultaneous diagonalization of Pauli clusters

• URL: http://arxiv.org/abs/2003.13599v2
• Date: Sat, 5 Sep 2020 23:54:08 GMT
• Title: Circuit optimization of Hamiltonian simulation by simultaneous diagonalization of Pauli clusters
• Authors: Ewout van den Berg, Kristan Temme
• Abstract summary: Quantum circuits for exact time evolution of single Pauli operators are well known, and can be extended trivially to sums of commuting Paulis. In this paper we reduce the circuit complexity of Hamiltonian simulation by partitioning the Pauli operators into mutually commuting clusters. We show that the proposed approach can help to significantly reduce both the number of CNOT operations and circuit depth for Hamiltonians arising in quantum chemistry.
• Score: 1.0587959762260986
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Many applications of practical interest rely on time evolution of Hamiltonians that are given by a sum of Pauli operators. Quantum circuits for exact time evolution of single Pauli operators are well known, and can be extended trivially to sums of commuting Paulis by concatenating the circuits of individual terms. In this paper we reduce the circuit complexity of Hamiltonian simulation by partitioning the Pauli operators into mutually commuting clusters and exponentiating the elements within each cluster after applying simultaneous diagonalization. We provide a practical algorithm for partitioning sets of Paulis into commuting subsets, and show that the proposed approach can help to significantly reduce both the number of CNOT operations and circuit depth for Hamiltonians arising in quantum chemistry. The algorithms for simultaneous diagonalization are also applicable in the context of stabilizer states; in particular we provide novel four- and five-stage representations, each containing only a single stage of conditional gates.

Related papers

• Leveraging commuting groups for an efficient variational Hamiltonian ansatz [2.4094285826152593]
  We introduce a new circuit design using commuting groups within the Hamiltonian. We demonstrate the effectiveness of our method in accurately determining the ground state energy of different quantum chemistry Hamiltonians.
  arXiv  Detail & Related papers  (2023-12-13T20:28:31Z)
• Tridiagonal matrix decomposition for Hamiltonian simulation on a quantum computer [0.0]
  This work is the efficient procedure for representation of a tridiagonal matrix in the Pauli basis. It allows one to construct a Hamiltonian evolution circuit without the use of oracles.
  arXiv  Detail & Related papers  (2023-09-29T20:27:05Z)
• Fast Partitioning of Pauli Strings into Commuting Families for Optimal Expectation Value Measurements of Dense Operators [0.0]
  Pauli strings appearing in the decomposition of an operator can be can be grouped into commuting families. We detail an algorithm to completely partition the full set of Pauli strings acting on any number of qubits into the minimal number of sets of commuting families.
  arXiv  Detail & Related papers  (2023-05-19T17:39:33Z)
• Sampled Transformer for Point Sets [80.66097006145999]
  sparse transformer can reduce the computational complexity of the self-attention layers to $O(n)$, whilst still being a universal approximator of continuous sequence-to-sequence functions. We propose an $O(n)$ complexity sampled transformer that can process point set elements directly without any additional inductive bias.
  arXiv  Detail & Related papers  (2023-02-28T06:38:05Z)
• Iterative Qubit Coupled Cluster using only Clifford circuits [52.77024349608834]
  We draw attention to a variant of the iterative qubit coupled cluster (iQCC) method that only uses Clifford circuits. This method is useful for near-term variational quantum algorithm applications as it generates good initial parameters. It may also be useful beyond the NISQ era to create short-depth Clifford pre-optimized circuits.
  arXiv  Detail & Related papers  (2022-11-18T20:31:10Z)
• Transforming Collections of Pauli Operators into Equivalent Collections of Pauli Operators over Minimal Registers [0.0]
  We prove the obtainable lower-bound for the number of qubits needed to represent such Pauli operations. We provide a procedure for determining such a set of minimal register Pauli operations.
  arXiv  Detail & Related papers  (2022-06-27T04:22:30Z)
• Hardware-Tailored Diagonalization Circuits [0.9187159782788579]
  A central building block of many quantum algorithms is the diagonalization of Pauli operators. We introduce a theoretical framework for constructing hardware-tailored diagonalization circuits.
  arXiv  Detail & Related papers  (2022-03-07T19:00:01Z)
• Numerical Simulations of Noisy Quantum Circuits for Computational Chemistry [51.827942608832025]
  Near-term quantum computers can calculate the ground-state properties of small molecules. We show how the structure of the computational ansatz as well as the errors induced by device noise affect the calculation.
  arXiv  Detail & Related papers  (2021-12-31T16:33:10Z)
• Quantum simulation of $\phi^4$ theories in qudit systems [53.122045119395594]
  We discuss the implementation of quantum algorithms for lattice $Phi4$ theory on circuit quantum electrodynamics (cQED) system. The main advantage of qudit systems is that its multi-level characteristic allows the field interaction to be implemented only with diagonal single-qudit gates.
  arXiv  Detail & Related papers  (2021-08-30T16:30:33Z)
• Algebraic Compression of Quantum Circuits for Hamiltonian Evolution [52.77024349608834]
  Unitary evolution under a time dependent Hamiltonian is a key component of simulation on quantum hardware. We present an algorithm that compresses the Trotter steps into a single block of quantum gates. This results in a fixed depth time evolution for certain classes of Hamiltonians.
  arXiv  Detail & Related papers  (2021-08-06T19:38:01Z)
• A Generic Compilation Strategy for the Unitary Coupled Cluster Ansatz [68.8204255655161]
  We describe a compilation strategy for Variational Quantum Eigensolver (VQE) algorithms. We use the Unitary Coupled Cluster (UCC) ansatz to reduce circuit depth and gate count.
  arXiv  Detail & Related papers  (2020-07-20T22:26:16Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.