اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدA Statistical Benchmark for BosonSampling
41
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Computing the state of a quantum mechanical many-body system composed of indistinguishable particles distributed over a multitude of modes is one of the paradigmatic test cases of computational complexity theory: Beyond well-understood quantum statistical effects, the coherent superposition of many-particle amplitudes rapidly overburdens classical computing devices - essentially by creating extremely complicated interference patterns, which also challenge experimental resolution. With the advent of controlled many-particle interference experiments, optical set-ups that can efficiently probe many-boson wave functions - baptised BosonSamplers - have therefore been proposed as efficient quantum simulators which outperform any classical computing device, and thereby challenge the extended Church-Turing thesis, one of the fundamental dogmas of computer science. However, as in all experimental quantum simulations of truly complex systems, there remains one crucial problem: How to certify that a given experimental measurement record is an unambiguous result of sampling bosons rather than fermions or distinguishable particles, or of uncontrolled noise? In this contribution, we describe a statistical signature of many-body quantum interference, which can be used as an experimental (and classically computable) benchmark for BosonSampling.
قيم البحث
اقرأ أيضاً
In recent years, the mathematical and algorithmic aspects of the phase retrieval problem have received considerable attention. Many papers in this area mention crystallography as a principal application. In crystallography, the signal to be recovered
is periodic and comprised of atomic distributions arranged homogeneously in the unit cell of the crystal. The crystallographic problem is both the leading application and one of the hardest forms of phase retrieval. We have constructed a graded set of benchmark problems for evaluating algorithms that perform this type of phase retrieval. The data, publicly available online, is provided in an easily interpretable format. We also propose a simple and unambiguous success/failure criterion based on the actual needs in crystallography. Baseline runtimes were obtained with an iterative algorithm that is similar but more transparent than those used in crystallography. Empirically, the runtimes grow exponentially with respect to a new hardness parameter: the sparsity of the signal autocorrelation. We also review the algorithms used by the leading software packages. This set of benchmark problems, we hope, will encourage the development of new algorithms for the phase retrieval problem in general, and crystallography in particular.
We study stabilizer quantum error correcting codes (QECC) generated under hybrid dynamics of local Clifford unitaries and local Pauli measurements in one dimension. Building upon 1) a general formula relating the error-susceptibility of a subregion t
o its entanglement properties, and 2) a previously established mapping between entanglement entropies and domain wall free energies of an underlying spin model, we propose a statistical mechanical description of the QECC in terms of entanglement domain walls. Free energies of such domain walls generically feature a leading volume law term coming from its surface energy, and a sub-volume law correction coming from thermodynamic entropies of its transverse fluctuations. These are most easily accounted for by capillary-wave theory of liquid-gas interfaces, which we use as an illustrative tool. We show that the information-theoretic decoupling criterion corresponds to a geometric decoupling of domain walls, which further leads to the identification of the contiguous code distance of the QECC as the crossover length scale at which the energy and entropy of the domain wall are comparable. The contiguous code distance thus diverges with the system size as the subleading entropic term of the free energy, protecting a finite code rate against local undetectable errors. We support these correspondences with numerical evidence, where we find capillary-wave theory describes many qualitative features of the QECC; we also discuss when and why it fails to do so.
Three-dimensional (3D) color codes have advantages for fault-tolerant quantum computing, such as protected quantum gates with relatively low overhead and robustness against imperfect measurement of error syndromes. Here we investigate the storage thr
eshold error rates for bit-flip and phase-flip noise in the 3D color code on the body-centererd cubic lattice, assuming perfect syndrome measurements. In particular, by exploiting a connection between error correction and statistical mechanics, we estimate the threshold for 1D string-like and 2D sheet-like logical operators to be $p^{(1)}_mathrm{3DCC} simeq 1.9%$ and $p^{(2)}_mathrm{3DCC} simeq 27.6%$. We obtain these results by using parallel tempering Monte Carlo simulations to study the disorder-temperature phase diagrams of two new 3D statistical-mechanical models: the 4- and 6-body random coupling Ising models.
We introduce a new class of deterministic networks by associating networks with Diophantine equations, thus relating network topology to algebraic properties. The network is formed by representing integers as vertices and by drawing cliques between M
vertices every time that M distinct integers satisfy the equation. We analyse the network generated by the Pythagorean equation $x^{2}+y^{2}= z^{2}$ showing that its degree distribution is well approximated by a power law with exponential cut-off. We also show that the properties of this network differ considerably from the features of scale-free networks generated through preferential attachment. Remarkably we also recover a power law for the clustering coefficient.
The discovery of topological features of quantum states plays an important role in modern condensed matter physics and various artificial systems. Due to the absence of local order parameters, the detection of topological quantum phase transitions re
mains a challenge. Machine learning may provide effective methods for identifying topological features. In this work, we show that the unsupervised manifold learning can successfully retrieve topological quantum phase transitions in momentum and real space. Our results show that the Chebyshev distance between two data points sharpens the characteristic features of topological quantum phase transitions in momentum space, while the widely used Euclidean distance is in general suboptimal. Then a diffusion map or isometric map can be applied to implement the dimensionality reduction, and to learn about topological quantum phase transitions in an unsupervised manner. We demonstrate this method on the prototypical Su-Schrieffer-Heeger (SSH) model, the Qi-Wu-Zhang (QWZ) model, and the quenched SSH model in momentum space, and further provide implications and demonstrations for learning in real space, where the topological invariants could be unknown or hard to compute. The interpretable good performance of our approach shows the capability of manifold learning, when equipped with a suitable distance metric, in exploring topological quantum phase transitions.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
