Graphical Language with Delayed Trace: Picturing Quantum Computing with Finite Memory

• URL: http://arxiv.org/abs/2102.03133v2
• Date: Wed, 28 Apr 2021 16:03:54 GMT
• Title: Graphical Language with Delayed Trace: Picturing Quantum Computing with Finite Memory
• Abstract summary: We describe a general construction that extends any graphical language, equipped with a notion of discarding, to a graphical language of finite memory computations. In order to handle cases like the ZX-calculus, which is complete for post-selected quantum mechanics, we extend the delayed trace formalism beyond the causal case. We design a stream semantics based on stateful morphism sequences and, under some assumptions, show universality and completeness results.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-sa/4.0/
• Abstract: Graphical languages, like quantum circuits or ZX-calculus, have been successfully designed to represent (memoryless) quantum computations acting on a finite number of qubits. Meanwhile, delayed traces have been used as a graphical way to represent finite-memory computations on streams, in a classical setting (cartesian data types). We merge those two approaches and describe a general construction that extends any graphical language, equipped with a notion of discarding, to a graphical language of finite memory computations. In order to handle cases like the ZX-calculus, which is complete for post-selected quantum mechanics, we extend the delayed trace formalism beyond the causal case, refining the notion of causality for stream transformers. We design a stream semantics based on stateful morphism sequences and, under some assumptions, show universality and completeness results. Finally, we investigate the links of our framework with previous works on cartesian data types, signal flow graphs, and quantum channels with memories.

Related papers

• Scalable Message-Passing Quantum Graph Neural Networks in the Weisfeiler-Leman Hierarchy [1.4675095722281564]
  We show how a quantum graph neural network can be built to perform message passing, to be permutation equivariant, and to sit at a chosen level of the Weisfeiler-Leman hierarchy.<n>We validate the framework in large-scale simulations of up to 56 qubits across three datasets.
  arXiv  Detail & Related papers  (2026-06-25T10:58:29Z)
• Minimal Quantum Reservoirs with Hamiltonian Encoding [72.27323884094953]
  We investigate a minimal architecture for quantum reservoir computing based on Hamiltonian encoding.<n>This approach circumvents many of the experimental overheads typically associated with quantum machine learning.
  arXiv  Detail & Related papers  (2025-05-28T16:50:05Z)
• An Efficient Quantum Classifier Based on Hamiltonian Representations [50.467930253994155]
  Quantum machine learning (QML) is a discipline that seeks to transfer the advantages of quantum computing to data-driven tasks. We propose an efficient approach that circumvents the costs associated with data encoding by mapping inputs to a finite set of Pauli strings. We evaluate our approach on text and image classification tasks, against well-established classical and quantum models.
  arXiv  Detail & Related papers  (2025-04-13T11:49:53Z)
• Fast classical simulation of quantum circuits via parametric rewriting in the ZX-calculus [0.0]
  We show that it is possible to perform the final stage of classical simulation quickly utilising a high degree of GPU parallelism. We demonstrate speedups upwards of 100x for certain classical simulation tasks vs. the non-parametric approach.
  arXiv  Detail & Related papers  (2024-03-11T14:44:59Z)
• Rewriting and Completeness of Sum-Over-Paths in Dyadic Fragments of Quantum Computing [0.0]
  We give here a new set of rewrite rules for the formalism "Sum-Over-Paths" We show that it is complete for "Toffoli-Hadamard", the simplest approximately universal fragment of quantum mechanics. We also show how to perform sums and concatenation of arbitrary terms.
  arXiv  Detail & Related papers  (2023-07-26T14:40:21Z)
• Unitary Coined Discrete-Time Quantum Walks on Directed Multigraphs [1.2183405753834557]
  Unitary Coined Discrete-Time Quantum Walks (UC-DTQW) constitute a universal model of quantum computation. Current quantum computers work based on the quantum circuit model of computation.
  arXiv  Detail & Related papers  (2023-04-04T07:19:55Z)
• 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)
• Encoding High-level Quantum Programs as SZX-diagrams [0.0]
  We present a method to encode quantum programs implemented in a fragment of the linear dependently typed Proto-Quipper-D language as families of SZX-diagrams. We define a subset of translatable Proto-Quipper-D programs and show that our procedure is able to encode non-trivial algorithms as diagrams that grow linearly on the size of the program.
  arXiv  Detail & Related papers  (2022-06-19T10:52:19Z)
• 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)
• GNNAutoScale: Scalable and Expressive Graph Neural Networks via Historical Embeddings [51.82434518719011]
  GNNAutoScale (GAS) is a framework for scaling arbitrary message-passing GNNs to large graphs. Gas prunes entire sub-trees of the computation graph by utilizing historical embeddings from prior training iterations. Gas reaches state-of-the-art performance on large-scale graphs.
  arXiv  Detail & Related papers  (2021-06-10T09:26:56Z)
• High-performance symbolic-numerics via multiple dispatch [52.77024349608834]
  Symbolics.jl is an extendable symbolic system which uses dynamic multiple dispatch to change behavior depending on the domain needs. We show that by formalizing a generic API on actions independent of implementation, we can retroactively add optimized data structures to our system. We demonstrate the ability to swap between classical term-rewriting simplifiers and e-graph-based term-rewriting simplifiers.
  arXiv  Detail & Related papers  (2021-05-09T14:22:43Z)
• Quantum Algorithms and Oracles with the Scalable ZX-calculus [0.0]
  We show that the scalable ZX-calculus provides a formal, intuitive, and compact framework to describe and prove quantum algorithms. We consider the standard oracle-based quantum algorithms: Deutsch-Jozsa, Bernstein-Vazirani, Simon, and Grover algorithms.
  arXiv  Detail & Related papers  (2021-04-02T13:27:48Z)
• Facial Expression Recognition on a Quantum Computer [68.8204255655161]
  We show a possible solution to facial expression recognition using a quantum machine learning approach. We define a quantum circuit that manipulates the graphs adjacency matrices encoded into the amplitudes of some appropriately defined quantum states.
  arXiv  Detail & Related papers  (2021-02-09T13:48:00Z)
• Graphical Calculi and their Conjecture Synthesis [0.0]
  This thesis introduces such inference and verification frameworks, in doing so forging novel links between graphical calculi and fields such as Algebraic Geometry and Galois Theory. The calculus RING is initial among ring-based qubit graphical calculi, and in turn inspired the introduction and classification of phase homomorphism pairs also presented here. The second is the calculus ZQ, an edge-decorated calculus which naturally expresses arbitrary qubit rotations, eliminating the need for non-linear rules such as (EU) of ZX.
  arXiv  Detail & Related papers  (2020-10-08T11:54:44Z)
• PBS-Calculus: A Graphical Language for Coherent Control of Quantum Computations [77.34726150561087]
  We introduce the PBS-calculus to represent and reason on quantum computations involving coherent control of quantum operations. We equip the language with an equational theory, which is proved to be sound and complete. We consider applications like the implementation of controlled permutations and the unrolling of loops.
  arXiv  Detail & Related papers  (2020-02-21T16:15:58Z)

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.