Lower bound of the expressibility of ansatzes for Variational Quantum Algorithms

• URL: http://arxiv.org/abs/2311.01330v1
• Date: Thu, 2 Nov 2023 15:41:39 GMT
• Title: Lower bound of the expressibility of ansatzes for Variational Quantum Algorithms
• Authors: Tamojit Ghosh, Arijit Mandal, Shreya Banerjee, Prasanta K. Panighrahi
• Abstract summary: We show that the lower bound of expressibility also plays a crucial role in selecting variational quantum ansatzes. Our analysis reveals that alongside trainability, the lower bound of expressibility also plays a crucial role in selecting variational quantum ansatzes.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The expressibility of an ansatz used in a variational quantum algorithm is defined as the uniformity with which it can explore the space of unitary matrices. The expressibility of a particular ansatz has a well-defined upper bound. In this work, we show that the expressibiliity also has a well-defined lower bound in the hypothesis space. We provide an analytical expression for the lower bound of the covering number, which is directly related to expressibility. We also perform numerical simulations to to support our claim. To numerically calculate the bond length of a diatomic molecule, we take hydrogen ($H_2$) as a prototype system and calculate the error in the energy for the equilibrium energy point for different ansatzes. We study the variation of energy error with circuit depths and show that in each ansatz template, a plateau exists for a range of circuit depths, which we call the set of acceptable points, and the corresponding expressibility is known as the best expressive region. We report that the width of this best expressive region in the hypothesis space is inversely proportional to the average error. Our analysis reveals that alongside trainability, the lower bound of expressibility also plays a crucial role in selecting variational quantum ansatzes.

Related papers

• Characterizing randomness in parameterized quantum circuits through expressibility and average entanglement [39.58317527488534]
  Quantum Circuits (PQCs) are still not fully understood outside the scope of their principal application. We analyse the generation of random states in PQCs under restrictions on the qubits connectivities. We place a connection between how steep is the increase on the uniformity of the distribution of the generated states and the generation of entanglement.
  arXiv  Detail & Related papers  (2024-05-03T17:32:55Z)
• Variational Equations-of-States for Interacting Quantum Hamiltonians [0.0]
  We present variational equations of state (VES) for pure states of an interacting quantum Hamiltonian. VES can be expressed in terms of the variation of the density operators or static correlation functions. We present three nontrivial applications of the VES.
  arXiv  Detail & Related papers  (2023-07-03T07:51:15Z)
• Third quantization of open quantum systems: new dissipative symmetries and connections to phase-space and Keldysh field theory formulations [77.34726150561087]
  We reformulate the technique of third quantization in a way that explicitly connects all three methods. We first show that our formulation reveals a fundamental dissipative symmetry present in all quadratic bosonic or fermionic Lindbladians. For bosons, we then show that the Wigner function and the characteristic function can be thought of as ''wavefunctions'' of the density matrix.
  arXiv  Detail & Related papers  (2023-02-27T18:56:40Z)
• Sandwiched Renyi Relative Entropy in AdS/CFT [0.0]
  We explore the role of sandwiched Renyi relative entropy in AdS/CFT and in finite-dimensional models of holographic quantum error correction. In particular, we discuss a suitable generalization of sandwiched Renyi relative entropy over finite-dimensional von Neumann algebras.
  arXiv  Detail & Related papers  (2022-04-16T01:13:29Z)
• 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)
• Tight Exponential Analysis for Smoothing the Max-Relative Entropy and for Quantum Privacy Amplification [56.61325554836984]
  The max-relative entropy together with its smoothed version is a basic tool in quantum information theory. We derive the exact exponent for the decay of the small modification of the quantum state in smoothing the max-relative entropy based on purified distance.
  arXiv  Detail & Related papers  (2021-11-01T16:35:41Z)
• Bosonic field digitization for quantum computers [62.997667081978825]
  We address the representation of lattice bosonic fields in a discretized field amplitude basis. We develop methods to predict error scaling and present efficient qubit implementation strategies.
  arXiv  Detail & Related papers  (2021-08-24T15:30:04Z)
• Alternative quantisation condition for wavepacket dynamics in a hyperbolic double well [0.0]
  We propose an analytical approach for computing the eigenspectrum and corresponding eigenstates of a hyperbolic double well potential of arbitrary height or width. Considering initial wave packets of different widths and peak locations, we compute autocorrelation functions and quasiprobability distributions.
  arXiv  Detail & Related papers  (2020-09-18T10:29:04Z)
• The variance of relative surprisal as single-shot quantifier [0.0]
  We show that (relative) surprisal gives sufficient conditions for approximate state-transitions between pairs of quantum states in single-shot setting. We further derive a simple and physically appealing axiomatic single-shot characterization of (relative) entropy.
  arXiv  Detail & Related papers  (2020-09-17T16:06:54Z)
• Quantum capacity of bosonic dephasing channel [0.0]
  We study the quantum capacity of continuous variable dephasing channel, which is a notable example of non-Gaussian quantum channel. We consider input energy restriction and show that by increasing it, the capacity saturates to a finite value.
  arXiv  Detail & Related papers  (2020-07-08T04:56:33Z)
• The role of boundary conditions in quantum computations of scattering observables [58.720142291102135]
  Quantum computing may offer the opportunity to simulate strongly-interacting field theories, such as quantum chromodynamics, with physical time evolution. As with present-day calculations, quantum computation strategies still require the restriction to a finite system size. We quantify the volume effects for various $1+1$D Minkowski-signature quantities and show that these can be a significant source of systematic uncertainty.
  arXiv  Detail & Related papers  (2020-07-01T17:43:11Z)

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.