Related papers: Encoding qubits into harmonic-oscillator modes via…
Discrete time (coined) quantum walks are produced by the repeated application of a constant unitary transformation to a quantum system. By recasting these walks into the setting of periodic perturbations to an otherwise freely evolving…
The aim of this paper is to build quantum circuits that implement discrete-time quantum walks having an arbitrary position-dependent coin operator. The position of the walker is encoded in base 2: with $n$ wires, each corresponding to one…
Quantum Cryptography is a rapidly developing field of research that benefits from the properties of Quantum Mechanics in performing cryptographic tasks. Quantum walks are a powerful model for quantum computation and very promising for…
We discuss the use of high-order quantum accelerator modes to achieve an atom optical realization of a biased quantum random walk. We first discuss how one can create co-existent quantum accelerator modes, and hence how momentum transfer…
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…
Quantum Random Walks, which have drawn much attention over the past few decades for their distinctly non-classical behavior, is a promising subfield within Quantum Computing. Theoretical framework and applications for these walks have seen…
The quantum walk was originally proposed as a quantum mechanical analogue of the classical random walk, and has since become a powerful tool in quantum information science. In this paper, we show that discrete time quantum walks provide a…
We propose a scheme for perfect transfer of an unknown qubit state via the discrete-time quantum walk on a line or a circle. For this purpose, we introduce an additional coin operator which is applied at the end of the walk. This operator…
We derive the continuous spacetime limit of the one dimensional lazy discrete time quantum walk, obtaining explicit macroscopic evolution equations for a three state model in the presence of decoherence. While continuum limits of two state…
A new physical implementation for quantum computation is proposed. The vibrational modes of molecules are used to encode qubit systems. Global quantum logic gates are realized using shaped femtosecond laser pulses which are calculated…
We introduce the quantum quincunx, which physically demonstrates the quantum walk and is analogous to Galton's quincunx for demonstrating the random walk. In contradistinction to the theoretical studies of quantum walks over orthogonal…
Encoding logical quantum information in harmonic oscillator modes is a promising and hardware-efficient approach to the realization of a quantum computer. In this work, we propose to encode logical qubits in grid states of an ensemble of…
We introduce simple qubit-encodings and logic gates which eliminate the need for certain difficult single-qubit operations in superconducting phase-qubits, while preserving universality. The simplest encoding uses two physical qubits per…
The generation and control of quantum correlations in high-dimensional systems is a major challenge in the present landscape of quantum technologies. Achieving such non-classical high-dimensional resources will potentially unlock enhanced…
We implement the discrete-time quantum walk model using the continuous-time evolution of the Hamiltonian that includes both the shift and the coin generators. Based on the Trotter-Suzuki first-order approximation, we consider an…
Robust quantum computation requires encoding delicate quantum information into degrees of freedom that are hard for the environment to change. Quantum encodings have been demonstrated in many physical systems by observing and correcting…
Quantum walks, both discrete and continuous, serve as fundamental tools in quantum information processing with diverse applications. This work introduces a hybrid quantum walk model that integrates the coin mechanism of discrete walks with…
This paper examines a way to simplify the circuit of quantum random walk search algorithm, when the traversing coin is constructed by both generalized Householder reflection and an additional phase multiplier. If an appropriate relation…
In the field of fault-tolerant quantum computing, continuous-variable systems can be utilized to protect quantum information from noise through the use of bosonic codes. These codes map qubit-type quantum information onto the larger bosonic…
We extend the idea of a discrete-time quantum walk on a graph by placing a qubit on each vertex, and allowing the walker to interact with the qubit at its current position. We show that allowing for a controlled-Z interaction at each time…