For quantum sparse graph codes with stabilizer formalism, the unavoidable girth-four cycles in their Tanner graphs greatly degrade the iterative decoding performance with standard belief-propagation （BP） algorithm. ...For quantum sparse graph codes with stabilizer formalism, the unavoidable girth-four cycles in their Tanner graphs greatly degrade the iterative decoding performance with standard belief-propagation （BP） algorithm. In this paper, we present a jointly-check iterative algorithm suitable for decoding quantum sparse graph codes efficiently. Numerical simulations show that this modified method outperforms standard BP algorithm with an obvious performance improvement.展开更多
Janmark, Meyer, and Wong showed that continuous-time quantum walk search on known families of strongly regular graphs（SRGs） with parameters（N, k, λ, μ） achieves full quantum speedup. The problem is reconsidered ...Janmark, Meyer, and Wong showed that continuous-time quantum walk search on known families of strongly regular graphs（SRGs） with parameters（N, k, λ, μ） achieves full quantum speedup. The problem is reconsidered in terms of scattering quantum walk, a type of discrete-time quantum walks. Here, the search space is confined to a low-dimensional subspace corresponding to the collapsed graph of SRGs. To quantify the algorithm＇s performance, we leverage the fundamental pairing theorem, a general theory developed by Cottrell for quantum search of structural anomalies in star graphs.The search algorithm on the SRGs with k scales as N satisfies the theorem, and results can be immediately obtained, while search on the SRGs with k scales as√N does not satisfy the theorem, and matrix perturbation theory is used to provide an analysis. Both these cases can be solved in O（√N） time steps with a success probability close to 1. The analytical conclusions are verified by simulation results on two SRGs. These examples show that the formalism on star graphs can be applied more generally.展开更多
We propose feasible experimental schemes for preparing all five-photon graph states. Our schemes require only linear optical elements, photon detectors and post-selection, which are available in current experiment so ...We propose feasible experimental schemes for preparing all five-photon graph states. Our schemes require only linear optical elements, photon detectors and post-selection, which are available in current experiment so that these schemes are within the reach of the current technology.展开更多
The classical Ambarzumyan’s theorem states that if the Neumann eigenvalues of the Sturm-Liouville operator-d^(2)/dx^(2)+q with an integrable real-valued potential q on[0,π] are {n^(2):n≥0},then q=0 for almost all x...The classical Ambarzumyan’s theorem states that if the Neumann eigenvalues of the Sturm-Liouville operator-d^(2)/dx^(2)+q with an integrable real-valued potential q on[0,π] are {n^(2):n≥0},then q=0 for almost all x∈[0,π].In this work,the classical Ambarzumyan’s theorem is extended to the Dirac operator on equilateral tree graphs.We prove that if the spectrum of the Dirac operator on graphs coincides with the unperturbed case,then the potential is identically zero.展开更多
基金Project supported by the National Natural Science Foundation of China(Grant No.60972046)Grant from the National Defense Pre-Research Foundation of China
文摘For quantum sparse graph codes with stabilizer formalism, the unavoidable girth-four cycles in their Tanner graphs greatly degrade the iterative decoding performance with standard belief-propagation （BP） algorithm. In this paper, we present a jointly-check iterative algorithm suitable for decoding quantum sparse graph codes efficiently. Numerical simulations show that this modified method outperforms standard BP algorithm with an obvious performance improvement.
基金supported by the National Natural Science Foundation of China(Grant Nos.61502101 and 61170321)the Natural Science Foundation of Jiangsu Province,China(Grant No.BK20140651)the Research Fund for the Doctoral Program of Higher Education of China(Grant No.20110092110024)
文摘Janmark, Meyer, and Wong showed that continuous-time quantum walk search on known families of strongly regular graphs（SRGs） with parameters（N, k, λ, μ） achieves full quantum speedup. The problem is reconsidered in terms of scattering quantum walk, a type of discrete-time quantum walks. Here, the search space is confined to a low-dimensional subspace corresponding to the collapsed graph of SRGs. To quantify the algorithm＇s performance, we leverage the fundamental pairing theorem, a general theory developed by Cottrell for quantum search of structural anomalies in star graphs.The search algorithm on the SRGs with k scales as N satisfies the theorem, and results can be immediately obtained, while search on the SRGs with k scales as√N does not satisfy the theorem, and matrix perturbation theory is used to provide an analysis. Both these cases can be solved in O（√N） time steps with a success probability close to 1. The analytical conclusions are verified by simulation results on two SRGs. These examples show that the formalism on star graphs can be applied more generally.
文摘We propose feasible experimental schemes for preparing all five-photon graph states. Our schemes require only linear optical elements, photon detectors and post-selection, which are available in current experiment so that these schemes are within the reach of the current technology.
基金supported by the National Natural Science Foundation of China(No.11871031)the Natural Science Foundation of the Jiangsu Province of China(No.BK 20201303).
文摘The classical Ambarzumyan’s theorem states that if the Neumann eigenvalues of the Sturm-Liouville operator-d^(2)/dx^(2)+q with an integrable real-valued potential q on[0,π] are {n^(2):n≥0},then q=0 for almost all x∈[0,π].In this work,the classical Ambarzumyan’s theorem is extended to the Dirac operator on equilateral tree graphs.We prove that if the spectrum of the Dirac operator on graphs coincides with the unperturbed case,then the potential is identically zero.
