Experimental quantum kernel trick with nuclear spins in a solid

  title={Experimental quantum kernel trick with nuclear spins in a solid},
  author={Takeru Kusumoto and Kosuke Mitarai and Keisuke Fujii and Masahiro Kitagawa and Makoto Negoro},
  journal={npj Quantum Information},
The kernel trick allows us to employ high-dimensional feature space for a machine learning task without explicitly storing features. Recently, the idea of utilizing quantum systems for computing kernel functions using interference has been demonstrated experimentally. However, the dimension of feature spaces in those experiments have been smaller than the number of data, which makes them lose their computational advantage over explicit method. Here we show the first experimental demonstration… 

Machine learning of high dimensional data on a noisy quantum processor

A circuit ansatz is constructed that preserves kernel magnitudes that typically otherwise vanish due to an exponentially growing Hilbert space, and error mitigation specific to the task of computing quantum kernels on near-term hardware is implemented.

Large-scale quantum machine learning

This work measures quantum kernels using randomized measurements to gain a quadratic speedup in computation time and quickly process large datasets and efficiently encode high-dimensional data into quantum computers with the number of features scaling linearly with the circuit depth.

Quantum machine learning of large datasets using randomized measurements

This work efficiently encode high-dimensional data into quantum computers with the number of features scaling linearly with the circuit depth with a robust approach to noise via a cost-free error mitigation scheme.

Training Quantum Embedding Kernels on Near-Term Quantum Computers

This paper presents a meta-analyses of the response of the Higgs boson to the proton-proton collision in a discrete-time environment and shows good support for the theory of quantum entanglement.

Noisy quantum kernel machines

It is shown that decoherence and dissipation can be seen as an implicit regularization for the quantum kernel machines and an upper bound on the generalization error of the model that involves the average purity of the encoded states is derived.

Quantum AI simulator using a hybrid CPU-FPGA approach

This work focuses on quantum kernels empirically designed for image classification and demonstrates a field programmable gate arrays (FPGA) implementation, and shows that the quantum kernel estimation by the heterogeneous CPU–FPGA computing is 470 times faster than that by a conventional CPU implementation.

Quantum machine learning beyond kernel methods

It is proved that linear quantum models must utilize exponentially more qubits than data re-uploading models in order to solve certain learning tasks, while kernel methods additionally require exponentially more data points.

A rigorous and robust quantum speed-up in supervised machine learning

A rigorous quantum speed-up for supervised classification using a quantum learning algorithm that only requires classical access to data and achieves high accuracy, robust against additive errors in the kernel entries that arise from finite sampling statistics.

On exploring practical potentials of quantum auto-encoder with advantages

This work proves that QAE can be used to efficiently calculate the eigenvalues and prepare the corresponding eigenvectors of a high-dimensional quantum state with the low-rank property and proves that the error bounds of the proposed QAE-based methods outperform those in previous literature.

Towards understanding the power of quantum kernels in the NISQ era

This work proves that the advantage of quantum kernels is vanished for large size of datasets, few number of measurements, and large system noise and provides theoretical guidance of exploring advanced quantum kernels to attain quantum advantages on NISQ devices.



Experimental kernel-based quantum machine learning in finite feature space

An all-optical setup demonstrating kernel-based quantum machine learning for two-dimensional classification problems using specialized multiphoton quantum optical circuits exhibits exponentially better scaling in the required number of qubits than a direct generalization of kernels described in the literature.

Supervised learning with quantum-enhanced feature spaces

Two classification algorithms that use the quantum state space to produce feature maps are demonstrated on a superconducting processor, enabling the solution of problems when the feature space is large and the kernel functions are computationally expensive to estimate.

Quantum Machine Learning in Feature Hilbert Spaces.

This Letter interprets the process of encoding inputs in a quantum state as a nonlinear feature map that maps data to quantum Hilbert space and shows how it opens up a new avenue for the design of quantum machine learning algorithms.

Harnessing disordered quantum dynamics for machine learning

A novel platform, quantum reservoir computing, is proposed to solve issues successfully by exploiting natural quantum dynamics, which is ubiquitous in laboratories nowadays, for machine learning by exploiting nonlinear dynamics including classical chaos.

Towards quantum machine learning with tensor networks

A unified framework is proposed in which classical and quantum computing can benefit from the same theoretical and algorithmic developments, and the same model can be trained classically then transferred to the quantum setting for additional optimization.

Quantum convolutional neural networks

A quantum circuit-based algorithm inspired by convolutional neural networks is shown to successfully perform quantum phase recognition and devise quantum error correcting codes when applied to arbitrary input quantum states.

A generative modeling approach for benchmarking and training shallow quantum circuits

A quantum circuit learning algorithm that can be used to assist the characterization of quantum devices and to train shallow circuits for generative tasks is proposed and it is demonstrated that this approach can learn an optimal preparation of the Greenberger-Horne-Zeilinger states.

Quantum supremacy using a programmable superconducting processor

Quantum supremacy is demonstrated using a programmable superconducting processor known as Sycamore, taking approximately 200 seconds to sample one instance of a quantum circuit a million times, which would take a state-of-the-art supercomputer around ten thousand years to compute.

Decoherence in large NMR quantum registers

Decoherence causes the decay of the quantum information that is stored in highly correlated states during quantum computation. It is thus a limiting factor for all implementations of a quantum

Characterizing quantum supremacy in near-term devices

A critical question for quantum computing in the near future is whether quantum devices without error correction can perform a well-defined computational task beyond the capabilities of