Abstract
We map the perfect matching problem in graph theory to a reconfigurable GBS model with the connection of the Hafnian of a matrix. We configure the linear optical circuit and squeeze parameter of the GBS model according to the decomposed unitary matrix and diagonal matrix of the graph’s adjacency matrix. The perfect matching numbers can be directly acquired from the 4-photon coincidence counts with a distribution similarity of 0.9304.
© 2022 The Author(s)
PDF Article | Presentation VideoMore Like This
H. H. Zhu, H. S. Chen, S. Y. Li, T. Chen, H. Cai, L. P. Chin, X. D. Zhang, and A. Q. Liu
FM3A.1 CLEO: Fundamental Science (CLEO:FS) 2023
G.S. Thekkadath, S. Sempere-Llagostera, B.A. Bell, R.B. Patel, M.S. Kim, and I.A. Walmsley
QW4B.6 Quantum 2.0 (QUANTUM) 2022
Craig S. Hamilton, Regina Kruse, Linda Sansoni, Sonja Barkhofen, Christine Silberhorn, and Igor Jex
FTu1F.2 CLEO: QELS_Fundamental Science (CLEO:FS) 2017