Lower bound of the expressibility of ansatzes for Variational Quantum Algorithms
- URL: http://arxiv.org/abs/2311.01330v2
- Date: Wed, 08 Jan 2025 12:12:31 GMT
- Title: Lower bound of the expressibility of ansatzes for Variational Quantum Algorithms
- Authors: Tamojit Ghosh, Arijit Mandal, Shreya Banerjee, Neetik Mukherjee, Prasanta K. Panigrahi,
- Abstract summary: We show that the lower bound of expressibility also plays a crucial role in selecting variational quantum ansatzes.<n>Our analysis reveals that alongside trainability, the lower bound of expressibility also plays a crucial role in selecting variational quantum ansatzes.
- Score: 0.5937476291232802
- 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, i.e., its covering number. The expressibility of a particular ansatz has a well-defined upper bound [1]. In this work, we show that the expressibility 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. Further, we provide numerical analysis to support our claim. By calculating the bond length of hydrogen molecule ($H_2$) using different ansatzes in a variational quantum eigensolver (VQE) setting, we study the variation of equilibrium energy error with circuit depths. We 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 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
- Reducing the sampling complexity of energy estimation in quantum many-body systems using empirical variance information [45.18582668677648]
We consider the problem of estimating the energy of a quantum state preparation for a given Hamiltonian in Pauli decomposition.
We construct an adaptive estimator using the state's actual variance.
arXiv Detail & Related papers (2025-02-03T19:00:01Z) - 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) - Partitioned Quantum Subspace Expansion [0.0]
We present an iterative generalisation of the quantum subspace expansion algorithm used with a Krylov basis.
By exchanging quantum circuit depth for additional measurements the quantum subspace expansion algorithm appears to be an approach suited to near term or early error-corrected quantum hardware.
arXiv Detail & Related papers (2024-03-13T18:00:04Z) - A Lie Algebraic Theory of Barren Plateaus for Deep Parameterized Quantum Circuits [37.84307089310829]
Variational quantum computing schemes train a loss function by sending an initial state through a parametrized quantum circuit.
Despite their promise, the trainability of these algorithms is hindered by barren plateaus.
We present a general Lie algebra that provides an exact expression for the variance of the loss function of sufficiently deep parametrized quantum circuits.
arXiv Detail & Related papers (2023-09-17T18:14:10Z) - The Adjoint Is All You Need: Characterizing Barren Plateaus in Quantum
Ans\"atze [3.2773906224402802]
We formulate a theory of Barren Plateaus for parameterized quantum circuits whose observables lie in their Lie algebra (DLA)
For the first time, our theory provides, for the first time, the ability to compute the variance of the variance of the gradient cost function of the quantum compound ansatz.
arXiv Detail & Related papers (2023-09-14T17:50:04Z) - Noise-aware variational eigensolvers: a dissipative route for lattice gauge theories [40.772310187078475]
We propose a novel variational ansatz for the ground-state preparation of the $mathbbZ$ lattice gauge theory (LGT) in quantum simulators.
It combines dissipative and unitary operations in a completely deterministic scheme with a circuit depth that does not scale with the size of the considered lattice.
We find that, with very few variational parameters, the ansatz can achieve $>!99%$ precision in energy in both the confined and deconfined phase of the $mathbbZ$ LGT.
arXiv Detail & Related papers (2023-08-07T14:23:00Z) - 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) - 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) - Quantum Fluctuation-Response Inequality and Its Application in Quantum
Hypothesis Testing [6.245537312562826]
We find a bound for the mean difference of an observable at two different quantum states.
When the spectrum of the observable is bounded, the sub-Gaussian property is used to link the bound with the sub-Gaussian norm of the observable.
We show the versatility of our results by their applications in problems like thermodynamic inference and speed limit.
arXiv Detail & Related papers (2022-03-20T09:10:54Z) - 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) - Efficient measure for the expressivity of variational quantum algorithms [72.59790225766777]
We exploit an advanced tool in statistical learning theory, i.e., covering number, to study the expressivity of variational quantum algorithms.
We first exhibit how the expressivity of VQAs with an arbitrary ansatze is upper bounded by the number of quantum gates and the measurement observable.
We then explore the expressivity of VQAs on near-term quantum chips, where the system noise is considered.
arXiv Detail & Related papers (2021-04-20T13:51:08Z) - Bernstein-Greene-Kruskal approach for the quantum Vlasov equation [91.3755431537592]
The one-dimensional stationary quantum Vlasov equation is analyzed using the energy as one of the dynamical variables.
In the semiclassical case where quantum tunneling effects are small, an infinite series solution is developed.
arXiv Detail & Related papers (2021-02-18T20:55: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.