Perfect matching counting is a famously hard problem. Here, the authors propose a photonic perfect matching solver by multi-photon coincidence of grouped broadband frequency-correlated photon pairs. The samples from the solver can also be used to enhance searching algorithms for NP problems such as SAT and densest subgraph.
- Pingyu Zhu
- Qilin Zheng
- Ping Xu