Harnessing a 256-qubit Neutral Atom Simulator for Graph Classification

• URL: http://arxiv.org/abs/2605.04737v1
• Date: Wed, 06 May 2026 10:35:02 GMT
• Title: Harnessing a 256-qubit Neutral Atom Simulator for Graph Classification
• Abstract summary: Neutral atom platforms offer the possibility to map graphs onto a 2D qubit register using programmable Rubidium atoms arrays.<n>We compute the Quantum Kernel (QEK) to extract the features from graphs of the PROTEINS dataset using the 256-qubits Aquila platform.
• Score: 0.11242503819703255
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Neutral atom platforms are analogue quantum simulators that offer the possibility to map graphs onto a 2D qubit register using programmable Rubidium atoms arrays, whose valence electrons' energy state is used as qubits, using optical tweezers. This makes it possible to implement algorithms for solving graph combinatorial optimization and Quantum Machine Learning (QML) tasks, such as graph classification. However, the restrictions of real hardware, as well as the very low number of publicly available machines, make such implementation non-trivial. In this work, we manage to compute the Quantum Evolution Kernel (QEK) to extract the features from graphs of the PROTEINS dataset using the 256-qubits Aquila platform (available through AWS) and then we apply classical Machine Learning (ML) techniques for the final classification. The method is benchmarked against classical kernels, resulting in slightly better performance, proving the effectiveness of the method, even in the case of a noisy quantum simulator.

Related papers

• MALOQ: Massively Accelerated Learning of Operators for Quantum Transport [71.9141151643915]
  MALOQ is an application built to train on and predict electronic-structure matrices for systems made of few to 100k atoms.<n>It reduces time-per-epoch by over 30% compared to a molecule-wise-distributed framework.<n>We demonstrate scalable training and inference for 3,000-12,000 atoms on the Alps supercomputer.
  arXiv  Detail & Related papers  (2026-06-27T13:34:52Z)
• Efficient Emulation of Neutral Atom Quantum Hardware [0.0]
  We introduce two emulators, emu-sv and emu-mps, as computational backends for Pasqal's pulser package.<n> Emu-sv is designed for high-precision state-vector simulations.<n>emu-mps uses a Matrix Product State representation and other controlled approximations to efficiently simulate larger arrays of atoms.
  arXiv  Detail & Related papers  (2025-10-10T19:21:20Z)
• An Efficient Quantum Classifier Based on Hamiltonian Representations [50.467930253994155]
  Quantum machine learning (QML) is a discipline that seeks to transfer the advantages of quantum computing to data-driven tasks.<n>We propose an efficient approach that circumvents the costs associated with data encoding by mapping inputs to a finite set of Pauli strings.<n>We evaluate our approach on text and image classification tasks, against well-established classical and quantum models.
  arXiv  Detail & Related papers  (2025-04-13T11:49:53Z)
• Supervised binary classification of small-scale digit images and weighted graphs with a trapped-ion quantum processor [56.089799129458875]
  We present the results of benchmarking a quantum processor based on trapped $171$Yb$+$ ions.<n>We perform a supervised binary classification on two types of datasets: small binary digit images and weighted graphs with a ring topology.
  arXiv  Detail & Related papers  (2024-06-17T18:20:51Z)
• Quantum Kernel Estimation With Neutral Atoms For Supervised Classification: A Gate-Based Approach [0.6445605125467573]
  Quantum Kernel Estimation (QKE) is a technique based on leveraging a quantum computer to estimate a kernel function. neutral atom quantum computers can be used, since they allow to arrange the atoms with more freedom. This paper proposes an algorithm for explicitly deriving a universal set of gates and presents a method of estimating quantum kernels on neutral atom devices.
  arXiv  Detail & Related papers  (2023-07-28T23:56:26Z)
• Compilation of algorithm-specific graph states for quantum circuits [55.90903601048249]
  We present a quantum circuit compiler that prepares an algorithm-specific graph state from quantum circuits described in high level languages. The computation can then be implemented using a series of non-Pauli measurements on this graph state.
  arXiv  Detail & Related papers  (2022-09-15T14:52:31Z)
• Towards Quantum Graph Neural Networks: An Ego-Graph Learning Approach [47.19265172105025]
  We propose a novel hybrid quantum-classical algorithm for graph-structured data, which we refer to as the Ego-graph based Quantum Graph Neural Network (egoQGNN) egoQGNN implements the GNN theoretical framework using the tensor product and unity matrix representation, which greatly reduces the number of model parameters required. The architecture is based on a novel mapping from real-world data to Hilbert space.
  arXiv  Detail & Related papers  (2022-01-13T16:35:45Z)
• Benchmarking Small-Scale Quantum Devices on Computing Graph Edit Distance [52.77024349608834]
  Graph Edit Distance (GED) measures the degree of (dis)similarity between two graphs in terms of the operations needed to make them identical. In this paper we present a comparative study of two quantum approaches to computing GED.
  arXiv  Detail & Related papers  (2021-11-19T12:35:26Z)
• Quantum Support Vector Machines for Continuum Suppression in B Meson Decays [0.27342795342528275]
  We investigate the effect of different quantum encoding circuits, the process that transforms classical data into a quantum state, on the final classification performance. We show an encoding approach that achieves an average Area Under Receiver Operating Characteristic Curve (AUC) of 0.848 determined using quantum circuit simulations. Using a reduced version of the dataset we then ran the algorithm on the IBM Quantum ibmq_casablanca device achieving an average AUC of 0.703.
  arXiv  Detail & Related papers  (2021-03-23T02:09:05Z)
• Laplacian Eigenmaps with variational circuits: a quantum embedding of graph data [0.0]
  We propose a method to compute a Laplacian Eigenmap using a quantum variational circuit. Tests on 32 nodes graph with a quantum simulator show that we can achieve similar performances as the classical laplacian eigenmap algorithm.
  arXiv  Detail & Related papers  (2020-11-10T14:51:25Z)
• Quantum Gram-Schmidt Processes and Their Application to Efficient State Read-out for Quantum Algorithms [87.04438831673063]
  We present an efficient read-out protocol that yields the classical vector form of the generated state. Our protocol suits the case that the output state lies in the row space of the input matrix. One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
  arXiv  Detail & Related papers  (2020-04-14T11:05:26Z)
• QEML (Quantum Enhanced Machine Learning): Using Quantum Computing to Enhance ML Classifiers and Feature Spaces [0.49841205356595936]
  Machine learning and quantum computing are causing a paradigm shift in the performance and behavior of certain algorithms. This paper first understands the mathematical intuition for the implementation of quantum feature space. We build a noisy variational quantum circuit KNN which mimics the classification methods of a traditional KNN.
  arXiv  Detail & Related papers  (2020-02-22T04:14:32Z)

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.