Phase-space negativity as a computational resource for quantum kernel methods
- URL: http://arxiv.org/abs/2405.12378v1
- Date: Mon, 20 May 2024 21:18:53 GMT
- Title: Phase-space negativity as a computational resource for quantum kernel methods
- Authors: Ulysse Chabaud, Roohollah Ghobadi, Salman Beigi, Saleh Rahimi-Keshari,
- Abstract summary: Quantum kernel methods are a proposal for achieving quantum computational advantage in machine learning.
We provide sufficient conditions for the efficient classical estimation of quantum kernel functions for bosonic systems.
Our results underpin the role of the negativity in phase-space-probability distributions as an essential resource in quantum machine learning.
- Score: 2.5499055723658097
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Quantum kernel methods are a proposal for achieving quantum computational advantage in machine learning. They are based on a hybrid classical-quantum computation where a function called the quantum kernel is estimated by a quantum device while the rest of the computation is performed classically. Quantum advantages may be achieved through this method only if the quantum kernel function cannot be estimated efficiently on a classical computer. In this paper, we provide sufficient conditions for the efficient classical estimation of quantum kernel functions for bosonic systems. Specifically, we show that if the negativity in the phase-space quasi-probability distributions of data-encoding quantum states associated with the quantum kernel scales at most polynomially with the size of the quantum circuit, then the kernel function can be estimated efficiently classically. We consider quantum optical examples involving linear-optical networks with and without adaptive non-Gaussian measurements and investigate the effects of loss on the efficiency of the classical simulation. Our results underpin the role of the negativity in phase-space quasi-probability distributions as an essential resource in quantum machine learning based on kernel methods.
Related papers
- Quantum Machine Learning: Quantum Kernel Methods [0.0]
Kernel methods are a powerful and popular technique in classical Machine Learning.
The use of a quantum feature space that can only be calculated efficiently on a quantum computer potentially allows for deriving a quantum advantage.
A data dependent projected quantum kernel was shown to provide significant advantage over classical kernels.
arXiv Detail & Related papers (2024-05-02T23:45:29Z) - Continuous-variable quantum kernel method on a programmable photonic quantum processor [0.0]
We experimentally prove that the CV quantum kernel method successfully classifies several datasets robustly even under the experimental imperfections.
This demonstration sheds light on the utility of CV quantum systems for QML and should stimulate further study in other CV QML algorithms.
arXiv Detail & Related papers (2024-05-02T08:33:31Z) - A Kerr kernel quantum learning machine [0.0]
We propose a quantum hardware kernel implementation scheme based on superconducting quantum circuits.
The scheme does not use qubits or quantum circuits but rather exploits the analogue features of Kerr modes.
arXiv Detail & Related papers (2024-04-02T09:50:33Z) - Power Characterization of Noisy Quantum Kernels [52.47151453259434]
We show that noise may make quantum kernel methods to only have poor prediction capability, even when the generalization error is small.
We provide a crucial warning to employ noisy quantum kernel methods for quantum computation.
arXiv Detail & Related papers (2024-01-31T01:02:16Z) - Effect of alternating layered ansatzes on trainability of projected
quantum kernel [0.0]
We analytically and numerically investigate the vanishing similarity issue in projected quantum kernels with alternating layered ansatzes.
We find that variance depends on circuit depth, size of local unitary blocks and initial state, indicating the issue is avoidable if shallow alternating layered ansatzes are used.
arXiv Detail & Related papers (2023-09-30T12:32:39Z) - Quantum data learning for quantum simulations in high-energy physics [55.41644538483948]
We explore the applicability of quantum-data learning to practical problems in high-energy physics.
We make use of ansatz based on quantum convolutional neural networks and numerically show that it is capable of recognizing quantum phases of ground states.
The observation of non-trivial learning properties demonstrated in these benchmarks will motivate further exploration of the quantum-data learning architecture in high-energy physics.
arXiv Detail & Related papers (2023-06-29T18:00:01Z) - Anticipative measurements in hybrid quantum-classical computation [68.8204255655161]
We present an approach where the quantum computation is supplemented by a classical result.
Taking advantage of its anticipation also leads to a new type of quantum measurements, which we call anticipative.
In an anticipative quantum measurement the combination of the results from classical and quantum computations happens only in the end.
arXiv Detail & Related papers (2022-09-12T15:47:44Z) - Noisy Quantum Kernel Machines [58.09028887465797]
An emerging class of quantum learning machines is that based on the paradigm of quantum kernels.
We study how dissipation and decoherence affect their performance.
We show that decoherence and dissipation can be seen as an implicit regularization for the quantum kernel machines.
arXiv Detail & Related papers (2022-04-26T09:52:02Z) - Efficient criteria of quantumness for a large system of qubits [58.720142291102135]
We discuss the dimensionless combinations of basic parameters of large, partially quantum coherent systems.
Based on analytical and numerical calculations, we suggest one such number for a system of qubits undergoing adiabatic evolution.
arXiv Detail & Related papers (2021-08-30T23:50:05Z) - Efficient classical computation of expectation values in a class of
quantum circuits with an epistemically restricted phase space representation [0.0]
We devise a classical algorithm which efficiently computes the quantum expectation values arising in a class of continuous variable quantum circuits.
The classical computational algorithm exploits a specific restriction in classical phase space which directly captures the quantum uncertainty relation.
arXiv Detail & Related papers (2021-06-21T06:43:34Z) - Towards understanding the power of quantum kernels in the NISQ era [79.8341515283403]
We show that the advantage of quantum kernels is vanished for large size datasets, few number of measurements, and large system noise.
Our work provides theoretical guidance of exploring advanced quantum kernels to attain quantum advantages on NISQ devices.
arXiv Detail & Related papers (2021-03-31T02:41:36Z)
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.