Emergent Order in Classical Data Representations on Ising Spin Models

• URL: http://arxiv.org/abs/2303.01461v1
• Date: Thu, 2 Mar 2023 18:17:35 GMT
• Title: Emergent Order in Classical Data Representations on Ising Spin Models
• Authors: Jorja J. Kirk and Matthew D. Jackson and Daniel J.M. King and Philip Intallura and Mekena Metcalf
• Abstract summary: classical data on quantum spin Hamiltonians yields ordered spin ground states which are used to discriminate data types for binary classification. We assess the ground states of the Ising Hamiltonian encoded with three separate data sets containing two classes of data. A new methodology is proposed to predict a certain data class using the ground state of the encoded Ising Hamiltonian.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Encoding classical data on quantum spin Hamiltonians yields ordered spin ground states which are used to discriminate data types for binary classification. The Ising Hamiltonian is a typical spin model to encode classical data onto qubits, known as the ZZ feature map. We assess the ground states of the Ising Hamiltonian encoded with three separate data sets containing two classes of data. A new methodology is proposed to predict a certain data class using the ground state of the encoded Ising Hamiltonian. Ground state observables are obtained through quantum simulation on a quantum computer, and the expectation values are used to construct a classical probability distribution on the state space. Our approach is a low dimensional representation of the exponentially large feature space. The antiferromagnetic ground state is the stable ground state for the one dimensional chain lattice and the 2D square lattice. Frustration induces unique ordered states on the triangle lattice encoded with data, hinting at the possibility for an underlying phase diagram for the model. We examine order stability with data scaling and data noise.

Related papers

• Variational Quantum Self-Organizing Map [0.0]
  We propose a novel quantum neural network architecture for unsupervised learning of classical and quantum data. 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.
  arXiv  Detail & Related papers  (2025-04-04T16:48:35Z)
• Predicting Ground State Properties: Constant Sample Complexity and Deep Learning Algorithms [48.869199703062606]
  A fundamental problem in quantum many-body physics is that of finding ground states of local Hamiltonians. We introduce two approaches that achieve a constant sample complexity, independent of system size $n$, for learning ground state properties.
  arXiv  Detail & Related papers  (2024-05-28T18:00:32Z)
• Understanding Stabilizer Codes Under Local Decoherence Through a General Statistical Mechanics Mapping [0.0]
  We construct a mapping from the $n$th moment of the decohered ground state density matrix to a classical statistical mechanics model. We analyze the 3D toric code and X-cube model, deriving bounds on their optimal decoding thresholds.
  arXiv  Detail & Related papers  (2024-03-06T18:59:00Z)
• Improved machine learning algorithm for predicting ground state properties [3.156207648146739]
  We give a classical machine learning (ML) algorithm for predicting ground state properties with an inductive bias encoding geometric locality. The proposed ML model can efficiently predict ground state properties of an $n$-qubit gapped local Hamiltonian after learning from only $mathcalO(log(n))$ data.
  arXiv  Detail & Related papers  (2023-01-30T18:40:07Z)
• Predicting Properties of Quantum Systems with Conditional Generative Models [4.710629384265492]
  generative models can learn from measurements of a single quantum state to reconstruct the state accurately enough to predict local observables. classification and regression models can predict local observables by learning from measurements on different but related states. We numerically validate our approach on 2D random Heisenberg models using simulations of up to 45 qubits.
  arXiv  Detail & Related papers  (2022-11-30T12:34:57Z)
• A didactic approach to quantum machine learning with a single qubit [68.8204255655161]
  We focus on the case of learning with a single qubit, using data re-uploading techniques. We implement the different proposed formulations in toy and real-world datasets using the qiskit quantum computing SDK.
  arXiv  Detail & Related papers  (2022-11-23T18:25:32Z)
• 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)
• Determining ground-state phase diagrams on quantum computers via a generalized application of adiabatic state preparation [61.49303789929307]
  We use a local adiabatic ramp for state preparation to allow us to directly compute ground-state phase diagrams on a quantum computer via time evolution. We are able to calculate an accurate phase diagram on both two and three site systems using IBM quantum machines.
  arXiv  Detail & Related papers  (2021-12-08T23:59:33Z)
• Nonlinear State-Space Generalizations of Graph Convolutional Neural Networks [172.18295279061607]
  Graph convolutional neural networks (GCNNs) learn compositional representations from network data by nesting linear graph convolutions into nonlinearities. In this work, we approach GCNNs from a state-space perspective revealing that the graph convolutional module is a minimalistic linear state-space model. We show that this state update may be problematic because it is nonparametric, and depending on the graph spectrum it may explode or vanish. We propose a novel family of nodal aggregation rules that aggregate node features within a layer in a nonlinear state-space parametric fashion allowing for a better trade-off.
  arXiv  Detail & Related papers  (2020-10-27T19:48:56Z)
• State preparation and measurement in a quantum simulation of the O(3) sigma model [65.01359242860215]
  We show that fixed points of the non-linear O(3) sigma model can be reproduced near a quantum phase transition of a spin model with just two qubits per lattice site. We apply Trotter methods to obtain results for the complexity of adiabatic ground state preparation in both the weak-coupling and quantum-critical regimes. We present and analyze a quantum algorithm based on non-unitary randomized simulation methods.
  arXiv  Detail & Related papers  (2020-06-28T23:44:12Z)
• A quantum algorithm for model independent searches for new physics [0.0]
  We propose a novel quantum technique to search for unmodelled anomalies in multi-dimensional binned collider data. We associate an Ising lattice spin site with each bin, with the Ising Hamiltonian suitably constructed from the observed data. In order to capture spatially correlated anomalies in the data, we introduce spin-spin interactions between neighboring sites.
  arXiv  Detail & Related papers  (2020-03-04T16:51:25Z)
• Gaussian Process States: A data-driven representation of quantum many-body physics [59.7232780552418]
  We present a novel, non-parametric form for compactly representing entangled many-body quantum states. The state is found to be highly compact, systematically improvable and efficient to sample. It is also proven to be a universal approximator' for quantum states, able to capture any entangled many-body state with increasing data set size.
  arXiv  Detail & Related papers  (2020-02-27T15:54:44Z)

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.