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

arXiv:1205.2747 · Quantum Information Processing

Laplacian matrices of weighted digraphs represented as quantum states

Bibhas Adhikari, Subhashish Banerjee, Satyabrata Adhikari, Atul Kumar

Published Feb 6, 2017• 20 citations
arXivHTMLPDF
DOI
10.1007/s11128-017-1530-1

Related papers

Quantum walks defined by digraphs and generalized Hermitian adjacency matrices

Sho Kubota, Etsuo Segawa, Tetsuji Taniguchi

arXiv:1910.12536•Quantum Information Processing•Mar 1, 2021•19 citations

Graphs whose normalized Laplacian matrices are separable as density matrices in quantum mechanics

Chai Wah Wu

arXiv:1407.5663•Discrete Mathematics•Dec 22, 2015•5 citations

Quantum state representation based on combinatorial Laplacian matrix of star-relevant graph

Jianqiang Li, Xiu‐Bo Chen, Yixian Yang

arXiv:1507.05491•Quantum Information Processing•Oct 5, 2015•4 citations

Zero discord quantum states arising from weighted digraphs.

Supriyo Dutta, Bibhas Adhikari, Subhashish Banerjee

In this paper we determine the class of quantum states whose density matrix representation can be derived from graph Laplacian matrices associated with a weighted directed graph and we call them graph Laplacian quantum states. Then we obtain structural properties of these graphs such that the corresponding graph Laplacian states have zero quantum discord by investigating structural properties of clustered graphs which provide a family of commuting normal matrices formed by the blocks of its Laplacian matrices. We apply these results on some important mixed quantum states, such as the Werner, Isotropic, and $X$-states.

•May 2, 2017•4 citations

Entanglement and separability of graph Laplacian quantum states

Anoopa Joshi, Parvinder Singh, Atul Kumar

Quantum Information Processing•Apr 1, 2022•1 citation

Quantum search algorithm for similar subgraph identification under fixed edge removal

Ruben Kara, Sven Danz, Tobias Stollenwerk +1 more

We introduce a novel quantum algorithm for similar subgraph identification in form of an NP-hard cardinality-constrained binary quadratic optimization problem. Given a weighted reference graph with Laplacian $\boldsymbol{B}$, our algorithm determines the subgraph featuring Laplacian $\boldsymbol{B'}$ on the same vertex set, but $x$ out of $N$ inactive edges, minimizing the Frobenius distance $||\boldsymbol{B} - \boldsymbol{B'}||_\mathrm{F}^2$. We represent the $\binom{N}{x}$ graph topologies by an equal-weight superposition in form of a Dicke state, enabling controlled transformations applied to the quantum state associated with the vectorized Laplacian of the reference graph. Combined with amplitude estimation and a minimum finding approach, our algorithm provides a polynomial speed up $\mathcal{O}(\sqrt{N^{x}/x!}N\log\log N)$ compared to $\mathcal{O}(N^{x+1}/x!)$ of classical brute-force search algorithms. We demonstrate the application of our method on standard test cases, which represent electric power grids, by reconstructing $||\boldsymbol{B} -\boldsymbol{B'}||_\mathrm{F}^2$ from measurements and show how our approach can be additionally used to calculate energy functional like quadratic forms of the Laplacians with respect to a given vector.

quant-pharXiv:2604.02027•Apr 3, 2026•0 citations
In this paper we determine the class of quantum states whose density matrix representation can be derived from graph Laplacian matrices associated with a weighted directed graph and we call them graph Laplacian quantum states. Then we obtain structural properties of these graphs such that the corresponding graph Laplacian states have zero quantum discord by investigating structural properties of clustered graphs which provide a family of commuting normal matrices formed by the blocks of its Laplacian matrices. We apply these results on some important mixed quantum states, such as the Werner, Isotropic, and XXX-states.
We introduce a novel quantum algorithm for similar subgraph identification in form of an NP-hard cardinality-constrained binary quadratic optimization problem. Given a weighted reference graph with Laplacian B\boldsymbol{B}B, our algorithm determines the subgraph featuring Laplacian B′\boldsymbol{B'}B′ on the same vertex set, but xxx out of NNN inactive edges, minimizing the Frobenius distance ∣∣B−B′∣∣F2||\boldsymbol{B} - \boldsymbol{B'}||_\mathrm{F}^2∣∣B−B′∣∣F2​. We represent the (Nx)\binom{N}{x}(xN​) graph topologies by an equal-weight superposition in form of a Dicke state, enabling controlled transformations applied to the quantum state associated with the vectorized Laplacian of the reference graph. Combined with amplitude estimation and a minimum finding approach, our algorithm provides a polynomial speed up O(Nx/x!Nlog⁡log⁡N)\mathcal{O}(\sqrt{N^{x}/x!}N\log\log N)O(Nx/x!​NloglogN) compared to O(Nx+1/x!)\mathcal{O}(N^{x+1}/x!)O(Nx+1/x!) of classical brute-force search algorithms. We demonstrate the application of our method on standard test cases, which represent electric power grids, by reconstructing ∣∣B−B′∣∣F2||\boldsymbol{B} -\boldsymbol{B'}||_\mathrm{F}^2∣∣B−B′∣∣F2​ from measurements and show how our approach can be additionally used to calculate energy functional like quadratic forms of the Laplacians with respect to a given vector.