Q2Graph: a modelling tool for measurement-based quantum computing

• URL: http://arxiv.org/abs/2210.00657v1
• Date: Mon, 3 Oct 2022 00:12:44 GMT
• Title: Q2Graph: a modelling tool for measurement-based quantum computing
• Authors: Greg Bowen and Simon Devitt
• Abstract summary: The quantum circuit model is the default for encoding an algorithm intended for a NISQ computer or a quantum computing simulator. A graph representation is well-suited for algorithms intended for a quantum computing facility founded on measurement-based quantum computing (MBQC) principles. We submit Q2Graph, a software package for designing and testing of simple graphs as algorithms for quantum computing facilities.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-sa/4.0/
• Abstract: The quantum circuit model is the default for encoding an algorithm intended for a NISQ computer or a quantum computing simulator. A simple graph and through it, a graph state - quantum state physically manifesting an abstract graph structure - is syntactically expressive and tractable. A graph representation is well-suited for algorithms intended for a quantum computing facility founded on measurement-based quantum computing (MBQC) principles. Indeed, the process of creating an algorithm-specific graph can be efficiently realised through classical computing hardware. A graph state is a stabiliser state, which means a graph is a (quantum) intermediate representation at all points of the algorithm-specific graph process. We submit Q2Graph, a software package for designing and testing of simple graphs as algorithms for quantum computing facilities based on MQBC design principles. Q2Graph is a suitable modelling tool for NISQ computing facilities: the user is free to reason about structure or characteristics of its graph-as-algorithm without also having to account for (quantum) errors and their impact upon state.

Related papers

• Quantum Algorithm for Testing Graph Completeness [0.0]
  Testing graph completeness is a critical problem in computer science and network theory. We present an efficient algorithm using the Szegedy quantum walk and quantum phase estimation (QPE) This approach is useful in network structure analysis, evaluating classical routing algorithms, and assessing systems based on pairwise comparisons.
  arXiv  Detail & Related papers  (2024-07-29T14:56:25Z)
• Quantum-assisted Rendezvous on Graphs: Explicit Algorithms and Quantum Computer Simulations [0.0]
  We study quantum advantage in one-step rendezvous games on simple graphs analytically, numerically, and using noisy intermediate-scale quantum (NISQ) processors.
  arXiv  Detail & Related papers  (2024-05-23T18:01:02Z)
• QuanGCN: Noise-Adaptive Training for Robust Quantum Graph Convolutional Networks [124.7972093110732]
  We propose quantum graph convolutional networks (QuanGCN), which learns the local message passing among nodes with the sequence of crossing-gate quantum operations. To mitigate the inherent noises from modern quantum devices, we apply sparse constraint to sparsify the nodes' connections. Our QuanGCN is functionally comparable or even superior than the classical algorithms on several benchmark graph datasets.
  arXiv  Detail & Related papers  (2022-11-09T21:43:16Z)
• Compilation of algorithm-specific graph states for quantum circuits [55.90903601048249]
  We present a quantum circuit compiler that prepares an algorithm-specific graph state from quantum circuits described in high level languages. The computation can then be implemented using a series of non-Pauli measurements on this graph state.
  arXiv  Detail & Related papers  (2022-09-15T14:52:31Z)
• From Quantum Graph Computing to Quantum Graph Learning: A Survey [86.8206129053725]
  We first elaborate the correlations between quantum mechanics and graph theory to show that quantum computers are able to generate useful solutions. For its practicability and wide-applicability, we give a brief review of typical graph learning techniques. We give a snapshot of quantum graph learning where expectations serve as a catalyst for subsequent research.
  arXiv  Detail & Related papers  (2022-02-19T02:56:47Z)
• 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)
• Benchmarking Small-Scale Quantum Devices on Computing Graph Edit Distance [52.77024349608834]
  Graph Edit Distance (GED) measures the degree of (dis)similarity between two graphs in terms of the operations needed to make them identical. In this paper we present a comparative study of two quantum approaches to computing GED.
  arXiv  Detail & Related papers  (2021-11-19T12:35:26Z)
• Quantum machine learning of graph-structured data [0.38581147665516596]
  We consider graph-structured quantum data and describe how to carry out its quantum machine learning via quantum neural networks. We explain how to systematically exploit this additional graph structure to improve quantum learning algorithms.
  arXiv  Detail & Related papers  (2021-03-19T14:39:19Z)
• Quantum walk processes in quantum devices [55.41644538483948]
  We study how to represent quantum walk on a graph as a quantum circuit. Our approach paves way for the efficient implementation of quantum walks algorithms on quantum computers.
  arXiv  Detail & Related papers  (2020-12-28T18:04:16Z)

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.