Variational Quantum Self-Organizing Map

• URL: http://arxiv.org/abs/2504.03584v1
• Date: Fri, 04 Apr 2025 16:48:35 GMT
• Title: Variational Quantum Self-Organizing Map
• Authors: Amol Deshmukh,
• Abstract summary: We propose a novel quantum neural network architecture for unsupervised learning of classical and quantum data.<n>Our algorithm learns a mapping from a high-dimensional Hilbert space to a low-dimensional grid of lattice points while preserving the underlying topology of the Hilbert space.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We propose a novel quantum neural network architecture for unsupervised learning of classical and quantum data based on the kernelized version of Kohonen's self-organizing map. The central idea behind our algorithm is to replace the Euclidean distance metric with the fidelity between quantum states to identify the best matching unit from the low-dimensional grid of output neurons in the self-organizing map. The fidelities between the unknown quantum state and the quantum states containing the variational parameters are estimated by computing the transition probability on a quantum computer. The estimated fidelities are in turn used to adjust the variational parameters of the output neurons. Unlike $\mathcal{O}(N^{2})$ circuit evaluations needed in quantum kernel estimation, our algorithm requires $\mathcal{O}(N)$ circuit evaluations for $N$ data samples. Analogous to the classical version of the self-organizing map, our algorithm learns a mapping from a high-dimensional Hilbert space to a low-dimensional grid of lattice points while preserving the underlying topology of the Hilbert space. We showcase the effectiveness of our algorithm by constructing a two-dimensional visualization that accurately differentiates between the three distinct species of flowers in Fisher's Iris dataset. In addition, we demonstrate the efficacy of our approach on quantum data by creating a two-dimensional map that preserves the topology of the state space in the Schwinger model and distinguishes between the two separate phases of the model at $\theta = \pi$.

Related papers

• One-Shot Min-Entropy Calculation Of Classical-Quantum States And Its Application To Quantum Cryptography [21.823963925581868]
  We develop a one-shot lower bound calculation technique for the min-entropy of a classical-quantum state. It offers an alternative tight finite-data analysis for the BB84 quantum key distribution scheme. It gives the best finite-key bound known to date for a variant of device independent quantum key distribution protocol.
  arXiv  Detail & Related papers  (2024-06-21T15:11:26Z)
• $\mathcal{PT}$-symmetric mapping of three states and its implementation on a cloud quantum processor [0.9599644507730107]
  We develop a new $mathcalPT$-symmetric approach for mapping three pure qubit states. We show consistency with the Hermitian case, conservation of average projections on reference vectors, and Quantum Fisher Information. Our work unlocks new doors for applying $mathcalPT$-symmetry in quantum communication, computing, and cryptography.
  arXiv  Detail & Related papers  (2023-12-27T18:51:33Z)
• Approximately Equivariant Quantum Neural Network for $p4m$ Group Symmetries in Images [30.01160824817612]
  This work proposes equivariant Quantum Convolutional Neural Networks (EquivQCNNs) for image classification under planar $p4m$ symmetry. We present the results tested in different use cases, such as phase detection of the 2D Ising model and classification of the extended MNIST dataset.
  arXiv  Detail & Related papers  (2023-10-03T18:01:02Z)
• GRAPE optimization for open quantum systems with time-dependent decoherence rates driven by coherent and incoherent controls [77.34726150561087]
  The GRadient Ascent Pulse Engineering (GRAPE) method is widely used for optimization in quantum control. We adopt GRAPE method for optimizing objective functionals for open quantum systems driven by both coherent and incoherent controls. The efficiency of the algorithm is demonstrated through numerical simulations for the state-to-state transition problem.
  arXiv  Detail & Related papers  (2023-07-17T13:37:18Z)
• Feature Map for Quantum Data in Classification [2.2940141855172036]
  A quantum feature map corresponds to an instance with a Hilbert space of quantum states by fueling quantum resources to machine learning algorithms. We present a feature map for quantum data as a probabilistic manipulation of quantum states to improve supervised learning algorithms.
  arXiv  Detail & Related papers  (2023-03-28T01:17:08Z)
• Automatic and effective discovery of quantum kernels [41.61572387137452]
  Quantum computing can empower machine learning models by enabling kernel machines to leverage quantum kernels for representing similarity measures between data.<n>We present an approach to this problem, which employs optimization techniques, similar to those used in neural architecture search and AutoML.<n>The results obtained by testing our approach on a high-energy physics problem demonstrate that, in the best-case scenario, we can either match or improve testing accuracy with respect to the manual design approach.
  arXiv  Detail & Related papers  (2022-09-22T16:42:14Z)
• An example of use of Variational Methods in Quantum Machine Learning [0.0]
  This paper introduces a quantum neural network for the binary classification of points of a specific geometric pattern on a plane. The intention was to produce a quantum deep neural network with the minimum number of trainable parameters capable of correctly recognising and classifying points.
  arXiv  Detail & Related papers  (2022-08-07T03:52:42Z)
• Lattice Convolutional Networks for Learning Ground States of Quantum Many-Body Systems [33.82764380485598]
  We propose lattice convolutions in which a set of proposed operations are used to convert non-square lattices into grid-like augmented lattices. Based on the proposed lattice convolutions, we design lattice convolutional networks (LCN) that use self-gating and attention mechanisms.
  arXiv  Detail & Related papers  (2022-06-15T08:24:37Z)
• Entanglement Forging with generative neural network models [0.0]
  We show that a hybrid quantum-classical variational ans"atze can forge entanglement to lower quantum resource overhead. The method is efficient in terms of the number of measurements required to achieve fixed precision on expected values of observables.
  arXiv  Detail & Related papers  (2022-05-02T14:29:17Z)
• Quantum algorithms for grid-based variational time evolution [36.136619420474766]
  We propose a variational quantum algorithm for performing quantum dynamics in first quantization. Our simulations exhibit the previously observed numerical instabilities of variational time propagation approaches.
  arXiv  Detail & Related papers  (2022-03-04T19:00:45Z)
• Parametric t-Stochastic Neighbor Embedding With Quantum Neural Network [0.6946929968559495]
  t-Stochastic Neighbor Embedding (t-SNE) is a non-parametric data visualization method in classical machine learning. We propose to use quantum neural networks for parametric t-SNE to reflect the characteristics of high-dimensional quantum data on low-dimensional data.
  arXiv  Detail & Related papers  (2022-02-09T02:49:54Z)
• 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)
• Tree tensor network classifiers for machine learning: from quantum-inspired to quantum-assisted [0.0]
  We describe a quantum-assisted machine learning (QAML) method in which multivariate data is encoded into quantum states in a Hilbert space whose dimension is exponentially large in the length of the data vector. We present an approach that can be implemented on gate-based quantum computing devices.
  arXiv  Detail & Related papers  (2021-04-06T02:31:48Z)

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.