Spectral Gap Optimization for Enhanced Adiabatic State Preparation

• URL: http://arxiv.org/abs/2409.15433v1
• Date: Mon, 23 Sep 2024 18:00:32 GMT
• Title: Spectral Gap Optimization for Enhanced Adiabatic State Preparation
• Authors: Kshiti Sneh Rai, Jin-Fu Chen, Patrick Emonts, Jordi Tura,
• Abstract summary: We propose an efficient method to adiabatically prepare tensor networks states (TNSs) We demonstrate this efficient adiabatic algorithm for preparing TNS, through examples of random TNS in one dimension, AKLT, and GHZ states.
• Score: 1.7538636226734583
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The preparation of non-trivial states is crucial to the study of quantum many-body physics. Such states can be prepared with adiabatic quantum algorithms, which are restricted by the minimum spectral gap along the path. In this letter, we propose an efficient method to adiabatically prepare tensor networks states (TNSs). We maximize the spectral gap leveraging degrees of freedom in the parent Hamiltonian construction. We demonstrate this efficient adiabatic algorithm for preparing TNS, through examples of random TNS in one dimension, AKLT, and GHZ states. The Hamiltonian optimization applies to both injective and non-injective tensors, in the latter case by exploiting symmetries present in the tensors.

Related papers

• Optimizing random local Hamiltonians by dissipation [44.99833362998488]
  We prove that a simplified quantum Gibbs sampling algorithm achieves a $Omega(frac1k)$-fraction approximation of the optimum. Our results suggest that finding low-energy states for sparsified (quasi)local spin and fermionic models is quantumly easy but classically nontrivial.
  arXiv  Detail & Related papers  (2024-11-04T20:21:16Z)
• Fourier Neural Operators for Learning Dynamics in Quantum Spin Systems [77.88054335119074]
  We use FNOs to model the evolution of random quantum spin systems. We apply FNOs to a compact set of Hamiltonian observables instead of the entire $2n$ quantum wavefunction.
  arXiv  Detail & Related papers  (2024-09-05T07:18:09Z)
• D4FT: A Deep Learning Approach to Kohn-Sham Density Functional Theory [79.50644650795012]
  We propose a deep learning approach to solve Kohn-Sham Density Functional Theory (KS-DFT) We prove that such an approach has the same expressivity as the SCF method, yet reduces the computational complexity. In addition, we show that our approach enables us to explore more complex neural-based wave functions.
  arXiv  Detail & Related papers  (2023-03-01T10:38:10Z)
• Sparse random Hamiltonians are quantumly easy [105.6788971265845]
  A candidate application for quantum computers is to simulate the low-temperature properties of quantum systems. This paper shows that, for most random Hamiltonians, the maximally mixed state is a sufficiently good trial state. Phase estimation efficiently prepares states with energy arbitrarily close to the ground energy.
  arXiv  Detail & Related papers  (2023-02-07T10:57:36Z)
• Efficient Adiabatic Preparation of Tensor Network States [0.3683202928838613]
  We propose and study a specific adiabatic path to prepare those tensor network states that are unique ground states of few-body parent Hamiltonians in finite lattices. This path guarantees a gap for finite systems and allows for efficient numerical simulation.
  arXiv  Detail & Related papers  (2022-09-02T18:17:55Z)
• Twisted hybrid algorithms for combinatorial optimization [68.8204255655161]
  Proposed hybrid algorithms encode a cost function into a problem Hamiltonian and optimize its energy by varying over a set of states with low circuit complexity. We show that for levels $p=2,ldots, 6$, the level $p$ can be reduced by one while roughly maintaining the expected approximation ratio.
  arXiv  Detail & Related papers  (2022-03-01T19:47:16Z)
• Adiabatic Spectroscopy and a Variational Quantum Adiabatic Algorithm [0.7734726150561088]
  We propose a method to obtain information about the spectral profile of the adiabatic evolution. We present the concept of a variational quantum adiabatic algorithm (VQAA) for optimized adiabatic paths.
  arXiv  Detail & Related papers  (2021-03-01T19:00:00Z)
• Efficient construction of tensor-network representations of many-body Gaussian states [59.94347858883343]
  We present a procedure to construct tensor-network representations of many-body Gaussian states efficiently and with a controllable error. These states include the ground and thermal states of bosonic and fermionic quadratic Hamiltonians, which are essential in the study of quantum many-body systems.
  arXiv  Detail & Related papers  (2020-08-12T11:30:23Z)
• Riemannian optimization of isometric tensor networks [0.0]
  We show how gradient-based optimization methods can be used to optimize tensor networks of isometries to represent e.g. ground states of 1D quantum Hamiltonians. We apply these methods in the context of infinite MPS and MERA, and show benchmark results in which they outperform the best previously-known optimization methods.
  arXiv  Detail & Related papers  (2020-07-07T17:19:05Z)
• Controllable Orthogonalization in Training DNNs [96.1365404059924]
  Orthogonality is widely used for training deep neural networks (DNNs) due to its ability to maintain all singular values of the Jacobian close to 1. This paper proposes a computationally efficient and numerically stable orthogonalization method using Newton's iteration (ONI) We show that our method improves the performance of image classification networks by effectively controlling the orthogonality to provide an optimal tradeoff between optimization benefits and representational capacity reduction. We also show that ONI stabilizes the training of generative adversarial networks (GANs) by maintaining the Lipschitz continuity of a network, similar to spectral normalization (
  arXiv  Detail & Related papers  (2020-04-02T10:14:27Z)

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.