Boson subtraction as an alternative to fusion gates for generating graph states

• URL: http://arxiv.org/abs/2306.15148v2
• Date: Tue, 13 Feb 2024 13:00:50 GMT
• Title: Boson subtraction as an alternative to fusion gates for generating graph states
• Authors: Seungbeom Chin
• Abstract summary: We propose an alternative approach to generate graph states based on the graph picture of linear quantum networks (LQG picture) These subtraction schemes correspond to efficient heralded optical setups with single-photon sources and more flexible measurement elements than fusion gates.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Qubit graph states are essential computational resources in measurement-based quantum computations (MBQC). The most well-known method to generate graph states in optics is to use fusion gates, which in many cases require expensive entangled resource states. In this work, we propose an alternative approach to generate graph states based on the graph picture of linear quantum networks (LQG picture), through which we can devise schemes that generate caterpillar graph states with boson subtractions. These subtraction schemes correspond to efficient heralded optical setups with single-photon sources and more flexible measurement elements than fusion gates. Caterpillar graph states encompass various useful graph structures for one-way quantum computing, such as linear graphs, star graphs, and networks of star graphs. We can exploit them as resources for generating cluster states using conventional Type II fusion gates. Our results demonstrate that the boson subtraction operator is a more general concept that encompasses and can therefore optimize fusion gates.

Related papers

• Heralded arbitrary graph states with inefficient quantum emitters [2.612403257963011]
  Quantum emitter-based schemes for the generation of photonic graph states offer a promising, resource efficient methodology. We present a heralded scheme for making photonic graph states that is compatible with the typically poor photon collection from state-of-the-art emitters.
  arXiv  Detail & Related papers  (2024-05-22T00:24:01Z)
• Transforming graph states via Bell state measurements [0.0]
  Graph states are key resources for measurement-based quantum computing. Fusions are probabilistic Bell state measurements measuring pairs of parity operators of two qubits. We derive graph transformations for all fusion types showing that there are five different types of fusion success cases.
  arXiv  Detail & Related papers  (2024-05-03T18:16:25Z)
• Multipartite Entanglement Distribution in Quantum Networks using Subgraph Complementations [9.32782060570252]
  We propose a novel approach for distributing graph states across a quantum network. We show that the distribution of graph states can be characterized by a system of subgraph complementations. We find a close to optimal sequence of subgraph complementation operations to distribute an arbitrary graph state.
  arXiv  Detail & Related papers  (2023-08-25T23:03:25Z)
• NodeFormer: A Scalable Graph Structure Learning Transformer for Node Classification [70.51126383984555]
  We introduce a novel all-pair message passing scheme for efficiently propagating node signals between arbitrary nodes. The efficient computation is enabled by a kernerlized Gumbel-Softmax operator. Experiments demonstrate the promising efficacy of the method in various tasks including node classification on graphs.
  arXiv  Detail & Related papers  (2023-06-14T09:21:15Z)
• Graph-theoretical optimization of fusion-based graph state generation [0.0]
  We present a graph-theoretical strategy to effectively optimize fusion-based generation of any given graph state, along with a Python package OptGraphState. Our strategy comprises three stages: simplifying the target graph state, building a fusion network, and determining the order of fusions.
  arXiv  Detail & Related papers  (2023-04-24T10:46:54Z)
• 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)
• Training Graph Neural Networks on Growing Stochastic Graphs [114.75710379125412]
  Graph Neural Networks (GNNs) rely on graph convolutions to exploit meaningful patterns in networked data. We propose to learn GNNs on very large graphs by leveraging the limit object of a sequence of growing graphs, the graphon.
  arXiv  Detail & Related papers  (2022-10-27T16:00:45Z)
• Near-deterministic hybrid generation of arbitrary photonic graph states using a single quantum emitter and linear optics [0.0]
  We introduce near-deterministic solutions for the generation of graph states using the current quantum emitter capabilities. Our results should pave the way towards the practical implementation of resource-efficient quantum information processing.
  arXiv  Detail & Related papers  (2022-05-19T17:59:59Z)
• Spectral Graph Convolutional Networks With Lifting-based Adaptive Graph Wavelets [81.63035727821145]
  Spectral graph convolutional networks (SGCNs) have been attracting increasing attention in graph representation learning. We propose a novel class of spectral graph convolutional networks that implement graph convolutions with adaptive graph wavelets.
  arXiv  Detail & Related papers  (2021-08-03T17:57:53Z)
• Dirichlet Graph Variational Autoencoder [65.94744123832338]
  We present Dirichlet Graph Variational Autoencoder (DGVAE) with graph cluster memberships as latent factors. Motivated by the low pass characteristics in balanced graph cut, we propose a new variant of GNN named Heatts to encode the input graph into cluster memberships.
  arXiv  Detail & Related papers  (2020-10-09T07:35:26Z)
• Graph Pooling with Node Proximity for Hierarchical Representation Learning [80.62181998314547]
  We propose a novel graph pooling strategy that leverages node proximity to improve the hierarchical representation learning of graph data with their multi-hop topology. Results show that the proposed graph pooling strategy is able to achieve state-of-the-art performance on a collection of public graph classification benchmark datasets.
  arXiv  Detail & Related papers  (2020-06-19T13:09: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.