Gaussian boson sampling for perfect matchings of arbitrary graphs
Open accessThe DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Abstract
A famously hard graph problem with a broad range of applications is computing the number of perfect matchings, that is, the number of unique and complete pairings of the vertices of a graph. We propose a method to estimate the number of perfect matchings of undirected graphs based on the relation between Gaussian boson sampling and graph theory. The probability of measuring zero or one photons in each output mode is directly related to the hafnian of the adjacency matrix, and thus to the number of perfect matchings of a graph. We present encodings of the adjacency matrix of a graph into a Gaussian state and show strategies to boost the sampling success probability for the studied graphs. With our method, a Gaussian boson sampling device can be used to estimate the number of perfect matchings significantly faster and with lower-energy consumption compared to a classical computer.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Reducibility among Combinatorial Problems
Karp, R. M. (1972) · Complexity of Computer Computations · doi:10.1007/978-1-4684-2001-2_9 · Cited by 11,511
Horn, R. A., & Johnson, C. R. (2012) · doi:10.1017/cbo9781139020411 · Cited by 4,642
The complexity of computing the permanent
Valiant, L. G. (1979) · Theoretical Computer Science · doi:10.1016/0304-3975(79)90044-6 · Cited by 2,705
Optimal design for universal multiport interferometers
Clements, W. R., Humphreys, P. C., Metcalf, B. J., Kolthammer, W. S., & Walsmley, I. A. (2016) · Optica · doi:10.1364/optica.3.001460 · Cited by 1,216 · cited 1×
“By decomposing T into an array of six beam splitters and some phase shifts according to [36], we find”
Quantum algorithms: an overview
Montanaro, A. (2016) · npj Quantum Information · doi:10.1038/npjqi.2015.23 · Cited by 1,071 · cited 1×
“Quantum algorithms promise to solve certain problems much faster than classical algorithms [8].”
BackgroundTopics in Current Chemistry: Inorganic Biochemistry
(1976) · Topics in Current Chemistry · doi:10.1007/bfb0045697 · Cited by 1,044
The computational complexity of linear optics
Aaronson, S., & Arkhipov, A. (2011) · Proceedings of the forty-third annual ACM symposium on Theory of computing · doi:10.1145/1993636.1993682 · Cited by 874
Boson Sampling on a Photonic Chip
Spring, J. B., Metcalf, B. J., Humphreys, P. C., Kolthammer, W. S., Jin, X.-M., Barbieri, M., Datta, A., Thomas-Peter, N., Langford, N. K., Kundys, D., et al. (2013) · Science · doi:10.1126/science.1231692 · Cited by 837
Environment-assisted quantum transport
Rebentrost, P., Mohseni, M., Kassal, I., Lloyd, S., & Aspuru-Guzik, A. (2009) · New Journal of Physics · doi:10.1088/1367-2630/11/3/033003 · Cited by 817
Self-citationHamilton, C. S., Kruse, R., Sansoni, L., Barkhofen, S., Silberhorn, C., & Jex, I. (2017) · Physical Review Letters · doi:10.1103/physrevlett.119.170501 · Cited by 503 · cited 9×
“For an arbitrary M -mode Gaussian state, A is related to σA via [9]”
BackgroundInfluentialPermanents in linear optical networks
Scheel, S. (2004) · arXiv · doi:10.48550/arxiv.quant-ph/0406127 · Cited by 94
Huh, J., & Yung, M.-H. (2017) · Scientific Reports · doi:10.1038/s41598-017-07770-z · Cited by 63
Cited by
Quantum circuits with many photons on a programmable nanophotonic chip
Arrazola, J. M., Bergholm, V., Brádler, K., Bromley, T. R., Collins, M. J., Dhand, I., Fumagalli, A., Gerrits, T., Goussev, A., Helt, L. G., et al. (2021) · Nature · doi:10.1038/s41586-021-03202-1 · Cited by 567
“Any undirected weighted graph can be encoded in a photonic circuit by exploiting a correspondence between real symmetric matrices — representing the graph’s adjacency matrix — and the combination of a linear optical interferometer with squeezed light [15].”
BackgroundSelf-citationStrawberry Fields: A Software Platform for Photonic Quantum Computing
Killoran, N., Izaac, J., Quesada, N., Bergholm, V., Amy, M., & Weedbrook, C. (2019) · Quantum · doi:10.22331/q-2019-03-11-129 · Cited by 323
Self-citationNon-Gaussian Quantum States and Where to Find Them
Walschaers, M. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.030204 · Cited by 306
Applications of single photons to quantum communication and computing
Couteau, C., Barz, S., Durt, T., Gerrits, T., Huwer, J., Prevedel, R., Rarity, J., Shields, A., & Weihs, G. (2023) · Nature Reviews Physics · doi:10.1038/s42254-023-00583-2 · Cited by 216
“Gaussian boson sampling uses squeezed states (discussed subsequently) as inputs and has been shown to solve computationally hard problems, such as computing the Hafnian of a matrix, estimating the number of perfect matchings of undirected graphs and the graph isomorphism problem 196–198 .”
BackgroundPhotonic implementation of boson sampling: a review
Brod, D. J., Galvão, E. F., Crespi, A., Osellame, R., Spagnolo, N., & Sciarrino, F. (2019) · Advanced Photonics · doi:10.1117/1.ap.1.3.034001 · Cited by 159
Metadata
- Authors
- Brádler, K., Dallaire-Demers, P.-L., Rebentrost, P., Su, D., & Weedbrook, C.
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- Published
- 2018-09-10
- Volume
- 98
- Issue
- 3
- ISSN
- 0556-2791 (ISSN-L)
- 2469-9926
- 2469-9934
- OpenAlex
- W2781364653
- Cited by
- 95
- References
- 12
- FWCI
- 6.22
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.