Several research groups are giving special attention to quantum walks recently, because this research area have been used with success in the development of new efficient quantum algorithms. A general simulator of quantum walks is very important for the development of this area, since it allows the researchers to focus on the mathematical and physical aspects of the research instead of deviating the efforts to the implementation of specific numerical simulations. In this paper we present QWalk, a quantum walk simulator for one- and two-dimensional lattices. Finite two-dimensional lattices with generic topologies can be used. Decoherence can be simulated by performing measurements or by breaking links of the lattice. We use examples to explain the usage of the software and to show some recent results of the literature that are easily reproduced by the simulator.
Quantum walk (QW) provides a versatile tool to study fundamental physics and also to make a variety of practical applications. We here start with the recent idea of {\it nonlinear} QW and show that introducing {\it nonlinearity} to QW can lead to a wealth of remarkable possibilities, e.g., simulating nonlinear quantum dynamics thus enhancing the applicability of QW above the existing level for a universal quantum simulator. As an illustration, we show that the dynamics of a nonlinear Dirac particle can be simulated on an optical nonlinear QW platform implemented with a measurement-based-feedfo…
We analyze the simulation of Dirac neutrino oscillations using quantum walks, both in vacuum and in matter. We show that this simulation, in the continuum limit, reproduces a set of coupled Dirac equations that describe neutrino flavor oscillations, and we make use of this to establish a connection with neutrino phenomenology, thus allowing to fix the parameters of the simulation for a given neutrino experiment. We also analyze how matter effects for neutrino propagation can be simulated in the quantum walk. In this way, important features, such as the MSW effect, can be incorporated. Thus, th…
In recent years, quantum walks have been widely researched and have shown exciting properties. One such is a quadratic speed-up in hitting time compared to its classical counterpart. In this paper, we design a quantum circuit for the MNRS algorithm, which finds a marked node in a graph with a quantum walk, and use it to find a hitting time for the marked nodes in the walk. We do this by implementing the circuit on IBM quantum simulators and show that the execution on a noise-free simulator results in hitting times that agree with the theoretical expectations. We also run the algorithm on a moc…
Observing Quantum Correlation Dynamics in Tunable Superconducting Bose-Hubbard Simulators
Beijing Academy of Quantum Information Sciences（北京量子信息科学研究院）；Institute of Physics, Chinese Academy of Sciences（中国科学院物理研究所）；University of Chinese Academy of Sciences（中国科学院大学）
Estimation of the coin parameter(s) is an important part of the problem of implementing more robust schemes for quantum simulation using quantum walks. We present the estimation of the quantum coin parameter used for one-dimensional discrete-time quantum walk evolution using machine learning algorithms on their probability distributions. We show that the models we have implemented are able to estimate these evolution parameters to a good accuracy level. We also implement a deep learning model that is able to predict multiple parameters simultaneously. Since discrete-time quantum walks can be u…
We present a protocol to implement discrete-time quantum walks and simulate topological insulator phases in cavity-based quantum networks, where the single photon is the quantum walker and the cavity input-output process is employed to realize the state-dependent translation operation. Different topological phases can be simulated through tuning the single-photon polarization rotation angles. We show that both the topological boundary states and topological phase transitions can be directly observed via measuring the final photonic density distribution. Moreover, we also demonstrate that these…
Transport phenomena play a crucial role in modern physics and applied sciences. Examples include the dissipation of energy across a large system, the distribution of quantum information in optical networks, and the timely modeling of spreading diseases. In this work, we experimentally prove the feasibility of disordered quantum walks to realize a quantum simulator that is able to model general subdiffusive phenomena, exhibiting a sublinear spreading in space over time. Our experiment simulates such phenomena by means of a finely controlled insertion of various levels of disorder during the evo…
The goal of teleportation is to transfer the state of one particle to another particle. In coined quantum walks, conditional shift operators can introduce entanglement between position space and coin space. This entanglement resource can be used as a quantum channel for teleportation, as proposed by Wang, Shang and Xue [Quantum Inf. Process. 16, 221 (2017)]. Here, we demonstrate the implementation of quantum teleportation using quantum walks on a five-qubit quantum computer and a 32-qubit simulator provided by IBM quantum experience beta platform. We show the teleportation of single-qubit, two…
The discrete time quantum walk defined as a quantum-mechanical analogue of the discrete time random walk have recently been attracted from various and interdisciplinary fields. In this review, the weak limit theorem, that is, the asymptotic behavior, of the one-dimensional discrete time quantum walk is analytically shown. From the limit distribution of the discrete time quantum walk, the discrete time quantum walk can be taken as the quantum dynamical simulator of some physical systems.
Quantum walks are versatile simulators of topological phases and phase transitions as observed in condensed matter physics. Here, we utilize a step dependent coin in quantum walks and investigate what topological phases we can simulate with it, their topological invariants, bound states and possibility of phase transitions. These quantum walks simulate non-trivial phases characterized by topological invariants (winding number) $\pm 1$ which are similar to the ones observed in topological insulators and polyacetylene. We confirm that the number of phases and their corresponding bound states inc…
Discrete quantum walks are dynamical protocols for controlling a single quantum particle. Despite of its simplicity, quantum walks display rich topological phenomena and provide one of the simplest systems to study and understand topological phases. In this article, we review the physics of discrete quantum walks in one and two dimensions in light of topological phenomena and provide elementary explanations of topological phases and their physical consequence, namely the existence of boundary states. We demonstrate that quantum walks are versatile systems that simulate many topological phases …
We present a systematic study of quantum system compression for the evolution of generic many-body problems. The necessary numerical simulations of such systems are seriously hindered by the exponential growth of the Hilbert space dimension with the number of particles. For a \emph{constant} Hamiltonian system of Hilbert space dimension $n$ whose frequencies range from $f_{\min}$ to $f_{\max}$, we show via a proper orthogonal decomposition, that for a run-time $T$, the dominant dynamics are compressed in the neighborhood of a subspace whose dimension is the smallest integer larger than the tim…
Discrete-time quantum walks can be regarded as quantum dynamical simulators since they can simulate spatially discretized Schrödinger, massive Dirac, and Klein-Gordon equations. Here, two different types of Fibonacci discrete-time quantum walks are studied analytically. The first is the Fibonacci coin sequence with a generalized Hadamard coin and demonstrates six-step periodic dynamics. The other model is assumed to have three- or six-step periodic dynamics with the Fibonacci sequence. We analytically show that these models have ballistic transportation properties and continuous limits identic…
Quantum walks function as essential means to implement quantum simulators, allowing one to study complex and often directly inaccessible quantum processes in controllable systems. In this contribution, the notion of a driven Gaussian quantum walk is introduced. In contrast to typically considered quantum walks in optical settings, we describe the operation of the walk in terms of a nonlinear map rather than a unitary operation, e.g., by replacing a beam-splitter-type coin with a two-mode squeezer, being a process that is controlled and driven by a pump field. This opens previously unattainable…
We propose a scheme for the realization of a quantum walker and a quantum simulator for the Dirac equation with ultracold spinor atoms in driven optical lattices. A precise control of the dynamics of the atomic matter wave can be realized using time-dependent external forces. If the force depends on the spin state of the atoms, the dynamics will entangle the inner and outer degrees of freedom which offers unique opportunities for quantum information and quantum simulation. Here, we introduce a method to realize a quantum walker based on the state-dependent transport of spinor atoms and a coher…
We experimentally investigate a scheme for studying lattice transport phenomena, based on the controlled momentum-space dynamics of ultracold atomic matter waves. In the effective tight-binding models that can be simulated, we demonstrate that this technique allows for a local and time-dependent control over all system parameters, and additionally allows for single-site resolved detection of atomic populations. We demonstrate full control over site-to-site off-diagonal tunneling elements (amplitude and phase) and diagonal site-energies, through the observation of continuous-time quantum walks,…
We simulate various topological phenomena in condense matter, such as formation of different topological phases, boundary and edge states, through two types of quantum walk with step-dependent coins. Particularly, we show that one-dimensional quantum walk with step-dependent coin simulates all types of topological phases in BDI family, as well as all types of boundary and edge states. In addition, we show that step-dependent coins provide the number of steps as a controlling factor over the simulations. In fact, with tuning number of steps, we can determine the occurrences of boundary, edge st…
Computing using a continuous-time evolution, based on the natural interaction Hamiltonian of the quantum computer hardware, is a promising route to building useful quantum computers in the near-term. Adiabatic quantum computing, quantum annealing, computation by continuous-time quantum walk, and special purpose quantum simulators all use this strategy. In this work, we carry out a detailed examination of adiabatic and quantum walk implementation of the quantum search algorithm, using the more physically realistic hypercube connectivity, rather than the complete graph, for our base Hamiltonian.…
IRT Saint Exupery（圣埃克苏佩里技术研究所）；Université Paul Sabatier（保罗·萨巴捷大学）；IRIT（图卢兹信息学研究所）
Quantum walks on binary trees are used in many quantum algorithms to achieve important speedup over classical algorithms. The formulation of this kind of algorithms as quantum circuit presents the advantage of being easily readable, executable on circuit based quantum computers and simulators and optimal on the usage of resources. We propose a strategy to compose quantum circuit that performs quantum walk on binary trees following universal gate model quantum computation principles. We give a particular attention to NAND formula evaluation algorithm as it could have many applications in game t…
Quantum walks are an analog of classical random walks in quantum systems. Quantum walks have smaller hitting times compared to classical random walks on certain types of graphs, leading to a quantum advantage of quantum-walks-based algorithms. An important feature of quantum walks is that they are accompanied by the excitation transfer from one site to another, and a moment of hitting the destination site is characterized by the maximum probability amplitude of observing the excitation on this site. It is therefore prospective to consider such problems as candidates for quantum advantage demon…
Many phenomena in solid-state physics can be understood in terms of their topological properties. Recently, controlled protocols of quantum walks are proving to be effective simulators of such phenomena. Here we report the realization of a photonic quantum walk showing both the trivial and the non-trivial topologies associated with chiral symmetry in one-dimensional periodic systems, as in the Su-Schrieffer-Heeger model of polyacetylene. We find that the probability distribution moments of the walker position after many steps behave differently in the two topological phases and can be used as …
Measurements on a quantum particle unavoidably affect its state, since the otherwise unitary evolution of the system is interrupted by a non-unitary projection operation. In order to probe measurement-induced effects in the state dynamics using a quantum simulator, the challenge is to implement controlled measurements on a small subspace of the system and continue the evolution from the complementary subspace. A powerful platform for versatile quantum evolution is represented by photonic quantum walks due to their high control over all relevant parameters. However, measurement-induced dynamics…
In recent years, there has been an emerging trend of combining two innovations in computer science and physics to achieve better computation capability. Exploring the potential of quantum computation to achieve highly efficient performance in various tasks is a vital development in engineering and a valuable question in sciences, as it has a significant potential to provide exponential speedups for technologically complex problems that are specifically advantageous to quantum computers. However, one key issue in unleashing this potential is constructing an efficient approach to load classical …
Simulations of one quantum system by an other has an implication in realization of quantum machine that can imitate any quantum system and solve problems that are not accessible to classical computers. One of the approach to engineer quantum simulations is to discretize the space-time degree of freedom in quantum dynamics and define the quantum cellular automata (QCA), a local unitary update rule on a lattice. Different models of QCA are constructed using set of conditions which are not unique and are not always in implementable configuration on any other system. Dirac Cellular Automata (DCA) …
A quantum computer, i.e. utilizing the resources of quantum physics, superposition of states and entanglement, could furnish an exponential gain in computing time. A simulation using such resources is called a quantum simulation. The advantage of quantum simulations over classical ones is well established at the theoretical, i.e. software level. Their practical benefit requires their implementation on a quantum hardware. The quantum computer, i.e. the universal one (see below), has not seen the light of day yet, but the efforts in this direction are both growing and diverse. Also, quantum simu…
Following the recent observation of wave function revivals in large Rydberg atom quantum simulators, much effort has focused on understanding the emergence of many-body scars in non-integrable quantum systems. Here we explore the origin of scarred wavefunction revivals in a family of models obtained by deforming the graph adjacency matrix of the PXP model - the effective model of Rydberg atoms in the strong Rydberg blockade regime. We consider deformations that either enhance the Rydberg constraint, ultimately resulting in an effective tight-binding model of two hypercubes joined at a single v…
This manuscript gathers and subsumes a long series of works on using QW to simulate transport phenomena. Quantum Walks (QWs) consist of single and isolated quantum systems, evolving in discrete or continuous time steps according to a causal, shift-invariant unitary evolution in discrete space. We start reminding some necessary fundamentals of linear algebra, including the definitions of Hilbert space, tensor state, the definition of linear operator and then we briefly present the principles of quantum mechanics on which this thesis is grounded. After having reviewed the literature of QWs and t…
University of Plymouth（普利茅斯大学）；Interdisciplinary Centre for Computer Music Research (ICCMR)（计算机音乐跨学科研究中心（ICCMR））
Quantum computing is emerging as a promising technology, which is built on the principles of subatomic physics. By the time of writing, fully fledged practical quantum computers are not widely available. But research and development are advancing rapidly. Various software simulators are already available. And a few companies have already started to provide access to quantum hardware via the cloud. These initiatives have enabled experiments with quantum computing to tackle some realistic problems in science; e.g., in chemistry and cryptography. In spite of continuing progress in developing incr…
