Extension of a Pattern Recognition Validation Approach for Noisy Boson Sampling
- URL: http://arxiv.org/abs/2404.15603v3
- Date: Mon, 19 Aug 2024 15:30:30 GMT
- Title: Extension of a Pattern Recognition Validation Approach for Noisy Boson Sampling
- Authors: Yang Ji, Yongzheng Wu, Shi Wang, Jie Hou, Meiling Chen, Ming Ni,
- Abstract summary: Boson sampling is one of the main quantum computation models to demonstrate the quantum computational advantage.
Inspired by the Bayesian validation extended to evaluate whether distinguishability is too high to demonstrate this advantage, the pattern recognition validation is extended for boson sampling.
The distribution of characteristic values is nearly monotonically changed with indistinguishability, especially when photons are close to be indistinguishable.
- Score: 9.4267709534412
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Boson sampling is one of the main quantum computation models to demonstrate the quantum computational advantage. However, this aim may be hard to realize considering two main kinds of noises, which are photon distinguishability and photon loss. Inspired by the Bayesian validation extended to evaluate whether distinguishability is too high to demonstrate this advantage, the pattern recognition validation is extended for boson sampling, considering both distinguishability and loss. Based on clusters constructed with the K means++ method, where parameters are carefully adjusted to optimize the extended validation performances, the distribution of characteristic values is nearly monotonically changed with indistinguishability, especially when photons are close to be indistinguishable. However, this regulation may be suppressed by photon loss. The intrinsic data structure of output events is analyzed through calculating probability distributions and mean 2-norm distances of the sorted outputs. An approximation algorithm is also used to show the data structure changes with noises.
Related papers
- Enabling Uncertainty Estimation in Iterative Neural Networks [49.56171792062104]
We develop an approach to uncertainty estimation that provides state-of-the-art estimates at a much lower computational cost than techniques like Ensembles.
We demonstrate its practical value by embedding it in two application domains: road detection in aerial images and the estimation of aerodynamic properties of 2D and 3D shapes.
arXiv Detail & Related papers (2024-03-25T13:06:31Z) - Quantum advantage of time-reversed ancilla-based metrology of absorption
parameters [2.5499055723658097]
We consider the important problem of estimation of transmission of light by a sample, with losses due to absorption and scattering.
We show, through the determination of the quantum Fisher information, that the ancilla strategy leads to the best possible precision in single-mode estimation.
arXiv Detail & Related papers (2023-10-09T20:41:53Z) - Learning Unnormalized Statistical Models via Compositional Optimization [73.30514599338407]
Noise-contrastive estimation(NCE) has been proposed by formulating the objective as the logistic loss of the real data and the artificial noise.
In this paper, we study it a direct approach for optimizing the negative log-likelihood of unnormalized models.
arXiv Detail & Related papers (2023-06-13T01:18:16Z) - Regularized Vector Quantization for Tokenized Image Synthesis [126.96880843754066]
Quantizing images into discrete representations has been a fundamental problem in unified generative modeling.
deterministic quantization suffers from severe codebook collapse and misalignment with inference stage while quantization suffers from low codebook utilization and reconstruction objective.
This paper presents a regularized vector quantization framework that allows to mitigate perturbed above issues effectively by applying regularization from two perspectives.
arXiv Detail & Related papers (2023-03-11T15:20:54Z) - Representing Noisy Image Without Denoising [91.73819173191076]
Fractional-order Moments in Radon space (FMR) is designed to derive robust representation directly from noisy images.
Unlike earlier integer-order methods, our work is a more generic design taking such classical methods as special cases.
arXiv Detail & Related papers (2023-01-18T10:13:29Z) - Efficient validation of Boson Sampling from binned photon-number distributions [0.0]
We propose a test of the correct functioning of a boson sampler with single-photon inputs.
We show via theoretical arguments and numerical simulations that binned-mode photon number distributions can be used in practical scenarios.
arXiv Detail & Related papers (2022-12-19T17:22:35Z) - Gaussian boson sampling with partial distinguishability [0.0]
We investigate GBS with partial distinguishability using an approach based on virtual modes and indistinguishability efficiency.
We show how the boundary of quantum supremacy in GBS can be pushed further by partial distinguishability.
arXiv Detail & Related papers (2021-05-20T08:17:51Z) - Quasiprobability decompositions with reduced sampling overhead [4.38301148531795]
Quantum error mitigation techniques can reduce noise on current quantum hardware without the need for fault-tolerant quantum error correction.
We present a new algorithm based on mathematical optimization that aims to choose the quasiprobability decomposition in a noise-aware manner.
arXiv Detail & Related papers (2021-01-22T19:00:06Z) - Consistency Regularization for Certified Robustness of Smoothed
Classifiers [89.72878906950208]
A recent technique of randomized smoothing has shown that the worst-case $ell$-robustness can be transformed into the average-case robustness.
We found that the trade-off between accuracy and certified robustness of smoothed classifiers can be greatly controlled by simply regularizing the prediction consistency over noise.
arXiv Detail & Related papers (2020-06-07T06:57:43Z) - Spatially Adaptive Inference with Stochastic Feature Sampling and
Interpolation [72.40827239394565]
We propose to compute features only at sparsely sampled locations.
We then densely reconstruct the feature map with an efficient procedure.
The presented network is experimentally shown to save substantial computation while maintaining accuracy over a variety of computer vision tasks.
arXiv Detail & Related papers (2020-03-19T15:36:31Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.