Compressing Many-Body Fermion Operators Under Unitary Constraints

• URL: http://arxiv.org/abs/2109.05010v1
• Date: Fri, 10 Sep 2021 17:42:18 GMT
• Title: Compressing Many-Body Fermion Operators Under Unitary Constraints
• Authors: Nicholas C. Rubin, Joonho Lee, Ryan Babbush
• Abstract summary: We introduce a numerical algorithm for performing factorization that has an complexity no worse than single particle basis transformations of the two-body operators. As an application of this numerical procedure, we demonstrate that our protocol can be used to approximate generic unitary coupled cluster operators.
• Score: 0.6445605125467573
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The most efficient known quantum circuits for preparing unitary coupled cluster states and applying Trotter steps of the arbitrary basis electronic structure Hamiltonian involve interleaved sequences of fermionic Gaussian circuits and Ising interaction type circuits. These circuits arise from factorizing the two-body operators generating those unitaries as a sum of squared one-body operators that are simulated using product formulas. We introduce a numerical algorithm for performing this factorization that has an iteration complexity no worse than single particle basis transformations of the two-body operators and often results in many times fewer squared one-body operators in the sum of squares compared to the analytical decompositions. As an application of this numerical procedure, we demonstrate that our protocol can be used to approximate generic unitary coupled cluster operators and prepare the necessary high-quality initial states for techniques (like ADAPT-VQE) that iteratively construct approximations to the ground state.

Related papers

• Imposing Constraints on Driver Hamiltonians and Mixing Operators: From Theory to Practical Implementation [0.0]
  We give general expressions for finding Hamiltonian terms that satisfy constraint subsets and use these to give complexity characterizations of the related problems. We then give algorithmic procedures to turn these primitives into Hamiltonian drivers and unitary mixers that can be used for Constrained Quantum Anneal Operator Ansatz (CQA) and Quantum Alternating Operator Ansatz (QAOA) We empirically benchmark these approaches on instances sized between 12 and 22, showing the best relative performance for the tailored ansaetze and that exponential curve fits on the results are consistent with a quadratic speedup by utilizing alternative ansaetze to the
  arXiv  Detail & Related papers  (2024-07-02T06:23:02Z)
• Unified framework for efficiently computable quantum circuits [0.0]
  Quantum circuits consisting of Clifford and matchgates are two classes of circuits that are known to be efficiently simulatable on a classical computer. We introduce a unified framework that shows in a transparent way the special structure that allows these circuits can be efficiently simulatable.
  arXiv  Detail & Related papers  (2024-01-16T08:04:28Z)
• Tractable Bounding of Counterfactual Queries by Knowledge Compilation [51.47174989680976]
  We discuss the problem of bounding partially identifiable queries, such as counterfactuals, in Pearlian structural causal models. A recently proposed iterated EM scheme yields an inner approximation of those bounds by sampling the initialisation parameters. We show how a single symbolic knowledge compilation allows us to obtain the circuit structure with symbolic parameters to be replaced by their actual values.
  arXiv  Detail & Related papers  (2023-10-05T07:10:40Z)
• Supersymmetric Quantum Mechanics of Hypergeometric-like Differential Operators [0.0]
  Systematic iterative algorithms of supersymmetric quantum mechanics (SUSYQM) type for solving the eigenequation of principal hypergeometric-like differential operator (HLDO) These algorithms provide a simple SUSYQM answer to the question regarding why there exist simultaneously a series of principal as well as associated eigenfunctions for the same HLDO. Due to their relatively high efficiency, algebraic elementariness and logical independence, the iterative SUSYQM algorithms developed in this paper could become the hopefuls for supplanting some traditional methods for solving the eigenvalue problems of principal HLDOs and their associated cousins.
  arXiv  Detail & Related papers  (2023-07-29T09:59:54Z)
• Efficient application of the factorized form of the unitary coupled-cluster ansatz for the variational quantum eigensolver algorithm by using linear combination of unitaries [0.0]
  The variational quantum eigensolver is one of the most promising algorithms for near-term quantum computers. It has the potential to solve quantum chemistry problems involving strongly correlated electrons.
  arXiv  Detail & Related papers  (2023-02-17T04:03:06Z)
• The tilted CHSH games: an operator algebraic classification [77.34726150561087]
  This article introduces a general systematic procedure for solving any binary-input binary-output game. We then illustrate on the prominent class of tilted CHSH games. We derive for those an entire characterisation on the region exhibiting some quantum advantage.
  arXiv  Detail & Related papers  (2023-02-16T18:33:59Z)
• Operator relationship between conventional coupled cluster and unitary coupled cluster [0.0]
  We show how one can use the operator manipulations given by the exponential disentangling identity and the Hadamard lemma to relate the factorized form of the unitary coupled-cluster approximation to a factorized form of the conventional coupled cluster approximation. This approach is daunting to carry out by hand, but can be automated on a computer for small enough systems.
  arXiv  Detail & Related papers  (2022-01-28T01:30:53Z)
• 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)
• Relevant OTOC operators: footprints of the classical dynamics [68.8204255655161]
  The OTOC-RE theorem relates the OTOCs summed over a complete base of operators to the second Renyi entropy. We show that the sum over a small set of relevant operators, is enough in order to obtain a very good approximation for the entropy. In turn, this provides with an alternative natural indicator of complexity, i.e. the scaling of the number of relevant operators with time.
  arXiv  Detail & Related papers  (2020-07-31T19:23:26Z)
• Models of zero-range interaction for the bosonic trimer at unitarity [91.3755431537592]
  We present the construction of quantum Hamiltonians for a three-body system consisting of identical bosons mutually coupled by a two-body interaction of zero range. For a large part of the presentation, infinite scattering length will be considered.
  arXiv  Detail & Related papers  (2020-06-03T17:54:43Z)
• Efficient classical simulation of random shallow 2D quantum circuits [104.50546079040298]
  Random quantum circuits are commonly viewed as hard to simulate classically. We show that approximate simulation of typical instances is almost as hard as exact simulation. We also conjecture that sufficiently shallow random circuits are efficiently simulable more generally.
  arXiv  Detail & Related papers  (2019-12-31T19:00:00Z)

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.