Imperfect Graphs from Unitary Matrices -- I

• URL: http://arxiv.org/abs/2602.21808v2
• Date: Sat, 28 Feb 2026 07:21:08 GMT
• Title: Imperfect Graphs from Unitary Matrices -- I
• Authors: Wesley Lewis, Darsh Pareek, Umesh Kumar, Ravi Janjam,
• Abstract summary: Matrix representations of quantum operators are computationally complete but often obscure the structural topology of information flow within a quantum circuit.<n>We introduce a generalized graph-theoretic framework for analyzing quantum operators by mapping unitary matrices to directed graphs.<n>This framework provides a novel perspective for viewing quantum circuits as discrete dynamical systems.
• Score: 0.8149698201875037
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Matrix representations of quantum operators are computationally complete but often obscure the structural topology of information flow within a quantum circuit \cite{nielsen2000}. In this paper, we introduce a generalized graph-theoretic framework for analyzing quantum operators by mapping unitary matrices to directed graphs; we term these structures \emph{Imperfect Graphs} or more formally as \emph{Topological Structure of Superpositions}(TSS) as a tool to devise better Quantum Algorithms. In this framework, we represent computational basis states as vertices. A directed edge exists between two vertices if and only if there is a non-zero amplitude transition between them, effectively mapping the support of the unitary operator. In this paper we deliberately discard probability amplitudes and phase information to isolate the connectivity and reachability properties of the operator. We demonstrate how TSS intuitively helps describe gates such as the Hadamard, Pauli-(X,Y,Z) gates, etc \cite{nielsen2000}. This framework provides a novel perspective for viewing quantum circuits as discrete dynamical systems \cite{childs2009,aharonov2001} Keywords: Quantum Algorithms, Unitary Matrix Approach, Topological Structure of Superpositions (TSS), Graph Theory

Related papers

• Quantum Algorithms for Approximate Graph Isomorphism Testing [0.0]
  We study the quantum query complexity of approximate graph isomorphism testing.<n>We present a quantum algorithm based on MNRS quantum walk search over the product graph $(G,H)$ of the two input graphs.
  arXiv  Detail & Related papers  (2026-03-03T06:43:41Z)
• Stationarity and Spectral Characterization of Random Signals on Simplicial Complexes [45.01439616647312]
  We propose a probabilistic framework for random signals defined on simplicial complexes.<n>Specifically, we generalize the classical notion of stationarity.<n>We empirically demonstrate the practicality of these benefits through multiple synthetic and real-world simulations.
  arXiv  Detail & Related papers  (2026-02-03T03:31:10Z)
• Symmetric and Antisymmetric Quantum States from Graph Structure and Orientation [0.0]
  We prove that a graph state is fully symmetric under particle permutations if and only if the underlying graph is complete.<n>We show that complete directed graphs endowed with appropriate orientations, for an odd number of qudits generate fully antisymmetric multipartite states.
  arXiv  Detail & Related papers  (2026-01-27T18:12:52Z)
• Emergent statistical mechanics in holographic random tensor networks [41.99844472131922]
  We show that RTN states equilibrate at large bond dimension and also in the scaling limit for three classes of geometries.<n>We reproduce a holographic degree-of-freedom counting for the effective dimension of each system.<n>These results demonstrate that RTN techniques can probe aspects of late-time dynamics of quantum many-body phases.
  arXiv  Detail & Related papers  (2025-08-22T17:49:49Z)
• Construction and Rigorous Analysis of Quantum-Like States [0.0]
  This work adds mathematical rigor to the analysis of single Quantum-Like (QL) bits constructed by eigenvectors of the adjacency matrices of such networks.<n>We show that symmetric construction of such networks leads to an equal superposition of the $|+rangle, |-rangle$ Hadamard states.<n>We also prove two methods to construct any arbitrary single qubit state $|psirangle = a|0rangle + b|1rangle,, |a|2+|b|2=1$.
  arXiv  Detail & Related papers  (2025-07-28T19:22:32Z)
• Solving graph problems using permutation-invariant quantum machine learning [35.99391901074448]
  In quantum machine learning, the ansatz can be tuned to correspond to the specific symmetry of the problem.<n>We show how the symmetry can be included in the quantum circuit in a straightforward constructive method.
  arXiv  Detail & Related papers  (2025-05-19T06:44:03Z)
• High-Rank Irreducible Cartesian Tensor Decomposition and Bases of Equivariant Spaces [48.465738895704455]
  We construct path matrices for decomposition of Cartesian tensors up to rank $n=9$ with reduced and affordable complexity.<n>Our method avoids the RREF algorithm and maintains a fully analytical derivation of each ICT decomposition matrix.<n>We extend our result to the arbitrary tensor product and direct sum spaces, enabling free design between different spaces while keeping symmetry.
  arXiv  Detail & Related papers  (2024-12-24T08:25:38Z)
• Gaussian Entanglement Measure: Applications to Multipartite Entanglement of Graph States and Bosonic Field Theory [50.24983453990065]
  An entanglement measure based on the Fubini-Study metric has been recently introduced by Cocchiarella and co-workers. We present the Gaussian Entanglement Measure (GEM), a generalization of geometric entanglement measure for multimode Gaussian states. By providing a computable multipartite entanglement measure for systems with a large number of degrees of freedom, we show that our definition can be used to obtain insights into a free bosonic field theory.
  arXiv  Detail & Related papers  (2024-01-31T15:50:50Z)
• Latent Random Steps as Relaxations of Max-Cut, Min-Cut, and More [30.919536115917726]
  We present a probabilistic model based on non-negative matrix factorization which unifies clustering and simplification. By relaxing the hard clustering to a soft clustering, our algorithm relaxes potentially hard clustering problems to a tractable ones.
  arXiv  Detail & Related papers  (2023-08-12T02:47:57Z)
• Relaxations and Exact Solutions to Quantum Max Cut via the Algebraic Structure of Swap Operators [0.3177496877224142]
  The Quantum Max Cut (QMC) problem has emerged as a test-problem for designing approximation algorithms for local Hamiltonian problems. In this paper we attack this problem using the algebraic structure of QMC, in particular the relationship between the quantum max cut Hamiltonian and the representation theory of the symmetric group.
  arXiv  Detail & Related papers  (2023-07-28T16:45:16Z)
• Graph Spectral Embedding using the Geodesic Betweeness Centrality [76.27138343125985]
  We introduce the Graph Sylvester Embedding (GSE), an unsupervised graph representation of local similarity, connectivity, and global structure. GSE uses the solution of the Sylvester equation to capture both network structure and neighborhood proximity in a single representation.
  arXiv  Detail & Related papers  (2022-05-07T04:11:23Z)
• 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)
• Graph Kernel Neural Networks [53.91024360329517]
  We propose to use graph kernels, i.e. kernel functions that compute an inner product on graphs, to extend the standard convolution operator to the graph domain. This allows us to define an entirely structural model that does not require computing the embedding of the input graph. Our architecture allows to plug-in any type of graph kernels and has the added benefit of providing some interpretability.
  arXiv  Detail & Related papers  (2021-12-14T14:48:08Z)
• Laplacian Eigenmaps with variational circuits: a quantum embedding of graph data [0.0]
  We propose a method to compute a Laplacian Eigenmap using a quantum variational circuit. Tests on 32 nodes graph with a quantum simulator show that we can achieve similar performances as the classical laplacian eigenmap algorithm.
  arXiv  Detail & Related papers  (2020-11-10T14:51:25Z)
• Approximate Graph Spectral Decomposition with the Variational Quantum Eigensolver [1.0152838128195465]
  Spectral graph theory studies the relationships between the eigenvectors and eigenvalues of Laplacian and adjacency matrices and their associated graphs. The Variational Quantum Eigensolver (VQE) algorithm was proposed as a hybrid quantum/classical algorithm. In this paper, we will expand upon the VQE algorithm to analyze the spectra of directed and undirected graphs.
  arXiv  Detail & Related papers  (2019-12-27T23:27:38Z)

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.