Automatic and effective discovery of quantum kernels
- URL: http://arxiv.org/abs/2209.11144v2
- Date: Wed, 20 Dec 2023 16:30:34 GMT
- Title: Automatic and effective discovery of quantum kernels
- Authors: Massimiliano Incudini, Daniele Lizzio Bosco, Francesco Martini,
Michele Grossi, Giuseppe Serra and Alessandra Di Pierro
- Abstract summary: 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.
- Score: 43.702574335089736
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Quantum computing can empower machine learning models by enabling kernel
machines to leverage quantum kernels for representing similarity measures
between data. Quantum kernels are able to capture relationships in the data
that are not efficiently computable on classical devices. However, there is no
straightforward method to engineer the optimal quantum kernel for each specific
use case. While recent literature has focused on exploiting the potential
offered by the presence of symmetries in the data to guide the construction of
quantum kernels, we adopt here a different approach, which employs optimization
techniques, similar to those used in neural architecture search and AutoML, to
automatically find an optimal kernel in a heuristic manner. The algorithm we
present constructs a quantum circuit implementing the similarity measure as a
combinatorial object, which is evaluated based on a cost function and is then
iteratively modified using a meta-heuristic optimization technique. The cost
function can encode many criteria ensuring favorable statistical properties of
the candidate solution, such as the rank of the Dynamical Lie Algebra.
Importantly, our approach is independent of the optimization technique
employed. 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, showing
the potential of our technique to deliver superior results with reduced effort.
Related papers
- Bayesian Parameterized Quantum Circuit Optimization (BPQCO): A task and hardware-dependent approach [49.89480853499917]
Variational quantum algorithms (VQA) have emerged as a promising quantum alternative for solving optimization and machine learning problems.
In this paper, we experimentally demonstrate the influence of the circuit design on the performance obtained for two classification problems.
We also study the degradation of the obtained circuits in the presence of noise when simulating real quantum computers.
arXiv Detail & Related papers (2024-04-17T11:00:12Z) - Surrogate optimization of variational quantum circuits [1.0546736060336612]
Variational quantum eigensolvers are touted as a near-term algorithm capable of impacting many applications.
Finding algorithms and methods to improve convergence is important to accelerate the capabilities of near-term hardware for VQE.
arXiv Detail & Related papers (2024-04-03T18:00:00Z) - Randomized Benchmarking of Local Zeroth-Order Optimizers for Variational
Quantum Systems [65.268245109828]
We compare the performance of classicals across a series of partially-randomized tasks.
We focus on local zeroth-orders due to their generally favorable performance and query-efficiency on quantum systems.
arXiv Detail & Related papers (2023-10-14T02:13:26Z) - GloptiNets: Scalable Non-Convex Optimization with Certificates [61.50835040805378]
We present a novel approach to non-cube optimization with certificates, which handles smooth functions on the hypercube or on the torus.
By exploiting the regularity of the target function intrinsic in the decay of its spectrum, we allow at the same time to obtain precise certificates and leverage the advanced and powerful neural networks.
arXiv Detail & Related papers (2023-06-26T09:42:59Z) - Faster variational quantum algorithms with quantum kernel-based
surrogate models [0.0]
We present a new method for small-to-intermediate scale variational algorithms on noisy quantum processors.
Our scheme shifts the computational burden onto the classical component of these hybrid algorithms, greatly reducing the number of queries to the quantum processor.
arXiv Detail & Related papers (2022-11-02T14:11:25Z) - Surrogate-based optimization for variational quantum algorithms [0.0]
Variational quantum algorithms are a class of techniques intended to be used on near-term quantum computers.
We introduce the idea of learning surrogate models for variational circuits using few experimental measurements.
We then perform parameter optimization using these models as opposed to the original data.
arXiv Detail & Related papers (2022-04-12T00:15:17Z) - Stochastic optimization algorithms for quantum applications [0.0]
We review the use of first-order, second-order, and quantum natural gradient optimization methods, and propose new algorithms defined in the field of complex numbers.
The performance of all methods is evaluated by means of their application to variational quantum eigensolver, quantum control of quantum states, and quantum state estimation.
arXiv Detail & Related papers (2022-03-11T16:17:05Z) - A Hybrid Quantum-Classical Algorithm for Robust Fitting [47.42391857319388]
We propose a hybrid quantum-classical algorithm for robust fitting.
Our core contribution is a novel robust fitting formulation that solves a sequence of integer programs.
We present results obtained using an actual quantum computer.
arXiv Detail & Related papers (2022-01-25T05:59:24Z) - 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)
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.