Explore the vast range of titles available.

[This corrects the article DOI: 10.1371/journal.pone.0213857.].

Quantum walks are the quantum analogs of classical random walks, which allow for the simulation of large-scale quantum many-body systems and the realization of universal quantum computation without time-dependent control.We experimentally demonstrate quantum walks of one and two strongly correlated microwave photons in a one-dimensional array of 12 superconducting qubits with short-range interactions. First, in one-photon quantum walks, we observed the propagation of the density and correlation of the quasiparticle excitation of the superconducting qubit and quantum entanglement between qubit pairs. Second, when implementing two-photon quantum walks by exciting two superconducting qubits,we observed the fermionization of strongly interacting photons from the measured time-dependent long-range anticorrelations, representing the antibunching of photons with attractive interactions. The demonstration of quantumwalks on a quantumprocessor, using superconducting qubits as artificial atoms and tomographic readout, paves the way to quantum simulation of many-body phenomena and universal quantum computation.

Full control over the dynamics of interacting, indistinguishable quantum particles is an important prerequisite for the experimental study of strongly correlated quantum matter and the implementation of high-fidelity quantum information processing. We demonstrate such control over the quantum walk—the quantum mechanical analog of the classical random walk—in the regime where dynamics are dominated by interparticle interactions. Using interacting bosonic atoms in an optical lattice, we directly observed fundamental effects such as the emergence of correlations in two-particle quantum walks, as well as strongly correlated Bloch oscillations in tilted optical lattices. Our approach can be scaled to larger systems, greatly extending the class of problems accessible via quantum walks.

We consider the minimum of a super-critical branching random walk. Addario-Berry and Reed [Ann. Probab. 37 (2009) 1044—1079] proved the tightness of the minimum centered around its mean value. We show that a convergence in law holds, giving the analog of a well-known result of Bramson [Mem. Amer. Math. Soc. 44 (1983) iv+190] in the case of the branching Brownian motion.

Assessing the navigability of interconnected networks (transporting information, people, or goods) under eventual random failures is of utmost importance to design and protect critical infrastructures. Random walks are a good proxy to determine this navigability, specifically the coverage time of random walks, which is a measure of the dynamical functionality of the network. Here, we introduce the theoretical tools required to describe random walks in interconnected networks accounting for structure and dynamics inherent to real systems. We develop an analytical approach for the covering time of random walks in interconnected networks and compare it with extensive Monte Carlo simulations. Generally speaking, interconnected networks are more resilient to random failures than their individual layers per se, and we are able to quantify this effect. As an application––which we illustrate by considering the public transport of London––we show how the efficiency in exploring the multiplex critically depends on layers’ topology, interconnection strengths, and walk strategy. Our findings are corroborated by data-driven simulations, where the empirical distribution of check-ins and checks-out is considered and passengers travel along fastest paths in a network affected by real disruptions. These findings are fundamental for further development of searching and navigability strategies in real interconnected systems.

Quantum walks are powerful kernels in quantum computing protocols, and possess strong capabilities in speeding up various simulation and optimization tasks. One striking example is provided by quantum walkers evolving on glued trees1, which demonstrate faster hitting performances than classical random walks. However, their experimental implementation is challenging, as this involves highly complex arrangements of an exponentially increasing number of nodes. Here, we propose an alternative structure with a polynomially increasing number of nodes. We successfully map such graphs on quantum photonic chips using femtosecond-laser direct writing techniques in a geometrically scalable fashion. We experimentally demonstrate quantum fast hitting by implementing two-dimensional quantum walks on graphs with up to 160 nodes and a depth of eight layers, achieving a linear relationship between the optimal hitting time and the network depth. Our results open up a scalable path towards quantum speed-up in classically intractable complex problems.

The question of aggregating pairwise comparisons to obtain a global ranking over a collection of objects has been of interest for a very long time: be it ranking of online gamers (e.g., MSR’s TrueSkill system) and chess players, aggregating social opinions, or deciding which product to sell based on transactions. In most settings, in addition to obtaining a ranking, finding ‘scores’ for each object (e.g., player’s rating) is of interest for understanding the intensity of the preferences. In this paper, we propose Rank Centrality , an iterative rank aggregation algorithm for discovering scores for objects (or items) from pairwise comparisons. The algorithm has a natural random walk interpretation over the graph of objects with an edge present between a pair of objects if they are compared; the score, which we call Rank Centrality, of an object turns out to be its stationary probability under this random walk. To study the efficacy of the algorithm, we consider the popular Bradley-Terry-Luce (BTL) model (equivalent to the Multinomial Logit (MNL) for pairwise comparisons) in which each object has an associated score that determines the probabilistic outcomes of pairwise comparisons between objects. In terms of the pairwise marginal probabilities, which is the main subject of this paper, the MNL model and the BTL model are identical. We bound the finite sample error rates between the scores assumed by the BTL model and those estimated by our algorithm. In particular, the number of samples required to learn the score well with high probability depends on the structure of the comparison graph. When the Laplacian of the comparison graph has a strictly positive spectral gap, e.g., each item is compared to a subset of randomly chosen items, this leads to dependence on the number of samples that is nearly order optimal. Experimental evaluations on synthetic data sets generated according to the BTL model show that our algorithm performs as well as the maximum likelihood estimator for that model and outperforms other popular ranking algorithms.

We report on the possibility of controlling quantum random walks (QWs) with a step-dependent coin (SDC). The coin is characterized by a (single) rotation angle. Considering different rotation angles, one can find diverse probability distributions for this walk including: complete localization, Gaussian and asymmetric likes. In addition, we explore the entropy of walk in two contexts; for probability density distributions over position space and walker's internal degrees of freedom space (coin space). We show that entropy of position space can decrease for a SDC with the step-number, quite in contrast to a walk with step-independent coin (SIC). For entropy of coin space, a damped oscillation is found for walk with SIC while for a SDC case, the behavior of entropy depends on rotation angle. In general, we demonstrate that quantum walks with simple initiatives may exhibit a quite complex and varying behavior if SDCs are applied. This provides the possibility of controlling QW with a SDC.

We study the asymptotic behavior of a multidimensional random walk in a general cone. We find the tail asymptotics for the exit time and prove integral and local limit theorems for a random walk conditioned to stay in a cone. The main step in the proof consists in constructing a positive harmonic function for our random walk under minimal moment restrictions on the increments. For the proof of tail asymptotics and integral limit theorems, we use a strong approximation of random walks by Brownian motion. For the proof of local limit theorems, we suggest a rather simple approach, which combines integral theorems for random walks in cones with classical local theorems for unrestricted random walks. We also discuss some possible applications of our results to ordered random walks and lattice path enumeration.

On torsion Grigorchuk groups we construct random walks of finite entropy and power-law tail decay with non-trivial Poisson boundary. Such random walks provide near optimal volume lower estimates for these groups. In particular, for the first Grigorchuk group G we show that its growth vG,S(n) satisfies limn→∞loglogvG,S(n)/logn=α0, where α0=log2logλ0≈0.7674, λ0 is the positive root of the polynomial X3-X2-2X-4.