Author
Listed:
- Pingyu Zhu
(National University of Defense Technology)
- Qilin Zheng
(National University of Defense Technology)
- Kun Wang
(National University of Defense Technology)
- Miaomiao Yu
(National University of Defense Technology)
- Gongyu Xia
(National University of Defense Technology)
- Jiacheng Liu
(National University of Defense Technology)
- Yong Liu
(National University of Defense Technology)
- Zhihong Zhu
(National University of Defense Technology)
- Ping Xu
(National University of Defense Technology
Hefei National Laboratory)
Abstract
Computing the number of perfect matchings of a graph is a famous #P-complete problem. In this work, taking the advantages of the frequency dimension of photon, we propose and implement a photonic perfect matching solver, by combining two key techniques, frequency grouping and multi-photon counting. Based on a broadband photon-pair source from a silicon quantum chip and a wavelength-selective switch, we configure graphs up to sixteen vertices and estimate the perfect matchings of subgraphs up to six vertices. The experimental fidelities are more than 90% for all the graphs. Moreover, we demonstrate that the developed photonic system can enhance classical stochastic algorithms for solving nondeterministic-polynomial-time(NP) problems, such as the Boolean satisfiability problem and the densest subgraph. Our work contributes a promising method for solving the perfect matchings problem, which is simple in experiment setup and convenient to transform or scale up the object graph by regulating the frequency-correlated photon pairs.
Suggested Citation
Pingyu Zhu & Qilin Zheng & Kun Wang & Miaomiao Yu & Gongyu Xia & Jiacheng Liu & Yong Liu & Zhihong Zhu & Ping Xu, 2025.
"Solving perfect matchings by frequency-grouped multi-photon events using a silicon chip,"
Nature Communications, Nature, vol. 16(1), pages 1-8, December.
Handle:
RePEc:nat:natcom:v:16:y:2025:i:1:d:10.1038_s41467-025-58711-8
DOI: 10.1038/s41467-025-58711-8
Download full text from publisher
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:nat:natcom:v:16:y:2025:i:1:d:10.1038_s41467-025-58711-8. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.nature.com .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.