Studies of properties of bipartite graphs with quantum programming
Kh. P. Gnatenko
TL;DR
This work studies multi-qubit quantum states represented by bipartite graphs $G(U,V,E)$ generated via $CNOT$ gates on a separable state and analyzes how entanglement and quantum correlators reflect graph structure. It derives analytic expressions for the entanglement distance $E^{ED}_u(\ket{\psi})$ for $u\in U$ and $E^{ED}_v(\ket{\psi})$ for $v\in V$, revealing explicit dependence on vertex degrees and initial-state parameters, with a symmetric reduction $E^{ED}_u(\ket{\psi})=\sin^2 \theta^{(U)}_u\left(1-(\cos \phi^{(V)} \sin \theta^{(V)})^{2n_u}\right)$. The paper also links quantum correlators, such as $\langle\prod_{u\in U}\prod_{v\in V}\sigma^x_u\sigma^x_v\rangle$ and $\langle\prod_{u\in U}\sigma^x_u\rangle$, to counts of odd and even vertex degrees in $U$ and $V$, and provides quantum protocols to estimate these graph properties on near-term devices. Validation on the AerSimulator for a star graph demonstrates agreement with theory, illustrating a pathway for quantum-assisted graph-property estimation with potential advantages as quantum hardware scales.
Abstract
Multi-qubit quantum states corresponding to bipartite graphs $G(U,V,E)$ are examined. These states are constructed by applying $CNOT$ gates to an arbitrary separable multi-qubit quantum state. The entanglement distance of the resulting states is derived analytically for an arbitrary bipartite graph structure. A relationship between entanglement and the vertex degree is established. Additionally, we identify how quantum correlators relate to the number of vertices with odd and even degrees in the sets $U$ and $V$. Based on these results, quantum protocols are proposed for quantifying the number of vertices with odd and even degrees in the sets $U$ and $V$. For a specific case where the bipartite graph is a star graph, we analytically calculate the dependence of entanglement distance on the state parameters. These results are also verified through quantum simulations on the AerSimulator, including noise models. Furthermore, we use quantum calculations to quantify the number of vertices with odd degrees in $U$ and $V$. The results agree with the theoretical predictions.
