Construction and Rigorous Analysis of Quantum-Like States

• URL: http://arxiv.org/abs/2507.21289v1
• Date: Mon, 28 Jul 2025 19:22:32 GMT
• Title: Construction and Rigorous Analysis of Quantum-Like States
• Authors: Ethan Dickey, Abhijeet Vyas, Sabre Kais,
• Abstract summary: 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$.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Extending upon the observations of the emergence of quantum-like states from classical complex synchronized networks, this work adds mathematical rigor to the analysis of single Quantum-Like (QL) bits constructed by eigenvectors of the adjacency matrices of such networks. First, we rigorously show that symmetric construction of such networks (regular undirected/symmetric bipartite graph $G_C$ connecting two regular undirected subgraphs $G_A,\,G_B$) leads to an equal superposition of the $|+\rangle, |-\rangle$ Hadamard states (with basis $|0\rangle,\,|1\rangle$ set from eigenvectors of the subgraphs), and provide an analysis of sufficient conditions on the network for construction of such states. Second, we prove two methods to construct any arbitrary single qubit state $|\psi\rangle = a|0\rangle + b|1\rangle,\, |a|^2+|b|^2=1$ and provide a switching lemma for the boundaries of both methods. The first method of construction is by detuning the regularities of the two subgraphs and the second is by asymmetrically constructing the bipartite connection matrix $C$ by allowing it to be directed, and then detuning those regularities. While the intuition is derived from the motivation of using complex synchronized networks for quantum information storage and computations, the proofs for constructing eigenvectors that interact in a quantum-like fashion only require the structure of the graph embedded in the adjacency matrix. Practically, this means that synchronization is not important to creating quantum-like bits, only that the edge weights are generally unit or close to unit and that the subgraphs are regular. As such, the results on combinations of random k-regular graphs (precisely Erd\H{o}s-R\'enyi graphs) may be independently interesting.

Related papers

• Commutators with multiple unitary symmetry [8.572991879638712]
  Commutators are essential in quantum information theory, influencing quantum state symmetries and information storage robustness.<n>This paper systematically investigates the characteristics of bipartite and multipartite quantum states invariant under local unitary group actions.
  arXiv  Detail & Related papers  (2025-04-12T14:16:23Z)
• QuOp: A Quantum Operator Representation for Nodes [0.0]
  We derive an intuitive and novel method to represent nodes in a graph with quantum operators. This method does not require parameter training and is competitive with classical methods on scoring similarity between nodes.
  arXiv  Detail & Related papers  (2024-07-19T13:10:04Z)
• Geometry of degenerate quantum states, configurations of $m$-planes and invariants on complex Grassmannians [55.2480439325792]
  We show how to reduce the geometry of degenerate states to the non-abelian connection $A$. We find independent invariants associated with each triple of subspaces. Some of them generalize the Berry-Pancharatnam phase, and some do not have analogues for 1-dimensional subspaces.
  arXiv  Detail & Related papers  (2024-04-04T06:39:28Z)
• Vectorization of the density matrix and quantum simulation of the von Neumann equation of time-dependent Hamiltonians [65.268245109828]
  We develop a general framework to linearize the von-Neumann equation rendering it in a suitable form for quantum simulations. We show that one of these linearizations of the von-Neumann equation corresponds to the standard case in which the state vector becomes the column stacked elements of the density matrix. A quantum algorithm to simulate the dynamics of the density matrix is proposed.
  arXiv  Detail & Related papers  (2023-06-14T23:08:51Z)
• Quantum Current and Holographic Categorical Symmetry [62.07387569558919]
  A quantum current is defined as symmetric operators that can transport symmetry charges over an arbitrary long distance. The condition for quantum currents to be superconducting is also specified, which corresponds to condensation of anyons in one higher dimension.
  arXiv  Detail & Related papers  (2023-05-22T11:00:25Z)
• Near-optimal fitting of ellipsoids to random points [68.12685213894112]
  A basic problem of fitting an ellipsoid to random points has connections to low-rank matrix decompositions, independent component analysis, and principal component analysis. We resolve this conjecture up to logarithmic factors by constructing a fitting ellipsoid for some $n = Omega(, d2/mathrmpolylog(d),)$. Our proof demonstrates feasibility of the least squares construction of Saunderson et al. using a convenient decomposition of a certain non-standard random matrix.
  arXiv  Detail & Related papers  (2022-08-19T18:00:34Z)
• 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)
• Detection of $d_{1}\otimes d_{2}$ Dimensional Bipartite Entangled State: A Graph Theoretical Approach [1.5762281194023464]
  We show that the constructed unital map $phi$ characterize the quantum state with respect to its purity. We derive the inequality between the minimum eigenvalue of the density matrix and the weight of the edges of the connected subgraph to detect the entanglement of $d_1 otimes d_2$ dimensional bipartite quantum states.
  arXiv  Detail & Related papers  (2022-02-28T17:13:27Z)
• SIGMA: A Structural Inconsistency Reducing Graph Matching Algorithm [21.1095092767297]
  We propose a novel criterion to measure the graph matching accuracy, structural inconsistency (SI) Specifically, SI incorporates the heat diffusion wavelet to accommodate the multi-hop structure of the graphs. We show that SIGMA can be derived by using a mirror descent method to solve the Gromov-Wasserstein distance with a novel K-hop-structure-based matching costs.
  arXiv  Detail & Related papers  (2022-02-06T15:18:37Z)
• K-sparse Pure State Tomography with Phase Estimation [1.2183405753834557]
  Quantum state tomography (QST) for reconstructing pure states requires exponentially increasing resources and measurements with the number of qubits. QST reconstruction for any pure state composed of the superposition of $K$ different computational basis states of $n$bits in a specific measurement set-up is presented.
  arXiv  Detail & Related papers  (2021-11-08T09:43:12Z)
• Bipartite quantum measurements with optimal single-sided distinguishability [0.0]
  We look for a basis with optimal single-sided mutual state distinguishability in $Ntimes N$ Hilbert space. In the case $N=2$ of a two-qubit system our solution coincides with the elegant joint measurement introduced by Gisin. We show that the one-party measurement that distinguishes the states of an optimal basis of the composite system leads to a local quantum state tomography.
  arXiv  Detail & Related papers  (2020-10-28T10:30:35Z)
• Learning Sparse Graph Laplacian with K Eigenvector Prior via Iterative GLASSO and Projection [58.5350491065936]
  We consider a structural assumption on the graph Laplacian matrix $L$. The first $K$ eigenvectors of $L$ are pre-selected, e.g., based on domain-specific criteria. We design an efficient hybrid graphical lasso/projection algorithm to compute the most suitable graph Laplacian matrix $L* in H_u+$ given $barC$.
  arXiv  Detail & Related papers  (2020-10-25T18:12:50Z)
• Why Are Convolutional Nets More Sample-Efficient than Fully-Connected Nets? [33.51250867983687]
  We show a natural task on which a provable sample complexity gap can be shown, for standard training algorithms. We demonstrate a single target function, learning which on all possible distributions leads to an $O(1)$ vs $Omega(d2/varepsilon)$ gap. Similar results are achieved for $ell$ regression and adaptive training algorithms, e.g. Adam and AdaGrad.
  arXiv  Detail & Related papers  (2020-10-16T17:15:39Z)
• Cospectrality preserving graph modifications and eigenvector properties via walk equivalence of vertices [0.0]
  Cospectrality is a powerful generalization of exchange symmetry and can be applied to all real-valued symmetric matrices. We show that the powers of a matrix with cospectral vertices induce further local relations on its eigenvectors. Our work paves the way for flexibly exploiting hidden structural symmetries in the design of generic complex network-like systems.
  arXiv  Detail & Related papers  (2020-07-15T10:54:31Z)
• Quantum Algorithms for Simulating the Lattice Schwinger Model [63.18141027763459]
  We give scalable, explicit digital quantum algorithms to simulate the lattice Schwinger model in both NISQ and fault-tolerant settings. In lattice units, we find a Schwinger model on $N/2$ physical sites with coupling constant $x-1/2$ and electric field cutoff $x-1/2Lambda$. We estimate observables which we cost in both the NISQ and fault-tolerant settings by assuming a simple target observable---the mean pair density.
  arXiv  Detail & Related papers  (2020-02-25T19:18:36Z)

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.