Related papers: Measurement induced quantum walks on an IBM Quantu…
We present an experimental implementation of the coined discrete time quantum walk on a square using a three qubit liquid state nuclear magnetic resonance (NMR) quantum information processor (QIP). Contrary to its classical counterpart, we…
Collective measurements on identically prepared quantum systems can extract more information than local measurements, thereby enhancing information-processing efficiency. Although this nonclassical phenomenon has been known for two decades,…
We consider one-dimensional quantum walks in optical linear networks with synthetically introduced disorder and tunable system parameters allowing for the engineered realization of distinct topological phases. The option to directly monitor…
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…
The quantum walk is the quantum analogue of the well-known random walk, which forms the basis for models and applications in many realms of science. Its properties are markedly different from the classical counterpart and might lead to…
Quantum systems subject to random unitary evolution and measurements at random points in spacetime exhibit entanglement phase transitions which depend on the frequency of these measurements. Past work has experimentally observed…
The staggered quantum walk is a type of discrete-time quantum walk model without a coin which can be generated on a graph using particular partitions of the graph nodes. We design Hamiltonians for potential realization of the staggered…
Measurement has a special role in quantum theory: by collapsing the wavefunction it can enable phenomena such as teleportation and thereby alter the "arrow of time" that constrains unitary evolution. When integrated in many-body dynamics,…
In the formalism of measurement based quantum computation we start with a given fixed entangled state of many qubits and perform computation by applying a sequence of measurements to designated qubits in designated bases. The choice of…
Quantum walks are expected to provide useful algorithmic tools for quantum computation. This paper introduces absorbing probability and time of quantum walks and gives both numerical simulation results and theoretical analyses on Hadamard…
A one-dimensional quantum oscillator is monitored by taking repeated position measurements. As a first con- tribution, it is shown that, under a quantum nondemolition measurement scheme applied to a system initially at the ground state, (i)…
The quantum random walk is a possible approach to construct new quantum algorithms. Several groups have investigated the quantum random walk and experimental schemes were proposed. In this paper we present the experimental implementation of…
Quantum computers are expected to contribute more efficient and accurate ways of modeling economic processes. Quantum hardware is currently available at a relatively small scale, but effective algorithms are limited by the number of logic…
One of the proposals for the exploitation of two-dimensional quantum walks has been the efficient generation of entanglement. Unfortunately, the technological effort required for the experimental realization of standard two-dimensional…
Quantum walks in atomic systems, owing to their continuous nature, are especially well-suited for the simulation of many-body physics and can potentially offer an exponential speedup in solving certain black box problems. Photonics offers…
Quantum walks are powerful tools for quantum applications and for designing topological systems. Although they are simulated in a variety of platforms, genuine two-dimensional realizations are still challenging. Here we present an…
Quantum walk represents one of the most promising resources for the simulation of physical quantum systems, and has also emerged as an alternative to the standard circuit model for quantum computing. Up to now the experimental…
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…
We make and generalize the observation that summing of probability amplitudes of a discrete-time quantum walk over partitions of the walking graph consistent with the step operator results in a unitary evolution on the reduced graph which…
We investigate the use of discrete-time quantum walks to sample from an almost-uniform distribution, in the absence of any external source of randomness. Integers are encoded on the vertices of a cycle graph, and a quantum walker evolves…