Search arXivSearch

arXiv · 2404.01787

A Kerr kernel quantum learning machine

Abstract

Kernel methods are of current interest in quantum machine learning due to similarities with quantum computing in how they process information in high-dimensional feature (Hilbert) spaces. Kernels are believed to offer particular advantages when they cannot be computed classically, so a kernel matrix with indisputably nonclassical elements is desirable provided it can be generated efficiently in a particular physical machine. Kerr nonlinearities, known to be a route to universal continuous variable (CV) quantum computation, may be able to play this role for quantum machine learning. 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 coupled modes. Our approach is more akin to the growing number of analog machine learning schemes based on sampling quantum probabilities directly in an engineered device by stochastic quantum control.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Carolyn Wood, Sally Shrapnel, G J Milburn. 2024-04-02. A Kerr kernel quantum learning machine. https://arxiv.org/abs/2404.01787

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Interactive proofs for verifying (quantum) learning and testing

We consider the problem of testing and learning from data in the presence of resource constraints, such as limited memory or weak data access, which place limitations on the efficiency and feasibility of testing or learning. In particular, we ask the following question: Could a resource-constrained learner/tester use interaction with a resource-unconstrained but untrusted party to solve a learning or testing problem more efficiently than they could without such an interaction? In this work, we answer this question both abstractly and for concrete problems, in two complementary ways: For a wide variety of scenarios, we prove that a resource-constrained learner cannot gain any advantage through classical interaction with an untrusted prover. As a special case, we show that for the vast majority of testing and learning problems in which quantum memory is a meaningful resource, a memory-constrained quantum algorithm cannot overcome its limitations via classical communication with a memory-unconstrained quantum prover. In contrast, when quantum communication is allowed, we construct a variety of interactive proof protocols, for specific learning and testing problems, which allow memory-constrained quantum verifiers to gain significant advantages through delegation to untrusted provers. These results highlight both the limitations and potential of delegating learning and testing problems to resource-rich but untrusted third parties.

quant-ph

Physics-Informed Support Vector Kernels via Green-Function Analogies and Jackson-Chebyshev Spectral Design

Kernel selection for regression of physical observables is often heuristic. We investigate a physics-informed strategy in which functional forms and spectral structures associated with Green's functions motivate kernel selection without requiring an exact identification between a machine-learning kernel and a physical propagator. The principal construction is a Jackson-damped Chebyshev kernel inspired by the kernel polynomial method (KPM); its explicit feature map yields a positive-semidefinite Gram matrix by construction and provides an inspectable spectral prior for structured observables. We evaluate standard and custom SVR models on copper-conductivity proxies, local Dirac-like band dispersion, quartic-oscillator energy levels, photonic-crystal transmission, and Fibonacci-chain transmission using repeated nested validation, learning curves, random-forest and multilayer-perceptron baselines, and low-rank Nyström tests where relevant. The framework is intended for finite-data regression of precomputed observables while boundary conditions remain part of the physical model that generates those observables.

quant-ph

Optimal observables for (non-)equilibrium quantum metrology from the master equation

We demonstrate how observables with optimal sensitivity to environmental properties can be constructed explicitly from the master equation of an open quantum system. Our approach does not rely on the explicit solution of the master equation and instead expresses the symmetric logarithmic derivative (SLD), the operator of optimal sensitivity and key quantity in quantum metrology, solely in terms of expectation values. This makes the SLD available to a large class of systems of interest, both in and out of equilibrium. We validate our approach by reproducing the SLD for temperature in quantum Brownian motion and demonstrate its versatility by constructing the optimal observable for the non-equilibrium relaxation rate.

quant-ph