Certification of Gaussian Boson Sampling via graph theory
arXiv:2202.07711 · doi:10.1088/2058-9565/ac969b
Abstract
Gaussian Boson Sampling is a non-universal model for quantum computing inspired by the original formulation of the Boson Sampling problem. Nowadays, it represents a paradigmatic quantum platform to reach the quantum advantage regime in a specific computational model. Indeed, thanks to the implementation in photonics-based processors, the latest Gaussian Boson Sampling experiments have reached a level of complexity where the quantum apparatus has solved the task faster than currently up-to-date classical strategies. In addition, recent studies have identified possible applications beyond the inherent sampling task. In particular, a direct connection between photon counting of a genuine Gaussian Boson Sampling device and the number of perfect matchings in a graph has been established. In this work, we propose to exploit such a connection to benchmark Gaussian Boson Sampling experiments. We interpret the properties of the feature vectors of the graph encoded in the device as a signature of correct sampling from the true input state. Within this framework, two approaches that exploit the distributions of graph feature vectors and graph kernels are presented. Our results provide a novel approach to the actual need for tailored algorithms to benchmark large-scale Gaussian Boson Samplers.
9 pages, 5 figures
References in corpus (12)
- Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shift
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Quantum computational advantage using photons
- Strong quantum computational advantage using a superconducting quantum processor
- Quantum circuits with many photons on a programmable nanophotonic chip
- Phase-Programmable Gaussian Boson Sampling Using Stimulated Squeezed Light
- Sampling of partially distinguishable bosons and the relation to the multidimensional permanent
- What can quantum optics say about computational complexity theory?
- 20-Mode Universal Quantum Photonic Processor
- Experimental statistical signature of many-body quantum interference
- Experimental Gaussian Boson Sampling
- Simulating macroscopic quantum correlations in linear networks
Cited by in corpus (6)
- Gaussian Boson Sampling with Pseudo-Photon-Number Resolving Detectors and Quantum Computational Advantage
- Benchmarking a boson sampler with Hamming nets
- Validation of a noisy Gaussian boson sampler via graph theory
- Optical Quantum Computing
- Sample space filling analysis for boson sampling validation
- Realistic photon-number resolution in Gaussian boson sampling