Majorana Tensor Decomposition: A unifying framework for decompositions of fermionic Hamiltonians to Linear Combination of Unitaries

• URL: http://arxiv.org/abs/2407.06571v3
• Date: Tue, 15 Oct 2024 00:56:52 GMT
• Title: Majorana Tensor Decomposition: A unifying framework for decompositions of fermionic Hamiltonians to Linear Combination of Unitaries
• Authors: Ignacio Loaiza, Aritra Sankar Brahmachari, Artur F. Izmaylov,
• Abstract summary: Linear combination of unitaries (LCU) decompositions have appeared as one of the main tools for encoding operators on quantum computers. In particular, LCU approaches present a way of encoding information from the electronic structure Hamiltonian into a quantum circuit. Here we present the Majorana Decomposition (MTD), a framework that unifies existing LCUs and offers novel decomposition methods.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Linear combination of unitaries (LCU) decompositions have appeared as one of the main tools for encoding operators on quantum computers, allowing efficient implementations of arbitrary operators. In particular, LCU approaches present a way of encoding information from the electronic structure Hamiltonian into a quantum circuit. Over the past years, many different decomposition techniques have appeared for the electronic structure Hamiltonian. Here we present the Majorana Tensor Decomposition (MTD), a framework that unifies existing LCUs and offers novel decomposition methods by using popular low-rank tensor factorizations.

Related papers

• Optimal Symbolic Construction of Matrix Product Operators and Tree Tensor Network Operators [0.0]
  This research introduces an improved framework for constructing matrix product operators (MPOs) and tree tensor network operators (TTNOs) A given (Hamiltonian) operator typically has a known symbolic "sum of operator strings" form that can be translated into a tensor network structure.
  arXiv  Detail & Related papers  (2025-02-25T20:33:30Z)
• Gate Efficient Composition of Hamiltonian Simulation and Block-Encoding with its Application on HUBO, Fermion Second-Quantization Operators and Finite Difference Method [0.0]
  This article proposes a simple formalism which unifies Hamiltonian simulation techniques from different fields. It leads to a gate decomposition and a scaling different from the usual strategy. It can significantly reduce the quantum circuit number of rotational gates, multi-qubit gates, and the circuit depth.
  arXiv  Detail & Related papers  (2024-10-24T12:26:50Z)
• Explicit gate construction of block-encoding for Hamiltonians needed for simulating partial differential equations [0.6144680854063939]
  This paper introduces an efficient quantum protocol for the explicit construction of block-encoding for an important class of Hamiltonians. The proposed algorithm exhibits scaling with respect to the spatial size, suggesting an exponential speedup over classical finite-difference methods.
  arXiv  Detail & Related papers  (2024-05-21T15:13:02Z)
• Mapping Molecular Hamiltonians into Hamiltonians of Modular cQED Processors [50.893896302254944]
  We introduce a general method to map the Hamiltonian of an arbitrary model system into the Hamiltonian of a circuit Quantum Electrodynamics (cQED) processor. The method is illustrated as applied to quantum dynamics simulations of the Fenna-Matthews-Olson complex and the spin-boson model of charge transfer.
  arXiv  Detail & Related papers  (2023-06-10T04:52:58Z)
• A hybrid quantum-classical algorithm for multichannel quantum scattering of atoms and molecules [62.997667081978825]
  We propose a hybrid quantum-classical algorithm for solving the Schr"odinger equation for atomic and molecular collisions. The algorithm is based on the $S$-matrix version of the Kohn variational principle, which computes the fundamental scattering $S$-matrix. We show how the algorithm could be scaled up to simulate collisions of large polyatomic molecules.
  arXiv  Detail & Related papers  (2023-04-12T18:10:47Z)
• Reducing molecular electronic Hamiltonian simulation cost for Linear Combination of Unitaries approaches [0.18374319565577155]
  We consider different Linear Combination of Unitaries (LCU) decompositions for molecular electronic structure Hamiltonians. The main figure of merit is the 1-norm of their coefficients, which is associated with the quantum circuit complexity.
  arXiv  Detail & Related papers  (2022-08-17T13:08:05Z)
• 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)
• Geometric Transformer for End-to-End Molecule Properties Prediction [92.28929858529679]
  We introduce a Transformer-based architecture for molecule property prediction, which is able to capture the geometry of the molecule. We modify the classical positional encoder by an initial encoding of the molecule geometry, as well as a learned gated self-attention mechanism.
  arXiv  Detail & Related papers  (2021-10-26T14:14:40Z)
• 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)
• Counteracting dephasing in Molecular Nanomagnets by optimized qudit encodings [60.1389381016626]
  Molecular Nanomagnets may enable the implementation of qudit-based quantum error-correction codes. A microscopic understanding of the errors corrupting the quantum information encoded in a molecular qudit is essential.
  arXiv  Detail & Related papers  (2021-03-16T19:21:42Z)
• Expressibility of comb tensor network states (CTNS) for the P-cluster and the FeMo-cofactor of nitrogenase [0.0]
  Polynuclear transition metal complexes such as the P-cluster and the FeMo-cofactor of nitrogenase represent a great challenge for current electronic structure methods. We initiated the use of comb tensor network states (CTNS) as a many-body wavefunction ansatz to tackle these challenging systems. We presented an algorithm to express a configuration interaction (CI) wavefunction into CTNS based on the Schmidt decomposition.
  arXiv  Detail & Related papers  (2020-09-26T11:39:12Z)
• Quantum Algorithm for a Convergent Series of Approximations towards the Exact Solution of the Lowest Eigenstates of a Hamiltonian [1.8895156959295205]
  We present quantum algorithms for Hamiltonians of linear combinations of local unitary operators. The algorithms implement a convergent series of approximations towards the exact solution of the full CI (configuration interaction) problem.
  arXiv  Detail & Related papers  (2020-09-08T06:16:07Z)

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.