Categorical Tensor-Graph Semantics for Quantum Algorithms

• URL: http://arxiv.org/abs/2607.12128v1
• Date: Mon, 13 Jul 2026 20:21:14 GMT
• Title: Categorical Tensor-Graph Semantics for Quantum Algorithms
• Abstract summary: We provide a comprehensive topological reinterpretation of the Bernstein-Vazirani and the Simon algorithms.<n>We formalize the qutrit-adapted generalized Deutsch-Jozsa algorithm and the generalized single-shot Grover algorithm.<n>By bridging tensor category theory with practical quantum algorithmic design, this work furnishes composable, scalable diagrammatic toolkit.
• Score: 2.9154614146096947
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: This paper systematically investigates quantum computing protocols from the intuitive perspective of categorical tensor-graph semantics within the category FHilb. While conventional Hilbert-space formalisms conceal the structural nature of quantum algorithms behind high-dimensional matrix operations, the topological framework developed herein directly encodes algorithmic functionalities to their graphical skeletons. We provide a comprehensive topological reinterpretation of the Bernstein-Vazirani and the Simon algorithms, demonstrating how topological transformations distill their core mathematical essence and clarify the operational mechanism of oracles. Going beyond standard qubit models, we formalize the qutrit-adapted generalized Deutsch-Jozsa algorithm as well as the generalized single-shot Grover algorithm, explicitly laying out their graphical representations. We further implement CNOT gates via complementary Frobenius structures, trace the diagrammatic genesis of quantum entanglement including Bell and GHZ states, and present a diagrammatic simplification for W-state preparation protocol. By bridging tensor category theory with practical quantum algorithmic design, this work furnishes composable, scalable diagrammatic toolkit essential for automated circuit optimization across the evolving quantum hardware ecosystem.

Related papers

• TopoFormer: Topology Meets Attention for Graph Learning [8.679678575739304]
  We introduce Topoformer, a framework for graph representation learning that encodes topological structure into attention-friendly sequences.<n>At the core of our method is Topo-Scan, a novel module that decomposes a graph into a short, ordered sequence of topological tokens.
  arXiv  Detail & Related papers  (2026-07-30T14:18:17Z)
• A Quantum-Inspired Algorithm for Graph Isomorphism [0.0]
  We critically assess a proposed quantum algorithm for the graph isomorphism problem, implemented on a photonic quantum device.<n>Inspired by the nature of this quantum algorithm, we formulate a necessary condition for the isomorphism of graphs encoded in Gaussian boson samplers and a classical algorithm to test for it.<n>We analyze our algorithm in the context of the inspiring, sampler-based quantum algorithm of Brdler et. al., the classical color refinement algorithm, and the state-of-the-art quasi-polynomial Babai algorithm.
  arXiv  Detail & Related papers  (2025-12-30T19:02:48Z)
• From Betti Numbers to Persistence Diagrams: A Hybrid Quantum Algorithm for Topological Data Analysis [6.162927852040885]
  Existing quantum topological algorithms can only efficiently compute summary statistics like Betti numbers.<n>This paper proposes a novel quantum-classical hybrid algorithm that achieves, for the first time, the leap from "quantum of computation Betti numbers" to "quantum acquisition of practical persistence diagrams"
  arXiv  Detail & Related papers  (2025-12-01T00:40:29Z)
• End-to-End Quantum Algorithm for Topology Optimization in Structural Mechanics [1.6943815984028532]
  We present an end-to-end, fault-tolerant quantum algorithm for topology optimization.<n>The proposed quantum workflow demonstrates how quantum algorithms can advance the field of computational science and engineering.
  arXiv  Detail & Related papers  (2025-10-08T17:42:28Z)
• Topological network analysis using a programmable photonic quantum processor [3.0018652145221614]
  We develop a universal programmable quantum processor that enables the encoding of arbitrary complex-weight networks.<n>We show how this quantum approach can identify weighted $k$-cliques and estimate Betti numbers.<n>These findings showcase how photonic quantum computing can be applied to analyse the topological characteristics of real-world networks.
  arXiv  Detail & Related papers  (2025-07-10T20:33:52Z)
• Building holographic code from the boundary [4.443525249044746]
  Holographic quantum error-correcting code, the quantum-information structure hypothesized for the AdS/CFT correspondence, has been attracting increasing attention in new directions. We initiate a novel approach for building holographic code that can be applied in potentially broad and interdisciplinary contexts.
  arXiv  Detail & Related papers  (2024-07-14T16:51:17Z)
• Hybrid Quantum-Classical Machine Learning with String Diagrams [49.1574468325115]
  This paper develops a formal framework for describing hybrid algorithms in terms of string diagrams. A notable feature of our string diagrams is the use of functor boxes, which correspond to a quantum-classical interfaces.
  arXiv  Detail & Related papers  (2024-07-04T06:37:16Z)
• Higher-order topological kernels via quantum computation [68.8204255655161]
  Topological data analysis (TDA) has emerged as a powerful tool for extracting meaningful insights from complex data. We propose a quantum approach to defining Betti kernels, which is based on constructing Betti curves with increasing order.
  arXiv  Detail & Related papers  (2023-07-14T14:48:52Z)
• The Quantum Path Kernel: a Generalized Quantum Neural Tangent Kernel for Deep Quantum Machine Learning [52.77024349608834]
  Building a quantum analog of classical deep neural networks represents a fundamental challenge in quantum computing. Key issue is how to address the inherent non-linearity of classical deep learning. We introduce the Quantum Path Kernel, a formulation of quantum machine learning capable of replicating those aspects of deep machine learning.
  arXiv  Detail & Related papers  (2022-12-22T16:06:24Z)
• 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)
• Fractal Structure and Generalization Properties of Stochastic Optimization Algorithms [71.62575565990502]
  We prove that the generalization error of an optimization algorithm can be bounded on the complexity' of the fractal structure that underlies its generalization measure. We further specialize our results to specific problems (e.g., linear/logistic regression, one hidden/layered neural networks) and algorithms.
  arXiv  Detail & Related papers  (2021-06-09T08:05:36Z)
• The Hintons in your Neural Network: a Quantum Field Theory View of Deep Learning [84.33745072274942]
  We show how to represent linear and non-linear layers as unitary quantum gates, and interpret the fundamental excitations of the quantum model as particles. On top of opening a new perspective and techniques for studying neural networks, the quantum formulation is well suited for optical quantum computing.
  arXiv  Detail & Related papers  (2021-03-08T17:24:29Z)
• Joint Network Topology Inference via Structured Fusion Regularization [70.30364652829164]
  Joint network topology inference represents a canonical problem of learning multiple graph Laplacian matrices from heterogeneous graph signals. We propose a general graph estimator based on a novel structured fusion regularization. We show that the proposed graph estimator enjoys both high computational efficiency and rigorous theoretical guarantee.
  arXiv  Detail & Related papers  (2021-03-05T04:42:32Z)

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.