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.

Elephant random walk is a kind of one-dimensional discrete-time random walk with infinite memory: For each step, with probability α the walker adopts one of his/her previous steps uniformly chosen at random, and otherwise he/she performs like a simple random walk (possibly with bias). It admits a phase transition from diffusive to superdiffusive behavior at the critical value αc=1/2 . For α∈(αc,1) , there is a scaling factor an of order nα such that the position Sn of the walker at time n scaled by an converges to a nondegenerate random variable W^ , whose distribution is not Gaussian. Our main result shows that the fluctuation of Sn around W^·an is still Gaussian. We also give a description of a phase transition induced by bias decaying polynomially in time.

In this paper, we consider a stochastic process that may experience random reset events which relocate the system to its starting position. We focus our attention on a one-dimensional, monotonic continuous-time random walk with a constant drift: the process moves in a fixed direction between the reset events, either by the effect of the random jumps, or by the action of a deterministic bias. However, the orientation of its motion is randomly determined after each restart. As a result of these alternating dynamics, interesting properties do emerge. General formulas for the propagator as well as for two extreme statistics, the survival probability and the mean first-passage time, are also derived. The rigor of these analytical results is verified by numerical estimations, for particular but illuminating examples.

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.

It was recently conjectured by Fyodorov, Hiary and Keating that the maximum of the characteristic polynomial on the unit circle of a N × N random unitary matrix sampled from the Haar measure grows like C N / ( log N ) 3 / 4 for some random variable C . In this paper, we verify the leading order of this conjecture, that is, we prove that with high probability the maximum lies in the range [ N 1 - ε , N 1 + ε ] , for arbitrarily small ε . The method is based on identifying an approximate branching random walk in the Fourier decomposition of the characteristic polynomial, and uses techniques developed to describe the extremes of branching random walks and of other log-correlated random fields. A key technical input is the asymptotic analysis of Toeplitz determinants with dimension-dependent symbols. The original argument for these asymptotics followed the general idea that the statistical mechanics of 1/ f -noise random energy models is governed by a freezing transition. We also prove the conjectured freezing of the free energy for random unitary matrices.