Measurement cost of metric-aware variational quantum algorithms
- URL: http://arxiv.org/abs/2005.05172v3
- Date: Thu, 9 Sep 2021 22:31:58 GMT
- Title: Measurement cost of metric-aware variational quantum algorithms
- Authors: Barnaby van Straaten, B\'alint Koczor
- Abstract summary: We consider metric-aware quantum algorithms that use a quantum computer to estimate both a matrix and a vector object.
We propose a general approach for optimally distributing samples between matrix and vector entries.
We establish that the number of circuit repetitions needed for estimating the quantum Fisher information matrix is negligible for an increasing number of iterations.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Variational quantum algorithms are promising tools for near-term quantum
computers as their shallow circuits are robust to experimental imperfections.
Their practical applicability, however, strongly depends on how many times
their circuits need to be executed for sufficiently reducing shot-noise. We
consider metric-aware quantum algorithms: variational algorithms that use a
quantum computer to efficiently estimate both a matrix and a vector object. For
example, the recently introduced quantum natural gradient approach uses the
quantum Fisher information matrix as a metric tensor to correct the gradient
vector for the co-dependence of the circuit parameters. We rigorously
characterise and upper bound the number of measurements required to determine
an iteration step to a fixed precision, and propose a general approach for
optimally distributing samples between matrix and vector entries. Finally, we
establish that the number of circuit repetitions needed for estimating the
quantum Fisher information matrix is asymptotically negligible for an
increasing number of iterations and qubits.
Related papers
- A Quantum Approximate Optimization Method For Finding Hadamard Matrices [0.0]
We propose a novel qubit-efficient method by implementing the Hadamard matrix searching algorithm on a gate-based quantum computer.
We present the formulation of the method, construction of corresponding quantum circuits, and experiment results in both a quantum simulator and a real gate-based quantum computer.
arXiv Detail & Related papers (2024-08-15T06:25:50Z) - Determining the ability for universal quantum computing: Testing
controllability via dimensional expressivity [39.58317527488534]
Controllability tests can be used in the design of quantum devices to reduce the number of external controls.
We devise a hybrid quantum-classical algorithm based on a parametrized quantum circuit.
arXiv Detail & Related papers (2023-08-01T15:33:41Z) - Robust Dequantization of the Quantum Singular value Transformation and
Quantum Machine Learning Algorithms [0.0]
We show how many techniques from randomized linear algebra can be adapted to work under this weaker assumption.
We also apply these results to obtain a robust dequantization of many quantum machine learning algorithms.
arXiv Detail & Related papers (2023-04-11T02:09:13Z) - 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) - Quantum gradient evaluation through quantum non-demolition measurements [0.0]
We discuss a Quantum Non-Demolition Measurement protocol to estimate the derivatives of a cost function with a quantum computer.
This is a key step for the implementation of variational quantum circuits.
arXiv Detail & Related papers (2023-01-17T19:00:08Z) - End-to-end resource analysis for quantum interior point methods and portfolio optimization [63.4863637315163]
We provide a complete quantum circuit-level description of the algorithm from problem input to problem output.
We report the number of logical qubits and the quantity/depth of non-Clifford T-gates needed to run the algorithm.
arXiv Detail & Related papers (2022-11-22T18:54:48Z) - 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) - Variational Quantum Linear Solver with Dynamic Ansatz [0.0]
Variational quantum algorithms have found success in the NISQ era owing to their hybrid quantum-classical approach.
We introduce the dynamic ansatz in the Variational Quantum Linear Solver for a system of linear algebraic equations.
We demonstrate the algorithm advantage in comparison to the standard, static ansatz by utilizing fewer quantum resources.
arXiv Detail & Related papers (2021-07-19T03:42:25Z) - 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) - Programming a quantum computer with quantum instructions [39.994876450026865]
We use a density matrixiation protocol to execute quantum instructions on quantum data.
A fixed sequence of classically-defined gates performs an operation that uniquely depends on an auxiliary quantum instruction state.
The utilization of quantum instructions obviates the need for costly tomographic state reconstruction and recompilation.
arXiv Detail & Related papers (2020-01-23T22:43:29Z)
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.