Sample efficient graph classification using binary Gaussian boson sampling
arXiv:2301.01232 · doi:10.1103/PhysRevA.108.062411
Abstract
We present a variation of a quantum algorithm for the machine learning task of classification with graph-structured data. The algorithm implements a feature extraction strategy that is based on Gaussian boson sampling (GBS) a near term model of quantum computing. However, unlike the currently proposed algorithms for this problem, our GBS setup only requires binary (light/no light) detectors, as opposed to photon number resolving detectors. These detectors are technologically simpler and can operate at room temperature, making our algorithm less complex and less costly to implement on the physical hardware. We also investigate the connection between graph theory and the matrix function called the Torontonian which characterizes the probabilities of binary GBS detection events.
References in corpus (15)
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Gaussian Quantum Information
- Quantum computational advantage using photons
- Gaussian Boson Sampling
- A Survey on Graph Kernels
- A detailed study of Gaussian Boson Sampling
- Using Gaussian Boson Sampling to Find Dense Subgraphs
- Gaussian Boson Sampling using threshold detectors
- Gaussian Boson Sampling for perfect matchings of arbitrary graphs
- A quantum hardware-induced graph kernel based on Gaussian Boson Sampling
- Resolution of 100 photons and quantum generation of unbiased random numbers
- Graph Kernels: A Survey
- Graph isomorphism and Gaussian boson sampling
- Franck-Condon factors by counting perfect matchings of graphs with loops
- Threshold detection statistics of bosonic states