相关论文: Implement Quantum Random Walks with Linear Optics …

We propose an implementation scheme for the continuous-time quantum walk using a diatomic molecule and an optical frequency comb. We show an analogy between the quantum walk and the cascade rotational transitions induced by the optical…

The Scattering Quantum Random Walk scheme has found success as a basis for search algorithms on highly symmetric graph structures. In this paper we examine its effectiveness at locating a specially marked vertex on square grid graphs,…

This paper presents a novel quantum walk approach to simulating parton showers on a quantum computer. We demonstrate that the quantum walk paradigm offers a natural and more efficient approach to simulating parton showers on quantum…

We study quantum walk on a ladder with combination of conventional and split-step protocols. The two components of the walk resulting from periodic boundary conditions can be made to have three kinds of probability distributions. Two of…

Quantum walks exhibit many unique characteristics compared to classical random walks. In the classical setting, self-avoiding random walks have been studied as a variation on the usual classical random walk. Classical self-avoiding random…

We present a method to map the evolution of photonic random walks that is compatible with nonclassical input light. Our approach leverages a newly developed flexible waveguide platform to tune the jumping rate between spatial modes,…

We use simple deterministic dynamical systems as coins in studying quantum walks. These dynamical systems can be chosen to display, in the classical limit, a range of behaviors from the integrable to chaotic, or deterministically random. As…

We present a scheme which offers a significant reduction in the resources required to implement linear optics quantum computing. The scheme is a variation of the proposal of Knill, Laflamme, and Milburn, and makes use of an incremental…

We observe that changing a phase at a single point in a discrete quantum walk results in a rather surprising localization effect. For certain values of this phase change the possibility of localization strongly depends on the internal…

Quantum gates are crucial for processing quantum information, but implementing them in a photonic platform poses unique challenges due to the peculiar way photons propagate and interfere. Here, we examine quantum photonic gates that utilize…

In this study we show a way of achieving the reverse evolution of n-dimensional quantum walks by introducing interventions on the coin degree of freedom during the forward progression of the coin-walker system. Only a single intervention is…

In this note, we discuss a general definition of quantum random walks on graphs and illustrate with a simple graph the possibility of very different behavior between a classical random walk and its quantum analogue. In this graph,…

Random quantum circuits take an input quantum state and randomize it. This is a task with a growing number of identified uses in quantum information processing. We suggest a scheme to implement random circuits in a weighted graph state. The…

Quantum walk is a key operation in quantum computing, simulation, communication and information. Here, we report for the first time the demonstration of quantum walks and localized quantum walks in a new type of optical fibers having a ring…

Quantum walks have by now been realized in a large variety of different physical settings. In some of these, particularly with trapped ions, the walk is implemented in phase space, where the corresponding position states are not orthogonal.…

This work proposes a computational procedure that uses a quantum walk in a complete graph to train classical artificial neural networks. The idea is to apply the quantum walk to search the weight set values. However, it is necessary to…

We present a review of photonic implementations of discrete-time quantum walks (DTQW) in the spatial and temporal domains, based on spatial- and time-multiplexing techniques, respectively. Additionally, we propose a detailed novel scheme…

The lackadaisical quantum walk is a quantum analogue of the lazy random walk obtained by adding a self-loop to each vertex in the graph. We analytically prove that lackadaisical quantum walks can find a unique marked vertex on any regular…

We analyze the strengths and limitations of steered discrete time quantum walks in generating quantum states of bipartite quantum systems comprising of a qubit coupled to a qudit system. We demonstrate that not all quantum states in the…

Quantum walks provide a framework for understanding and designing quantum algorithms that is both intuitive and universal. To leverage the computational power of these walks, it is important to be able to programmably modify the graph a…