Quantum evolution kernel : Machine learning on graphs with programmable arrays of qubits

Abstract

The rapid development of reliable Quantum Processing Units (QPU) opens up novel computational opportunities for machine learning. Here, we introduce a procedure for measuring the similarity between graph-structured data, based on the time-evolution of a quantum system. By encoding the topology of the input graph in the Hamiltonian of the system, the evolution produces measurement samples that retain key features of the data. We study analytically the procedure and illustrate its versatility in providing links to standard classical approaches. We then show numerically that this scheme performs well compared to standard graph kernels on typical benchmark datasets. Finally, we study the possibility of a concrete implementation on a realistic neutral-atom quantum processor.

References in corpus (12)

• Probing many-body dynamics on a 51-atom quantum simulator
• A Quantum Approximate Optimization Algorithm
• Many-Body Physics with Individually-Controlled Rydberg Atoms
• An atom-by-atom assembler of defect-free arbitrary 2d atomic arrays
• Biological network comparison using graphlet degree distribution
• Exponential algorithmic speedup by quantum walk
• Quantum computing with neutral atoms
• TUDataset: A collection of benchmark datasets for learning with graphs
• Dynamical crystallization in a low-dimensional Rydberg gas
• Coherent Excitation Transfer in a Spin Chain of Three Rydberg Atoms
• A concise review of Rydberg atom based quantum computation and quantum simulation
• Graph Kernels: State-of-the-Art and Future Challenges