Effects of Graph Network Connections on The Efficiency of Quantum Annealing

• URL: http://arxiv.org/abs/2111.11411v2
• Date: Fri, 17 Dec 2021 07:44:06 GMT
• Title: Effects of Graph Network Connections on The Efficiency of Quantum Annealing
• Abstract summary: Graph structure of quantum spin networks plays an essential role in applying quantum annealing (QA) Here, we explore the interplay of different interaction types between the spins and the structure of the underlying network on the performance of QA. We find that the QA performance of the Ising model shows less variation with the change of graph structure among different interaction types.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Graph structure of quantum spin networks plays an essential role in applying quantum annealing (QA). The Ising model is the typical choice to describe the interactions between the spins in the networks. Here, we explore the interplay of different interaction types between the spins and the structure of the underlying network on the performance of QA. Specifically, we consider the Heisenberg XY and antisymmetric anisotropic exchange interaction models, in addition to the usual Ising Model, in graph structures ranging from linear chains to complete graphs with different connectivities. We find that the QA performance of the Ising model shows less variation with the change of graph structure among different interaction types. The Heisenberg XY model suffers from significant performance losses with increasing connections beyond linear chains, which we attribute to increasing entropy built-up. Anisotropic exchange interactions turn out to be an impractical choice for complete graphs due to the diminishing energy gap during annealing. Furthermore, we investigate the effect of inhomogeneous couplings and reveal a trade-off between coupling strength and performance, especially significant for the case of the anisotropic exchange model.

Related papers

• Entanglement Entropy in Quantum Networks with Tunable Geometry [0.0]
  We study quantum hopping on a random graph model with an effective range parameter.<n> tuning it, we interpolate between nearest-neighbor and all-to-all graphs, identifying a new localization regime.<n>This provides a model of Anderson localization induced by structural disorder, with implications for amorphous materials and tunable-range analog quantum simulators.
  arXiv  Detail & Related papers  (2026-07-17T18:00:01Z)
• Quantum fluctuations and chaos in fully connected spin models [84.0552206158625]
  We investigate beyond-mean-field dynamics in a fully connected $mathrmSU(3)$ spin-exchange model.<n>Using the two-particle irreducible (2PI) effective action formalism, we derive equations of motion that account for higher-order correlations generated by interactions.<n>Our results show that an accurate treatment of fluctuations is essential for describing macroscopic dynamics in quantum many-body systems.
  arXiv  Detail & Related papers  (2026-05-26T15:53:43Z)
• Dynamical entanglement percolation with spatially correlated disorder [0.0]
  We investigate the dynamics of a network of qubits where each edge corresponds to an independent two-qubit interaction.<n>We show that the interplay between unitary evolution and spatially correlated disorder leads to a non-standard percolationenology.<n>A two-colour correlated bond percolation model, whose phase diagram is determined via numerical simulations and a mean-field theory, fully elucidates the physics behind this phenomenon.
  arXiv  Detail & Related papers  (2026-01-09T16:38:25Z)
• Evolution of multi-qubit correlations driven by mutual interactions [49.1574468325115]
  We analyze the evolution of the correlation tensor elements of quantum systems composed of $frac12$-spins.<n>We show how a strong external field can play a stabilizing factor with respect to certain correlation characteristics.
  arXiv  Detail & Related papers  (2025-07-01T11:45:08Z)
• Exploring the Nexus of Many-Body Theories through Neural Network Techniques: the Tangent Model [4.955567578189708]
  We present a physically informed neural network representation of the effective interactions associated with coupled-cluster downfolding models. The representation allows us to evaluate the effective interactions efficiently for various geometrical configurations of chemical systems.
  arXiv  Detail & Related papers  (2025-01-27T05:36:55Z)
• Learning Coarse-Grained Dynamics on Graph [4.692217705215042]
  We consider a Graph Neural Network (GNN) non-Markovian modeling framework to identify coarse-grained dynamical systems on graphs. Our main idea is to systematically determine the GNN architecture by inspecting how the leading term of the Mori-Zwanzig memory term depends on the coarse-grained interaction coefficients that encode the graph topology.
  arXiv  Detail & Related papers  (2024-05-15T13:25:34Z)
• An analysis of the relative effects of connectivity and coupling interactions on spin networks emulating the D-Wave 2000Q quantum annealer [0.19116784879310028]
  We show strong positive spatial correlations in qubits connected to qubits outside their own unit cell. We then show that correlation between nodes is affected by a number of factors. This highlights the importance of understanding the architectural features and potentially unprogrammed interactions/connections.
  arXiv  Detail & Related papers  (2024-05-14T13:51:05Z)
• SimCalib: Graph Neural Network Calibration based on Similarity between Nodes [60.92081159963772]
  Graph neural networks (GNNs) have exhibited impressive performance in modeling graph data as exemplified in various applications. We shed light on the relationship between GNN calibration and nodewise similarity via theoretical analysis. A novel calibration framework, named SimCalib, is accordingly proposed to consider similarity between nodes at global and local levels.
  arXiv  Detail & Related papers  (2023-12-19T04:58:37Z)
• Causally-guided Regularization of Graph Attention Improves Generalizability [69.09877209676266]
  We introduce CAR, a general-purpose regularization framework for graph attention networks. Methodname aligns the attention mechanism with the causal effects of active interventions on graph connectivity. For social media network-sized graphs, a CAR-guided graph rewiring approach could allow us to combine the scalability of graph convolutional methods with the higher performance of graph attention.
  arXiv  Detail & Related papers  (2022-10-20T01:29:10Z)
• Relation Embedding based Graph Neural Networks for Handling Heterogeneous Graph [58.99478502486377]
  We propose a simple yet efficient framework to make the homogeneous GNNs have adequate ability to handle heterogeneous graphs. Specifically, we propose Relation Embedding based Graph Neural Networks (RE-GNNs), which employ only one parameter per relation to embed the importance of edge type relations and self-loop connections.
  arXiv  Detail & Related papers  (2022-09-23T05:24:18Z)
• Learning Heterogeneous Interaction Strengths by Trajectory Prediction with Graph Neural Network [0.0]
  We propose the attentive relational inference network (RAIN) to infer continuously weighted interaction graphs without any ground-truth interaction strengths. We show that our RAIN model with the PA mechanism accurately infers continuous interaction strengths for simulated physical systems in an unsupervised manner.
  arXiv  Detail & Related papers  (2022-08-28T09:13:33Z)
• Constructing Tensor Network Influence Functionals for General Quantum Dynamics [0.0]
  We use a space-time tensor network representation of the influence functional and investigate its approximability in terms of the bond dimensions and time-like entanglement. We find that the influence functional and the intermediates involved in its construction can be efficiently approximated by low bond dimension tensor networks in certain dynamical regimes. As one iteratively integrates out the bath, the correlations in the influence functional can first increase before decreasing, indicating that the final compressibility of the influence functional is achieved via non-trivial cancellation.
  arXiv  Detail & Related papers  (2021-01-14T05:42:25Z)
• Graph Neural Network for Hamiltonian-Based Material Property Prediction [56.94118357003096]
  We present and compare several different graph convolution networks that are able to predict the band gap for inorganic materials. The models are developed to incorporate two different features: the information of each orbital itself and the interaction between each other. The results show that our model can get a promising prediction accuracy with cross-validation.
  arXiv  Detail & Related papers  (2020-05-27T13:32:10Z)
• Multi-View Graph Neural Networks for Molecular Property Prediction [67.54644592806876]
  We present Multi-View Graph Neural Network (MV-GNN), a multi-view message passing architecture. In MV-GNN, we introduce a shared self-attentive readout component and disagreement loss to stabilize the training process. We further boost the expressive power of MV-GNN by proposing a cross-dependent message passing scheme.
  arXiv  Detail & Related papers  (2020-05-17T04:46:07Z)
• InteractionNet: Modeling and Explaining of Noncovalent Protein-Ligand Interactions with Noncovalent Graph Neural Network and Layer-Wise Relevance Propagation [0.0]
  We propose a graph neural network architecture to learn noncovalent protein-ligand interactions. We show that our model successfully predicted the noncovalent interactions in both performance and relevance in chemical interpretation.
  arXiv  Detail & Related papers  (2020-05-12T12:46:44Z)
• Tensor Graph Convolutional Networks for Multi-relational and Robust Learning [74.05478502080658]
  This paper introduces a tensor-graph convolutional network (TGCN) for scalable semi-supervised learning (SSL) from data associated with a collection of graphs, that are represented by a tensor. The proposed architecture achieves markedly improved performance relative to standard GCNs, copes with state-of-the-art adversarial attacks, and leads to remarkable SSL performance over protein-to-protein interaction networks.
  arXiv  Detail & Related papers  (2020-03-15T02:33:21Z)

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.