We introduce a graph-theoretic framework for representing color-ordered maximally helicity violating (MHV) scattering amplitudes in quantum chromodynamics using coined quantum walks on permutation trees. Each root-to-terminal path corresponds to a distinct color ordering of the external gluons, while local transition amplitudes are assigned according to the spinor-product structure of the Parke--Taylor amplitudes. The walk evolves in coherent superpositions over permutation sectors, giving a dynamical picture of the underlying combinatorics. A quantum-channel formulation based on Kraus operators is also introduced to describe sector-resolved contributions, while a weighted collection operator coherently combines the terminal sectors at a common reference node. A quantum Fourier transform on the coin space is then employed to combine the encoded contributions into the corresponding color-decomposed amplitude. Together, these constructions establish a unified graph-based framework connecting permutation trees, quantum walks, and open quantum systems providing a framework for quantum algorithms to simulate scattering processes in quantum field theory. As an example, numerical results for low-point gluon amplitudes demonstrate that the proposed representation faithfully captures the characteristic Parke--Taylor structure and is consistent with analytical results.
Transport regimes of biphoton-state quantum walks in ordered and disordered arrays of nonlinear waveguides
Centro de Investigación en Ciencia e Ingeniería de Materiales, Universidad de Costa Rica（哥斯达黎加大学材料科学与工程研究中心）；Escuela de Física, Universidad de Costa Rica（哥斯达黎加大学物理学院）
Out-of time-ordered correlators (OTOC) have recently attracted significant attention from the physics of many-body systems, to quantum black-holes, with an exponential growth of the OTOC indicating quantum chaos. Here we consider OTOC in the context of coined discrete quantum walks, a very well studied model of quantization of classical random walks with applications to quantum algorithms. Three separate cases of operators, variously localized in the coin and walker spaces, are discussed in this context and it is found that the approximated behavior of the OTOCs is well described by simple alg…
We study the effects of long-range hopping and long-range inter-particle interactions on quantum walk of hard-core bosons in ideal and disordered one-dimensional lattices. We find that the range of hopping has a much more significant effect on the particle correlation dynamics than the range of interactions. We illustrate that long-range hopping makes the correlation diagrams asymmetric with respect to the sign of the interaction and examine the relative role of repulsive and attractive interactions on the dynamics of scattering by isolated impurities and Anderson localization in dis- ordered …
It is shown that the hopping of a single excitation on certain triangular spin lattices with non-uniform couplings and local magnetic fields can be described as the projections of quantum walks on graphs of the ordered Hamming scheme of depth 2. For some values of the parameters the models exhibit perfect state transfer between two summits of the lattice. Fractional revival is also observed in some instances. The bivariate Krawtchouk polynomials of the Tratnik type that form the eigenvalue matrices of the ordered Hamming scheme of depth 2 give the overlaps between the energy eigenstates and th…
In this work we present the quantum mechanical computer proposed by Feynman in 1985 and, since then, widely cited but seldom used. The main feature of the model is the presence of a built in clocking mechanism managing for the ordered application of the computational primitives to the input/output register.
We find out a few ways to improve the realization of entanglement between the internal (spin) and external (position) degrees of freedom of a quantum particle, through the insertion of disordered time steps along a one-dimensional discrete time quantum walk. The disorder is introduced by a randomly chosen quantum coin obtained from a uniform distribution among infinite quantum coins or only between Hadamard and Fourier coins for all the time steps. We can also decrease the amount of disorder by alternating disordered and ordered time steps along a quantum walk or by establishing a probability …
Topologically ordered materials may serve as a platform for new quantum technologies such as fault-tolerant quantum computers. To fulfil this promise, efficient and general methods are needed to discover and classify new topological phases of matter. We demonstrate that deep neural networks augmented with external memory can use the density profiles formed in quantum walks to efficiently identify properties of a topological phase as well as phase transitions. On a trial topological ordered model, our method's accuracy of topological phase identification reaches 97.4%, and is shown to be robust…
This article proposes the first discrete-time implementation of Rydberg quantum walk in multi-dimensional spatial space that could ideally simulate different classes of topological insulators. Using distance-selective exchange-interaction between Rydberg excited atoms in an atomic array with dual lattice-constants, the new setup operates both coined and coin-less models of discrete-time quantum walk (DTQW). Here, complicated coupling tessellations are performed by a global laser that exclusively excites the site at the anti-blockade region. The long-range interaction provides a new feature of …
Continuous-time quantum walks (CTQWs) on static graphs provide efficient methods for search and sampling as well as a model for universal quantum computation. We consider an extension of CTQWs to the case of dynamic graphs, in which an ordered sequence of graphs governs free evolution of the quantum walk. We then consider how perfect state transfer during the quantum walk can be used to design dynamic graphs that implement a universal set of quantum logic gates. We give explicit examples for a complete logical basis, and we validate implementations using numerical simulations for quantum telep…
The one dimensional quantum walk of anyonic systems is presented. The anyonic walker performs braiding operations with stationary anyons of the same type ordered canonically on the line of the walk. Abelian as well as non-Abelian anyons are studied and it is shown that they have very different properties. Abelian anyonic walks demonstrate the expected quadratic quantum speedup. Non-Abelian anyonic walks are much more subtle. The exponential increase of the system's Hilbert space and the particular statistical evolution of non-Abelian anyons give a variety of new behaviors. The position distrib…
A novel bulk optics scheme for quantum walks is presented. It consists of a one-dimensional lattice built on two concatenated displaced Sagnac interferometers that make it possible to reproduce all the possible trajectories of an optical quantum walk. Because of the closed loop configuration, the interferometric structure is intrinsically stable in phase. Moreover, the lattice structure is highly configurable, as any phase component perceived by the walker is accessible, and finally, all output modes can be measured at any step of the quantum walk evolution. We report here on the experimental …
We investigate how the introduction of different types of disorder affects the generation of entanglement between the internal (spin) and external (position) degrees of freedom in one-dimensional quantum random walks (QRW). Disorder is modeled by adding another random feature to QRW, i.e., the quantum coin that drives the system's evolution is randomly chosen at each position and/or at each time step, giving rise to either dynamic, fluctuating, or static disorder. The first one is position-independent, with every lattice site having the same coin at a given time, the second has time and positi…
The presence of disorder and inhomogeneities in quantum networks has often been unexpectedly beneficial for both quantum and classical resources. Here, we experimentally realize a controllable inhomogenous Quantum Walk dynamics, which can be exploited to investigate the effect of coherent disorder on the quantum correlations between two indistinguishable photons. Through the imposition of suitable disorder configurations, we observe two photon states which exhibit an enhancement in the quantum correlations between two modes of the network, compared to the case of an ordered Quantum Walk. Diffe…
We show that the entanglement between the internal (spin) and external (position) degrees of freedom of a qubit in a random (dynamically disordered) one-dimensional discrete time quantum random walk (QRW) achieves its maximal possible value asymptotically in the number of steps, outperforming the entanglement attained by using ordered QRW. The disorder is modeled by introducing an extra random aspect to QRW, a classical coin that randomly dictates which quantum coin drives the system's time evolution. We also show that maximal entanglement is achieved independently of the initial state of the …
It has been shown classically that combining two chaotic random walks can yield an ordered(periodic) walk. Our aim in this paper is to find a quantum analog for this rather counter-intuitive result. We study chaotic and periodic nature of cyclic quantum walks and focus on a unique situation wherein a periodic quantum walk on a 3-cycle graph is generated via a deterministic combination of two chaotic quantum walks on the same graph. We extend our results to even-numbered cyclic graphs, specifically a 4-cycle graph too. Our results will be relevant in quantum cryptography and quantum chaos contr…
Recent findings suggest that processes such as the electronic energy transfer through the photosynthetic antenna display quantal features, aspects known from the dynamics of charge carriers along polymer backbones. Hence, in modeling energy transfer one has to leave the classical, master-equation-type formalism and advance towards an increasingly quantum-mechanical picture, while still retaining a local description of the complex network of molecules involved in the transport, say through a tight-binding approach. Interestingly, the continuous time random walk (CTRW) picture, widely employed i…
We study spatial search with continuous-time quantum walks on real-world complex networks. We use smaller replicas of the Internet network obtained with a recent geometric renormalization method introduced by García-Pérez et al., Nat. Phys. 14, 583 (2018). This allows us to infer for the first time the behavior of a quantum spatial search algorithm on a real-world complex network. By simulating numerically the dynamics and optimizing the coupling parameter, we study the optimality of the algorithm and its scaling with the size of the network, showing that on average it is considerably better t…
Rapid Mixing of Parallel Kac's Walk: From Spheres to Stiefel Manifolds
The Chinese University of Hong Kong, Shenzhen（香港中文大学（深圳））；National University of Singapore（新加坡国立大学）；Portland State University（波特兰州立大学）；Nanjing University（南京大学）；Hefei National Laboratory（合肥国家实验室）
Quantum magnets are never short of novel and fascinating dynamics, yet its simulation by classical computers requires exponentially-scaled computation resources, which renders the research on large-scale many-body dynamics fiendishly difficult. In this letter, we explore the dynamic behavior of 2D large-scale ferromagnetic J1-J2 Heisenberg model both theoretically and experimentally. First, the analytical solution of magnon dynamics is obtained to show an obvious ballistic propagation of magnon, which is typical for quantum walk. Then, we verify the dynamic behavior of the system through numer…
To investigate the performance of quantum information tasks on networks whose topology changes in time, we study the spatial search algorithm by continuous time quantum walk to find a marked node on a random temporal network. We consider a network of $n$ nodes constituted by a time-ordered sequence of Erdös-Rényi random graphs $G(n,p)$, where $p$ is the probability that any two given nodes are connected: after every time interval $τ$, a new graph $G(n,p)$ replaces the previous one. We prove analytically that for any given $p$, there is always a range of values of $τ$ for which the running time…
We present and analyze protocols for fault-tolerant quantum computing using color codes. We present circuit-level schemes for extracting the error syndrome of these codes fault-tolerantly. We further present an integer-program-based decoding algorithm for identifying the most likely error given the syndrome. We simulated our syndrome extraction and decoding algorithms against three physically-motivated noise models using Monte Carlo methods, and used the simulations to estimate the corresponding accuracy thresholds for fault-tolerant quantum error correction. We also used a self-avoiding walk …
