IEEE International Symposium on Multiple-Valued Logic (ISMVL)

Quantum Multiple Valued Kernel Circuits

Aviraj Sinha, Mitchell Aaron Thornton

Published May 1, 2022• 2 citations

Abstract

Quantum kernels map data to higher dimensions for classification and have been shown to have an advantage over classical methods. In our work, we generalize recent results in binary quantum kernels to multivalued logic by using higher dimensional entanglement to create a qudit memory and show that the use of qudits offers advantages in terms of quantum memory representation as well as enhanced resolution in the outcome of the kernel calculation. Our method is not only capable of finding the kernel inner product of higher dimensional data but can also efficiently and concurrently compute multiple instances of quantum kernel computations in linear time. We discuss how this method increases efficiency and resolution for various distance-based classifiers that require large datasets when accomplished with higher-dimensioned quantum data encodings. We provide experimental results of our qudit kernel calculations with different data encoding methods through the use of a higher-dimensioned quantum computation simulator.

DOI: 10.1109/ismvl52857.2022.00008

Related papers

Quantum Kernel Based Data Fusion

Leonhard Kunczik, Sabine Tornow

For quantum classification methods, the quantum kernel has a role in encoding the data set from its original low-dimensional real space into a high-dimensional quantum state space utilizing quantum circuits. Finding quantum kernels that provide an advantage in real-world data classification is a major challenge, especially when dealing with heterogeneous data or a large data set, requiring more qubits than are available on current devices. Here, we propose two new methods: first, we implement a multiple kernel method for data coming from multiple sources, and second, we propose to combine quantum chips to process larger data sets. The latter can be realized by splitting larger quantum circuits into smaller sub-circuits. We experimentally implement a multiple quantum kernel approach for different data sets on IBM quantum computers and benchmark their results.

International Conference on Information Fusion (FUSION)Jul 4, 20220 citations

Quantum Kernels

Andreas Wichert

This chapter gives an example of quantum kernels and the swap test. Then, it describes quantum kernels and the inversion test. Quantum feature maps encodes classical data into quantum data via a parametrized quantum circuit. A quantum computer can estimate a quantum kernel and the estimate can be used by a kernel method on a classical computer. This is because the exponential quantum advantage in evaluating inner products allows to estimate the quantum kernel machines directly in the higher-dimensional space. Quantum feature maps encodes classical data into quantum data via a parametrized quantum circuit. Quantum feature maps encodes classical data into quantum data via a parametrized quantum circuit that are hard to simulate classically and is an active area of current research.

Chapman & Hall/CRC eBooksNov 28, 20230 citations

Quadratic Speed‐ups in Quantum Kernelized Binary Classification

Jungyun Lee, Daniel K. Park

Abstract Classification is at the core of data‐driven prediction and decision‐making, representing a fundamental task in supervised machine learning. Recently, several quantum machine learning algorithms that use quantum kernels as a measure of similarities between data have emerged to perform binary classification on datasets encoded as quantum states. The potential advantages of quantum kernels arise from the ability of quantum computers to construct kernels that are more effective than their classical counterparts in capturing patterns in data or computing kernels more efficiently. However, existing quantum kernel‐based classification algorithms do not harness the capability of having data samples in quantum superposition for additional enhancements. This work demonstrates how such capability can be leveraged in quantum kernelized binary classifiers (QKCs) through Quantum Amplitude Estimation (QAE) for quadratic speed‐up. Additionally, new quantum circuits are proposed for the QKCs in which the number of qubits is reduced by one, and the circuit depth is reduced linearly with respect to the number of sample data. The quadratic speed‐up over previous methods is verified through numerical simulations on the Iris dataset.

arXiv:2403.17453Advanced Quantum TechnologiesJul 8, 20242 citations

Matrix Product States as a framework for efficient simulation of quantum kernel methods for classification

Antonio J. Rivera-Pérez, Noelia Sánchez-Gómez, Jara J. Bermejo-Vega +1 more

Tensor networks and Matrix Product States (MPS) are commonly used to efficiently perform classical simulations of specific quantum circuits with low entanglement. In this work, we propose an approach to use MPS as an efficient framework for quantum kernel simulation for binary classification via SVMs. To this end, classical data are first embedded into higher-dimensional quantum states using shallow ZZ feature maps. We employ ZZ feature maps with low connectivity that limits entanglement, enabling us to assess whether effective classical data encoding can be achieved while retaining efficient classical simulation. This way, quantum kernels are efficiently computed through MPS overlap. We study the computational cost and accuracy as a function of the depth of the feature maps. Experiments on different classical datasets show that low entanglement quantum feature maps can achieve competitive classification performance at the same time as being efficiently simulable on classical computers.

IEEE Conference on Artificial Intelligence (CAI)May 8, 20260 citations

A Resource Efficient Quantum Kernel

Utkarsh Singh, Jean‐Frédéric Laprade, Aaron Z. Goldberg +1 more

Quantum processors may enhance machine learning by mapping high-dimensional data onto quantum systems for processing. Conventional feature maps, for encoding data onto a quantum circuit are currently impractical, as the number of entangling gates scales quadratically with the dimension of the dataset and the number of qubits. In this work, we introduce a quantum feature map designed to handle high-dimensional data with a significantly reduced number of qubits and entangling operations. Our approach preserves essential data characteristics while promoting computational efficiency, as evidenced by extensive experiments on benchmark datasets that demonstrate a marked improvement in both accuracy and resource utilization when using our feature map as a kernel for characterization, as compared to state-of-the-art quantum feature maps. Our noisy simulation results, combined with lower resource requirements, highlight our map's ability to function within the constraints of noisy intermediate-scale quantum devices. Through numerical simulations and small-scale implementation on a superconducting circuit quantum computing platform, we demonstrate that our scheme performs on par or better than a set of classical algorithms for classification. While quantum kernels are typically stymied by exponential concentration, our approach is affected with a slower rate with respect to both the number of qubits and features, which allows practical applications to remain within reach. Our findings herald a promising avenue for the practical implementation of quantum machine learning algorithms on near future quantum computing platforms.

arXiv:2507.03689Jul 4, 20250 citations

Large-scale quantum machine learning

Tobias Haug, Chris N. Self, M. S. Kim

Quantum computers promise to enhance machine learning for practical applications. Quantum machine learning for real-world data has to handle extensive amounts of high-dimensional data. However, conventional methods for measuring quantum kernels are impractical for large datasets as they scale with the square of the dataset size. Here, we measure quantum kernels using randomized measurements to gain a quadratic speedup in computation time and quickly process large datasets. Further, we efficiently encode high-dimensional data into quantum computers with the number of features scaling linearly with the circuit depth. The encoding is characterized by the quantum Fisher information metric and is related to the radial basis function kernel. We demonstrate the advantages of our methods by classifying images with the IBM quantum computer. To achieve further speedups we distribute the quantum computational tasks between different quantum computers. Our approach is exceptionally robust to noise via a complementary error mitigation scheme. Using currently available quantum computers, the MNIST database can be processed within 220 hours instead of 10 years which opens up industrial applications of quantum machine learning.

Aug 2, 202111 citations