Information flow in parameterized quantum circuits
- URL: http://arxiv.org/abs/2207.05149v1
- Date: Mon, 11 Jul 2022 19:30:47 GMT
- Title: Information flow in parameterized quantum circuits
- Authors: Abhinav Anand, Lasse Bj{\o}rn Kristensen, Felix Frohnert, Sukin Sim
and Al\'an Aspuru-Guzik
- Abstract summary: We introduce a new way to quantify information flow in quantum systems.
We propose a new distance metric using the mutual information between gate nodes.
We then present an optimization procedure for variational algorithms using paths based on the distance measure.
- Score: 0.4893345190925177
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: In this work, we introduce a new way to quantify information flow in quantum
systems, especially for parameterized quantum circuits. We use a graph
representation of the circuits and propose a new distance metric using the
mutual information between gate nodes. We then present an optimization
procedure for variational algorithms using paths based on the distance measure.
We explore the features of the algorithm by means of the variational quantum
eigensolver, in which we compute the ground state energies of the Heisenberg
model. In addition, we employ the method to solve a binary classification
problem using variational quantum classification. From numerical simulations,
we show that our method can be successfully used for optimizing the
parameterized quantum circuits primarily used in near-term algorithms. We
further note that information-flow based paths can be used to improve
convergence of existing stochastic gradient based methods.
Related papers
- Quantum Natural Stochastic Pairwise Coordinate Descent [6.187270874122921]
Quantum machine learning through variational quantum algorithms (VQAs) has gained substantial attention in recent years.
This paper introduces the quantum natural pairwise coordinate descent (2QNSCD) optimization method.
We develop a highly sparse unbiased estimator of the novel metric tensor using a quantum circuit with gate complexity $Theta(1)$ times that of the parameterized quantum circuit and single-shot quantum measurements.
arXiv Detail & Related papers (2024-07-18T18:57:29Z) - Parsimonious Optimisation of Parameters in Variational Quantum Circuits [1.303764728768944]
We propose a novel Quantum-Gradient Sampling that requires the execution of at most two circuits per iteration to update the optimisable parameters.
Our proposed method achieves similar convergence rates to classical gradient descent, and empirically outperforms gradient coordinate descent, and SPSA.
arXiv Detail & Related papers (2023-06-20T18:50:18Z) - Efficient estimation of trainability for variational quantum circuits [43.028111013960206]
We find an efficient method to compute the cost function and its variance for a wide class of variational quantum circuits.
This method can be used to certify trainability for variational quantum circuits and explore design strategies that can overcome the barren plateau problem.
arXiv Detail & Related papers (2023-02-09T14:05:18Z) - Riemannian quantum circuit optimization for Hamiltonian simulation [2.1227079314039057]
Hamiltonian simulation is a natural application of quantum computing.
For translation invariant systems, the gates in such circuit topologies can be further optimized on classical computers.
For the Ising and Heisenberg models on a one-dimensional lattice, we achieve orders of magnitude accuracy improvements.
arXiv Detail & Related papers (2022-12-15T00:00:17Z) - Exploring the role of parameters in variational quantum algorithms [59.20947681019466]
We introduce a quantum-control-inspired method for the characterization of variational quantum circuits using the rank of the dynamical Lie algebra.
A promising connection is found between the Lie rank, the accuracy of calculated energies, and the requisite depth to attain target states via a given circuit architecture.
arXiv Detail & Related papers (2022-09-28T20:24:53Z) - Automatic and effective discovery of quantum kernels [43.702574335089736]
Quantum computing can empower machine learning models by enabling kernel machines to leverage quantum kernels for representing similarity measures between data.
We present a different approach, which employs optimization techniques, similar to those used in neural architecture search and AutoML.
The results obtained by testing our approach on a high-energy physics problem demonstrate that, in the best-case scenario, we can either match or improve testing accuracy with respect to the manual design approach.
arXiv Detail & Related papers (2022-09-22T16:42:14Z) - 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) - Circuit Symmetry Verification Mitigates Quantum-Domain Impairments [69.33243249411113]
We propose circuit-oriented symmetry verification that are capable of verifying the commutativity of quantum circuits without the knowledge of the quantum state.
In particular, we propose the Fourier-temporal stabilizer (STS) technique, which generalizes the conventional quantum-domain formalism to circuit-oriented stabilizers.
arXiv Detail & Related papers (2021-12-27T21:15:35Z) - Capacity and quantum geometry of parametrized quantum circuits [0.0]
Parametrized quantum circuits can be effectively implemented on current devices.
We evaluate the capacity and trainability of these circuits using the geometric structure of the parameter space.
Our results enhance the understanding of parametrized quantum circuits for improving variational quantum algorithms.
arXiv Detail & Related papers (2021-02-02T18:16:57Z) - Adaptive pruning-based optimization of parameterized quantum circuits [62.997667081978825]
Variisy hybrid quantum-classical algorithms are powerful tools to maximize the use of Noisy Intermediate Scale Quantum devices.
We propose a strategy for such ansatze used in variational quantum algorithms, which we call "Efficient Circuit Training" (PECT)
Instead of optimizing all of the ansatz parameters at once, PECT launches a sequence of variational algorithms.
arXiv Detail & Related papers (2020-10-01T18:14:11Z) - Measuring Analytic Gradients of General Quantum Evolution with the
Stochastic Parameter Shift Rule [0.0]
We study the problem of estimating the gradient of the function to be optimized directly from quantum measurements.
We derive a mathematically exact formula that provides an algorithm for estimating the gradient of any multi-qubit parametric quantum evolution.
Our algorithm continues to work, although with some approximations, even when all the available quantum gates are noisy.
arXiv Detail & Related papers (2020-05-20T18:24: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.