Hierarchical Clifford transformations to reduce entanglement in quantum chemistry wavefunctions

• URL: http://arxiv.org/abs/2301.07726v1
• Date: Wed, 18 Jan 2023 19:00:08 GMT
• Title: Hierarchical Clifford transformations to reduce entanglement in quantum chemistry wavefunctions
• Abstract summary: We present efficiently computable Clifford similarity transformations for quantum chemistry Hamiltonians. These transformations are constructed via block diagonalization of a hierarchy of truncated molecular Hamiltonians. We show that the bases introduced here allow for more efficient classical and quantum computation of ground state properties.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The performance of computational methods for many-body physics and chemistry is strongly dependent on the choice of basis used to cast the problem; hence, the search for better bases and similarity transformations is important for progress in the field. So far, tools from theoretical quantum information have been not thoroughly explored for this task. Here we take a step in this direction by presenting efficiently computable Clifford similarity transformations for quantum chemistry Hamiltonians, which expose bases with reduced entanglement in the corresponding molecular ground states. These transformations are constructed via block diagonalization of a hierarchy of truncated molecular Hamiltonians, preserving the full spectrum of the original problem. We show that the bases introduced here allow for more efficient classical and quantum computation of ground state properties. First, we find a systematic reduction of bipartite entanglement in molecular ground states as compared to standard problem representations. This entanglement reduction has implications in classical numerical methods such as ones based on the density matrix renormalization group. Then, we develop variational quantum algorithms that exploit the structure in the new bases, showing again improved results when the hierarchical Clifford transformations are used.

Related papers

• Clifford disentanglers for entanglement reduction in molecular electronic structure simulations [10.116379687096314]
  Entanglement is a key bottleneck limiting the efficiency of quantum simulations of molecular electronic structures.<n>We extend Clifford disentanglers as a structure-preserving approach to entanglement reduction.<n>We show that Clifford disentanglers can also benefit quantum simulations such as the shallow-circuit variational quantum eigensolver calculations.
  arXiv  Detail & Related papers  (2026-06-10T13:22:04Z)
• A Quantum Spectral Framework for Solving PDEs [0.0]
  Partial differential equations (PDEs) are fundamental across numerous scientific fields.<n>Attempts to solve this problem typically rely on either classical sparsity and low-rank decompositions.<n>Quantum Computing offers a promising alternative, as it allows us to operate in significantly larger spaces.
  arXiv  Detail & Related papers  (2026-04-28T16:33:59Z)
• When Less is More: Approximating the Quantum Geometric Tensor with Block Structures [43.39839287869652]
  We introduce a block-diagonal quantum geometric tensor that partitions the metric by network layers, analogous to block-structured Fisher methods such as K-FAC.<n> Experiments on Heisenberg and frustrated $J_1$-$J$ models show faster convergence, lower energy, and improved stability.
  arXiv  Detail & Related papers  (2025-10-09T16:44:30Z)
• Quantum Simulations of Chemistry in First Quantization with any Basis Set [0.0]
  Quantum computation of the energy of molecules and materials is one of the most promising applications of fault-tolerant quantum computers. Previous work has mainly represented the Hamiltonian of the system in second quantization. We present a method to solve the generic ground-state chemistry problem in first quantization on a fault-tolerant quantum computer using any basis set. This allows for calculations in the active space using modern quantum chemistry basis sets.
  arXiv  Detail & Related papers  (2024-08-06T12:40:32Z)
• 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)
• Partitioning Quantum Chemistry Simulations with Clifford Circuits [1.0286890995028481]
  Current quantum computing hardware is restricted by the availability of only few, noisy qubits. We investigate the limits of their classical and near-classical treatment while staying within the framework of quantum circuits.
  arXiv  Detail & Related papers  (2023-03-02T13:05:19Z)
• Universality of critical dynamics with finite entanglement [68.8204255655161]
  We study how low-energy dynamics of quantum systems near criticality are modified by finite entanglement. Our result establishes the precise role played by entanglement in time-dependent critical phenomena.
  arXiv  Detail & Related papers  (2023-01-23T19:23:54Z)
• The Quantum Path Kernel: a Generalized Quantum Neural Tangent Kernel for Deep Quantum Machine Learning [52.77024349608834]
  Building a quantum analog of classical deep neural networks represents a fundamental challenge in quantum computing. Key issue is how to address the inherent non-linearity of classical deep learning. We introduce the Quantum Path Kernel, a formulation of quantum machine learning capable of replicating those aspects of deep machine learning.
  arXiv  Detail & Related papers  (2022-12-22T16:06:24Z)
• Efficient Quantum Analytic Nuclear Gradients with Double Factorization [0.0]
  We report a Lagrangian-based approach for evaluating relaxed one- and two-particle reduced density matrices from double factorized Hamiltonians. We demonstrate the accuracy and feasibility of our Lagrangian-based approach to recover all off-diagonal density matrix elements in classically-simulated examples.
  arXiv  Detail & Related papers  (2022-07-26T18:47:48Z)
• Near-term quantum algorithm for computing molecular and materials properties based on recursive variational series methods [44.99833362998488]
  We propose a quantum algorithm to estimate the properties of molecules using near-term quantum devices. We test our method by computing the one-particle Green's function in the energy domain and the autocorrelation function in the time domain.
  arXiv  Detail & Related papers  (2022-06-20T16:33:23Z)
• 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)
• Engineering analog quantum chemistry Hamiltonians using cold atoms in optical lattices [69.50862982117127]
  We benchmark the working conditions of the numerically analog simulator and find less demanding experimental setups. We also provide a deeper understanding of the errors of the simulation appearing due to discretization and finite size effects.
  arXiv  Detail & Related papers  (2020-11-28T11:23:06Z)
• Benchmarking adaptive variational quantum eigensolvers [63.277656713454284]
  We benchmark the accuracy of VQE and ADAPT-VQE to calculate the electronic ground states and potential energy curves. We find both methods provide good estimates of the energy and ground state. gradient-based optimization is more economical and delivers superior performance than analogous simulations carried out with gradient-frees.
  arXiv  Detail & Related papers  (2020-11-02T19:52:04Z)
• A posteriori corrections to the Iterative Qubit Coupled Cluster method to minimize the use of quantum resources in large-scale calculations [0.0]
  We present a variety of a posteriori corrections to the iQCC energies to reduce the number of iterations to achieve the desired accuracy. We demonstrate the utility and efficiency of our approach numerically on the examples of 10-qubit N$$ molecule, the 24-qubit H$$O stretch, and 56-qubit singlet-triplet gap calculations.
  arXiv  Detail & Related papers  (2020-09-28T20:57:32Z)
• Sparse-Hamiltonian approach to the time evolution of molecules on quantum computers [0.0]
  We explore the possibility of mapping the molecular problem onto a sparse Hubbard-like Hamiltonian. This allows a Green's-function-based approach to electronic structure via a hybrid quantum-classical algorithm.
  arXiv  Detail & Related papers  (2020-09-26T20:32:06Z)

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.