Quantum Tutte Embeddings

• URL: http://arxiv.org/abs/2307.08851v2
• Date: Tue, 25 Jul 2023 17:29:30 GMT
• Title: Quantum Tutte Embeddings
• Authors: Shion Fukuzawa, Michael T. Goodrich, Sandy Irani
• Abstract summary: This paper describes how to create a graph-drawing quantum circuit from a given graph. We show how a Tutte embedding can be calculated as a quantum state in this circuit that can then be sampled to extract the embedding.
• Score: 2.8981045877033993
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Using the framework of Tutte embeddings, we begin an exploration of \emph{quantum graph drawing}, which uses quantum computers to visualize graphs. The main contributions of this paper include formulating a model for quantum graph drawing, describing how to create a graph-drawing quantum circuit from a given graph, and showing how a Tutte embedding can be calculated as a quantum state in this circuit that can then be sampled to extract the embedding. To evaluate the complexity of our quantum Tutte embedding circuits, we compare them to theoretical bounds established in the classical computing setting derived from a well-known classical algorithm for solving the types of linear systems that arise from Tutte embeddings. We also present empirical results obtained from experimental quantum simulations.

Related papers

• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Algebraic Geometry of Quantum Graphical Models [0.0]
  We introduce the foundations to carry out a similar study of quantum counterparts. quantum graphical models are families of quantum states satisfying certain locality or correlation conditions encoded by a graph.
  arXiv  Detail & Related papers  (2023-08-22T16:07:07Z)
• Graph-theoretic insights on the constructability of complex entangled states [0.24578723416255752]
  We introduce the technique of local sparsification on experiment graphs, using which we answer a crucial open question in experimental quantum optics. This provides us with more insights into quantum resource theory, the limitation of specific quantum photonic systems and initiates the use of graph-theoretic techniques for designing quantum physics experiments.
  arXiv  Detail & Related papers  (2023-04-13T11:13:17Z)
• Visualizing Quantum Circuit Probability -- estimating computational action for quantum program synthesis [0.0]
  The probability of states in the circuit model of computation is defined. The reachability and expressibility in a space-time-bounded setting for classical and quantum gate sets are enumerated and visualized. The article suggests how applications like geometric quantum machine learning, novel quantum algorithm and quantum artificial general intelligence can benefit from studying circuit probabilities.
  arXiv  Detail & Related papers  (2023-04-05T10:49:36Z)
• Tensor Networks or Decision Diagrams? Guidelines for Classical Quantum Circuit Simulation [65.93830818469833]
  tensor networks and decision diagrams have independently been developed with differing perspectives, terminologies, and backgrounds in mind. We consider how these techniques approach classical quantum circuit simulation, and examine their (dis)similarities with regard to their most applicable abstraction level. We provide guidelines for when to better use tensor networks and when to better use decision diagrams in classical quantum circuit simulation.
  arXiv  Detail & Related papers  (2023-02-13T19:00:00Z)
• 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)
• 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)
• Equivariant Quantum Graph Circuits [10.312968200748116]
  We propose equivariant quantum graph circuits (EQGCs) as a class of parameterized quantum circuits with strong inductive bias for learning over graph-structured data. Our theoretical perspective on quantum graph machine learning methods opens many directions for further work, and could lead to models with capabilities beyond those of classical approaches.
  arXiv  Detail & Related papers  (2021-12-10T00:14:12Z)
• 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)
• Spectra of Perfect State Transfer Hamiltonians on Fractal-Like Graphs [62.997667081978825]
  We study the spectral features, on fractal-like graphs, of Hamiltonians which exhibit the special property of perfect quantum state transfer. The essential goal is to develop the theoretical framework for understanding the interplay between perfect quantum state transfer, spectral properties, and the geometry of the underlying graph.
  arXiv  Detail & Related papers  (2020-03-25T02:46:14Z)

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.