Hardware Efficient Quantum Kernels Using Multimode Bulk Acoustic Resonators

• URL: http://arxiv.org/abs/2512.11672v1
• Date: Fri, 12 Dec 2025 15:52:58 GMT
• Title: Hardware Efficient Quantum Kernels Using Multimode Bulk Acoustic Resonators
• Authors: Collin C. D. Frink, Chaoyang Ti, Stephen K. Gray, Xu Han, Matthew Otten,
• Abstract summary: kernel trick is a technique that maps datasets that are difficult to classify into a computationally friendly feature space.<n>We extend prior efforts in quantum kernel design for Kerr nonlinear devices by implementing time-dependent simulations of a Kerr-qubit coupled to acoustic resonators.
• Score: 3.1027575606031825
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The kernel trick is a widely applicable technique in machine learning domains that maps datasets that are difficult to classify into a computationally friendly feature space. As the dimension of the dataset scales, these kernel calculations can quickly become computationally intractable or data inefficient. In this work, we extend prior efforts in quantum kernel design for Kerr nonlinear devices by implementing time-dependent simulations of a Kerr-qubit coupled to acoustic resonators. For experimentally feasible parameters, we demonstrate that the Kerr nonlinearity directly induces non-classical behavior in the multimode system, which we use to define and analyze a quantum-enhanced kernel. Finally, we present a brief scaling characterization that demonstrates the computational intractability of classically simulating the kernel as the number of resonators scales.

Related papers

• Assessing Quantum Advantage for Gaussian Process Regression [7.10052009802944]
  We show that several quantum algorithms proposed for Gaussian Process Regression show no exponential speedup.<n>The implications for the quantum runtime algorithms are independent of the complexity of loading classical data on a quantum computer.<n>We supplement our theoretical analysis with numerical verification for popular kernels in machine learning.
  arXiv  Detail & Related papers  (2025-05-28T15:50:56Z)
• On the similarity of bandwidth-tuned quantum kernels and classical kernels [0.0]
  We numerically demonstrate that optimal bandwidth tuning results in QKs that closely resemble radial basis function (RBF) kernels.<n>We also reveal that the size of optimal bandwidth tuning parameters further simplifies QKs, causing them to behave like kernels.
  arXiv  Detail & Related papers  (2025-03-07T17:28:02Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [62.46800898243033]
  Recent progress in quantum learning theory prompts a question: can linear properties of a large-qubit circuit be efficiently learned from measurement data generated by varying classical inputs?<n>We prove that the sample complexity scaling linearly in $d$ is required to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d.<n>We propose a kernel-based method leveraging classical shadows and truncated trigonometric expansions, enabling a controllable trade-off between prediction accuracy and computational overhead.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• 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)
• Towards Efficient Quantum Anomaly Detection: One-Class SVMs using Variable Subsampling and Randomized Measurements [4.180897432770239]
  Quantum computing allows significant advancements in kernel calculation and model precision. We present two distinct approaches: utilizing randomized measurements to evaluate the quantum kernel and implementing the variable subsampling ensemble method. Experimental results demonstrate a substantial reduction in training and inference times by up to 95% and 25% respectively. Although unstable, the average precision of randomized measurements discernibly surpasses that of the classical Radial Basis Function kernel.
  arXiv  Detail & Related papers  (2023-12-14T17:42:18Z)
• Higher-order topological kernels via quantum computation [68.8204255655161]
  Topological data analysis (TDA) has emerged as a powerful tool for extracting meaningful insights from complex data. We propose a quantum approach to defining Betti kernels, which is based on constructing Betti curves with increasing order.
  arXiv  Detail & Related papers  (2023-07-14T14:48:52Z)
• Quantum Kerr Learning [10.109956955906718]
  We argue that a single Kerr mode might provide some extra quantum enhancements when using quantum kernel methods. A detailed study using the kernel method, neural tangent kernel theory, first-order perturbation theory of the Kerr non-linearity, and non-perturbative numerical simulations, shows quantum enhancements could happen.
  arXiv  Detail & Related papers  (2022-05-20T21:45:29Z)
• 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)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)
• Designing Kerr Interactions for Quantum Information Processing via Counterrotating Terms of Asymmetric Josephson-Junction Loops [68.8204255655161]
  static cavity nonlinearities typically limit the performance of bosonic quantum error-correcting codes. Treating the nonlinearity as a perturbation, we derive effective Hamiltonians using the Schrieffer-Wolff transformation. Results show that a cubic interaction allows to increase the effective rates of both linear and nonlinear operations.
  arXiv  Detail & Related papers  (2021-07-14T15:11:05Z)
• Fast and differentiable simulation of driven quantum systems [58.720142291102135]
  We introduce a semi-analytic method based on the Dyson expansion that allows us to time-evolve driven quantum systems much faster than standard numerical methods. We show results of the optimization of a two-qubit gate using transmon qubits in the circuit QED architecture.
  arXiv  Detail & Related papers  (2020-12-16T21:43:38Z)

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.