Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Translations - American Mathematical Society/Translations

Notions of independence in quantum probability and spectral analysis of graphs

Nobuaki Obata

Published Jul 8, 2008• 5 citations
Publisher
DOI
10.1090/trans2/223/08

Related papers

Quantum Probability and Spectral Analysis of Graphs

Akihito Hora, Nobuaki Obata

Springer eBooks•Jan 1, 2007•167 citations

Arc search in graphs via Szegedy walks

Sho Kubota, Kiyoto Yoshino

This paper studies the search for a single arc in a graph using the Szegedy walk. Arc search can be interpreted as finding a quantum particle not only in its position but also with a specific internal state. The quantum walk employed in this study is essentially the model proposed by Segawa and Yoshie for the purpose of edge search. First, we investigate how the symmetry of a graph is reflected in its time evolution matrix, and provide a sufficient condition under which the success probability of the search is independent of the marked arc. In particular, we prove that if a graph is arc-transitive, the success probability is independent of the choice of the marked arc. Next, we analyze path and cycle graphs and show that the quantum search is ineffective for these graphs, whereas it performs well for complete bipartite graphs $K_{n,n}$. These results provide a theoretical foundation for studying arc and edge searches on various graphs, while also suggesting new problems concerning the eigenvalue analysis of edge-signed graphs in spectral graph theory.

quant-pharXiv:2604.19134•Apr 22, 2026•0 citations

Graph Theory and Quantum Probability

IMPERIAL COLLEGE PRESS eBooks•Feb 1, 2012•0 citations

INVESTIGATION OF CONTINUOUS-TIME QUANTUM WALKS VIA SPECTRAL ANALYSIS AND LAPLACE TRANSFORM

M. A. Jafarizadeh, Rahime Sufiani

Continuous-time quantum walk (CTQW) on a given graph is investigated using the techniques of the spectral analysis and inverse Laplace transform of the Stieltjes function (Stieltjes transform of the spectral distribution) associated with the graph. It is shown that the probability amplitude of observing the CTQW at a given site at time t is related to the inverse Laplace transformation of the Stieltjes function, namely, one can calculate the probability amplitudes only by taking the inverse laplace transform of the function iGμ(is), where Gμ(x) is the Stieltjes function of the graph. The preference of this procedure is that there is no need to know the spectrum of the graph.

arXiv:0704.2602•International Journal of Quantum Information•Aug 1, 2007•18 citations

Quantum probability theory

Miklós Rédei, Stephen J. Summers

arXiv:quant-ph/0601158•Studies in History and Philosophy of Science Part B Studies in History and Philosophy of Modern Physics•Jun 1, 2007•117 citations

Graph-Theoretic Approach to Quantum Correlations

Adán Cabello, Simone Severini B, Andreas Winter

Correlations in Bell and noncontextuality inequalities can be expressed as a positive linear combination of probabilities of events. Exclusive events can be represented as adjacent vertices of a graph, so correlations can be associated to a subgraph. We show that the maximum value of the correlations for classical, quantum, and more general theories is the independence number, the Lovász number, and the fractional packing number of this subgraph, respectively. We also show that, for any graph, there is always a correlation experiment such that the set of quantum probabilities is exactly the Grötschel-Lovász-Schrijver theta body. This identifies these combinatorial notions as fundamental physical objects and provides a method for singling out experiments with quantum correlations on demand.

arXiv:1401.7081•Physical Review Letters•Jan 27, 2014•359 citations
This paper studies the search for a single arc in a graph using the Szegedy walk. Arc search can be interpreted as finding a quantum particle not only in its position but also with a specific internal state. The quantum walk employed in this study is essentially the model proposed by Segawa and Yoshie for the purpose of edge search. First, we investigate how the symmetry of a graph is reflected in its time evolution matrix, and provide a sufficient condition under which the success probability of the search is independent of the marked arc. In particular, we prove that if a graph is arc-transitive, the success probability is independent of the choice of the marked arc. Next, we analyze path and cycle graphs and show that the quantum search is ineffective for these graphs, whereas it performs well for complete bipartite graphs Kn,nK_{n,n}Kn,n​. These results provide a theoretical foundation for studying arc and edge searches on various graphs, while also suggesting new problems concerning the eigenvalue analysis of edge-signed graphs in spectral graph theory.
Continuous-time quantum walk (CTQW) on a given graph is investigated using the techniques of the spectral analysis and inverse Laplace transform of the Stieltjes function (Stieltjes transform of the spectral distribution) associated with the graph. It is shown that the probability amplitude of observing the CTQW at a given site at time t is related to the inverse Laplace transformation of the Stieltjes function, namely, one can calculate the probability amplitudes only by taking the inverse laplace transform of the function iGμ(is), where Gμ(x) is the Stieltjes function of the graph. The preference of this procedure is that there is no need to know the spectrum of the graph.
Correlations in Bell and noncontextuality inequalities can be expressed as a positive linear combination of probabilities of events. Exclusive events can be represented as adjacent vertices of a graph, so correlations can be associated to a subgraph. We show that the maximum value of the correlations for classical, quantum, and more general theories is the independence number, the Lovász number, and the fractional packing number of this subgraph, respectively. We also show that, for any graph, there is always a correlation experiment such that the set of quantum probabilities is exactly the Grötschel-Lovász-Schrijver theta body. This identifies these combinatorial notions as fundamental physical objects and provides a method for singling out experiments with quantum correlations on demand.