اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدSampling of partially distinguishable bosons and the relation to the multidimensional permanent
103
0
0.0
(
0
)
تأليف
Malte C. Tichy
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The collective interference of partially distinguishable bosons in multi-mode networks is studied via double-sided Feynman diagrams. The probability for many-body scattering events becomes a multi-dimensional tensor-permanent, which interpolates between distinguishable particles and identical bosons, and easily extends to mixed initial states. The permanent of the distinguishability matrix, composed of all mutual scalar products of the single-particle mode-functions, emerges as a natural measure for the degree of interference: It yields a bound on the difference between event probabilities for partially distinguishable bosons and the idealized species, and exactly quantifies the degree of bosonic bunching.
قيم البحث
اقرأ أيضاً
Boson Sampling is the problem of sampling from the same distribution as indistinguishable single photons at the output of a linear optical interferometer. It is an example of a non-universal quantum computation which is believed to be feasible in the
near term and cannot be simulated on a classical machine. Like all purported demonstrations of quantum supremacy, this motivates optimizing classical simulation schemes for a realistic model of the problem, in this case Boson Sampling when the implementations experience lost or distinguishable photons. Although current simulation schemes for sufficiently imperfect boson sampling are classically efficient, in principle the polynomial runtime can be infeasibly large. In this work, we develop a scheme for classical simulation of Boson Sampling under uniform distinguishability and loss, based on the idea of sampling from distributions where at most k photons are indistinguishable. We show that asymptotically this scheme can provide a polynomial improvement in the runtime compared to classically simulating idealised Boson Sampling. More significantly, we show that in the regime considered experimentally relevant, our approach gives an substantial improvement in runtime over other classical simulation approaches.
We demonstrate how boson sampling with photons of partial distinguishability can be expressed in terms of interference of fewer photons. We use this observation to propose a classical algorithm to simulate the output of a boson sampler fed with photo
ns of partial distinguishability. We find conditions for which this algorithm is efficient, which gives a lower limit on the required indistinguishability to demonstrate a quantum advantage. Under these conditions, adding more photons only polynomially increases the computational cost to simulate a boson sampling experiment.
Quantum metrology promises high-precision measurements beyond the capability of any classical techniques, and has the potential to be integral to investigative techniques. However, all sensors must tolerate imperfections if they are to be practical.
Here we show that photons with perfectly overlapped modes, which are therefore fully indistinguishable, are not required for quantum-enhanced measurement, and that partially-distinguishable photons do not have to be engineered to mitigate the adverse effects of distinguishability. We quantify the effect of distinguishability on quantum metrology experiments, and report results of an experiment to verify that two- and four-photon states containing partially-distinguishable photons can achieve quantum-enhanced sensitivity with low-visibility quantum interference. This demonstrates that sources producing photons with mixed spectral states can be readily utilized for quantum metrology.
The permanent of a multidimensional matrix is the sum of products of entries over all diagonals. By Mincs conjecture, there exists a reachable upper bound on the permanent of 2-dimensional (0,1)-matrices. In this paper we obtain some generalizations
of Mincs conjecture to the multidimensional case. For this purpose we prove and compare several bounds on the permanent of multidimensional (0,1)-matrices. Most estimates can be used for matrices with nonnegative bounded entries.
We present a randomized approximation scheme for the permanent of a matrix with nonnegative entries. Our scheme extends a recursive rejection sampling method of Huber and Law (SODA 2008) by replacing the upper bound for the permanent with a linear co
mbination of the subproblem bounds at a moderately large depth of the recursion tree. This method, we call deep rejection sampling, is empirically shown to outperform the basic, depth-zero variant, as well as a related method by Kuck et al. (NeurIPS 2019). We analyze the expected running time of the scheme on random $(0, 1)$-matrices where each entry is independently $1$ with probability $p$. Our bound is superior to a previous one for $p$ less than $1/5$, matching another bound that was known to hold when every row and column has density exactly $p$.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
