Quantum routing in planar graph using perfect state transfer

• URL: http://arxiv.org/abs/2302.10074v1
• Date: Mon, 20 Feb 2023 16:30:23 GMT
• Title: Quantum routing in planar graph using perfect state transfer
• Authors: Supriyo Dutta
• Abstract summary: In this article, we consider a spin-spin interaction network governed by $XX + YY$ Hamiltonian. We take a privilege to switch on or off any interaction, that assists us to perform multiple perfect state transfers in a graph simultaneously.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this article, we consider a spin-spin interaction network governed by $XX + YY$ Hamiltonian. The vertices and edges of the network represent the spin objects and their interactions, respectively. We take a privilege to switch on or off any interaction, that assists us to perform multiple perfect state transfers in a graph simultaneously. We also build up a salable network allowing quantum communication between two arbitrary vertices. Later we utilize the combinatorial characteristics of hypercube graphs to propose a static routing schema to communicate simultaneously between a set of senders and a set of receivers in a planar network. Our construction is new and significantly powerful. We elaborate multiple examples of planar graphs supporting quantum routing where classical routing is not possible.

Related papers

• Bell pair extraction using graph foliage techniques [0.0]
  We are interested in whether multiple pairs can communicate simultaneously across a network. Quantum networks can be represented with graph states, and producing communication links amounts to performing certain quantum operations on graph states.
  arXiv  Detail & Related papers  (2023-11-25T22:33:29Z)
• You Only Transfer What You Share: Intersection-Induced Graph Transfer Learning for Link Prediction [79.15394378571132]
  We investigate a previously overlooked phenomenon: in many cases, a densely connected, complementary graph can be found for the original graph. The denser graph may share nodes with the original graph, which offers a natural bridge for transferring selective, meaningful knowledge. We identify this setting as Graph Intersection-induced Transfer Learning (GITL), which is motivated by practical applications in e-commerce or academic co-authorship predictions.
  arXiv  Detail & Related papers  (2023-02-27T22:56:06Z)
• Routing a quantum state in a bio-inspired network [0.0]
  We consider a spin network resembling an $alpha$-helix structure and study quantum information transfer over this network. We investigate analytically and numerically the perfect state transfer (PST) in such a network which provides an upper bound on the probability of quantum states transfer from one node to another.
  arXiv  Detail & Related papers  (2022-11-25T15:27:26Z)
• Dynamic Graph Message Passing Networks for Visual Recognition [112.49513303433606]
  Modelling long-range dependencies is critical for scene understanding tasks in computer vision. A fully-connected graph is beneficial for such modelling, but its computational overhead is prohibitive. We propose a dynamic graph message passing network, that significantly reduces the computational complexity.
  arXiv  Detail & Related papers  (2022-09-20T14:41:37Z)
• Advantages and limitations of quantum routing [1.4050836886292872]
  Genuinely quantum operations could outperform Swap for the task of permuting qubits within an architecture. We consider quantum routing in two models: (1) allowing arbitrary two-qubit unitaries, or (2) allowing Hamiltonians with norm-bounded interactions.
  arXiv  Detail & Related papers  (2022-06-03T18:00:15Z)
• Optimized Quantum Networks [68.8204255655161]
  Quantum networks offer the possibility to generate different kinds of entanglement prior to network requests. We utilize this to design entanglement-based quantum networks tailored to their desired functionality.
  arXiv  Detail & Related papers  (2021-07-21T18:00:07Z)
• Cost vector analysis & multi-path entanglement routing in quantum networks [0.0]
  We present a framework for analysing quantum routing protocols that we call the textitcost-vector formalism. We develop rudimentary greedy algorithms for routing in this framework and test them over a variety of toy networking scenarios. Our results indicate that congestion in quantum networks does not improve significantly when more nodes (computers) are added. Rather, we find that congestion is all but eliminated by waiting a small amount of time.
  arXiv  Detail & Related papers  (2021-05-02T08:26:29Z)
• Dynamic Graph: Learning Instance-aware Connectivity for Neural Networks [78.65792427542672]
  Dynamic Graph Network (DG-Net) is a complete directed acyclic graph, where the nodes represent convolutional blocks and the edges represent connection paths. Instead of using the same path of the network, DG-Net aggregates features dynamically in each node, which allows the network to have more representation ability.
  arXiv  Detail & Related papers  (2020-10-02T16:50:26Z)
• Graph Neural Networks: Architectures, Stability and Transferability [176.3960927323358]
  Graph Neural Networks (GNNs) are information processing architectures for signals supported on graphs. They are generalizations of convolutional neural networks (CNNs) in which individual layers contain banks of graph convolutional filters.
  arXiv  Detail & Related papers  (2020-08-04T18:57:36Z)
• Natural Graph Networks [80.77570956520482]
  We show that the more general concept of naturality is sufficient for a graph network to be well-defined. We define global and local natural graph networks, the latter of which are as scalable as conventional message passing graph neural networks.
  arXiv  Detail & Related papers  (2020-07-16T14:19:06Z)

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.