TSS Graphs for Hadamard Matrices: Real vs Complex

• URL: http://arxiv.org/abs/2609.16813v1
• Date: Tue, 15 Sep 2026 08:18:17 GMT
• Title: TSS Graphs for Hadamard Matrices: Real vs Complex
• Abstract summary: We show that Hadamard matrices whether real or complex lead to a dense output of identical probabilities for any given single input state.<n>Complex Hadamard matrices have unusual orders and introduce phase which prove useful when controlled phase transformation gates are used.
• Score: 0.39325957466009204
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We have observed that Hadamard matrices whether real or complex lead to a dense output of identical probabilities for any given single input state. Complex Hadamard matrices have unusual orders and introduce phase which prove useful when controlled phase transformation gates are used. By taking a superposed combinations of input states, we discovered that the Hadamards generate non-uniform probabilities which is practically significant towards amplitude amplification without the need for manual parameterization like Grover's operator~\cite{grover1996}. A variety of graph theoretic properties are applied to TSS graphs and their trends were explored. Additionally, graphs turn out to be nearly isomorphic for the same set of input states which has potential applications for developing Quantum Algorithms. Keywords: Quantum Algorithms, Hadamard Matrices, Unitary Matrix Approach, Topological Structure of Superpositions (TSS), Graph Theory

Related papers

• Quantum algorithm for differential equations via permutation matrix representation with application to the Burgers equation [0.1274452325287335]
  We develop a quantum algorithm for solving the dynamics of the nonlinear Burgers equation.<n>We show that our algorithm scales with the off-diagonal norm of the Carleman generator instead of the matrix norm.<n>We extend the PMR scheme to general fluid equations that may contain higher-order derivatives or nonlinear terms.
  arXiv  Detail & Related papers  (2026-08-19T23:52:03Z)
• Two-Tower Quantum Matrix Chain Multiplication: Trading Qubits for Depth [73.08853228981701]
  Matrix chain multiplication is a problem in scientific computing, machine learning, and graph analysis.<n>We present emphTwo-Tower Matrix, a quantum subroutine that encodes the product $mathcalW$ of the $K$ matrices into a quantum state in circuit depth.
  arXiv  Detail & Related papers  (2026-07-14T18:42:40Z)
• Directed Graph Topology Inference via Graph Filter Identification [54.541275287889164]
  We address the problem of inferring a directed network from nodal measurements generated by a graph convolutional filter.<n>A joint graph filter and topology identification algorithm is also proposed, which alternates between the aforementioned steps to offer improved sample complexity.
  arXiv  Detail & Related papers  (2026-06-25T18:25:57Z)
• Imperfect Graphs from Unitary Matrices -- I [0.8149698201875037]
  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.
  arXiv  Detail & Related papers  (2026-02-25T11:34:47Z)
• Block encoding of sparse matrices with a periodic diagonal structure [67.45502291821956]
  We provide an explicit quantum circuit for block encoding a sparse matrix with a periodic diagonal structure.<n>Various applications for the presented methodology are discussed in the context of solving differential problems.
  arXiv  Detail & Related papers  (2026-02-11T07:24:33Z)
• An alternative explicit circuit diagram for the quantum search algorithm by implementing a non-unitary gate [0.0]
  We present multiple explicit unitary implementations by using the square root of the non-unitary matrix.<n>In the appendix of the paper, we show that the circuits can be used to group set elements which can be integrated into different algorithmic schemes.
  arXiv  Detail & Related papers  (2024-12-21T07:26:30Z)
• A quantum algorithm for solving eigenproblem of the Laplacian matrix of a fully connected weighted graph [4.045204834863644]
  We propose an efficient quantum algorithm to solve the eigenproblem of the Laplacian matrix of a fully connected weighted graph. Specifically, we adopt the optimal Hamiltonian simulation technique based on the block-encoding framework. We also show that our algorithm can be extended to solve the eigenproblem of symmetric (non-symmetric) normalized Laplacian matrix.
  arXiv  Detail & Related papers  (2022-03-28T02:24:08Z)
• 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)
• Simulating nonnative cubic interactions on noisy quantum machines [65.38483184536494]
  We show that quantum processors can be programmed to efficiently simulate dynamics that are not native to the hardware. On noisy devices without error correction, we show that simulation results are significantly improved when the quantum program is compiled using modular gates.
  arXiv  Detail & Related papers  (2020-04-15T05:16:24Z)
• Optimal Iterative Sketching with the Subsampled Randomized Hadamard Transform [64.90148466525754]
  We study the performance of iterative sketching for least-squares problems. We show that the convergence rate for Haar and randomized Hadamard matrices are identical, andally improve upon random projections. These techniques may be applied to other algorithms that employ randomized dimension reduction.
  arXiv  Detail & Related papers  (2020-02-03T16:17:50Z)
• 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.