Related papers: Efficient implementation of discrete-time quantum …
In this work, we present a new algorithm for generating quantum circuits that efficiently implement continuous time quantum walks on arbitrary simple sparse graphs. The algorithm, called matching decomposition, works by decomposing a…
Simulation and programming of current quantum computers as Noisy Intermediate-Scale Quantum (NISQ) devices represent a hot topic at the border of current physical and information sciences. The quantum walk process represents a basic…
Discrete-time Quantum Walks (QWs) are transportation models of single quantum particles over a lattice. Their evolution is driven through causal and local unitary operators. QWs are a powerful tool for quantum simulation of fundamental…
The execution of quantum circuits on real systems has largely been limited to those which are simply time-ordered sequences of unitary operations followed by a projective measurement. As hardware platforms for quantum computing continue to…
Quantum walks (QW) are of crucial importance in the development of quantum information processing algorithms. Recently, several quantum algorithms have been proposed to implement network analysis, in particular to rank the centrality of…
Signaled by non-analyticities in the time evolution of physical observables, dynamic quantum phase transitions (DQPTs) emerge in quench dynamics of topological systems and possess an interesting geometric origin captured by dynamic…
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…
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…
Classical algorithms are often not effective for solving nonconvex optimization problems where local minima are separated by high barriers. In this paper, we explore possible quantum speedups for nonconvex optimization by leveraging the…
A new family of discrete-time quantum walks (DTQWs) propagating on a regular $(1+2)$D spacetime lattice is introduced. The continuous limit of these DTQWs is shown to coincide with the dynamics of a Dirac fermion interacting with an…
Open Quantum Walks (OQWs) are exclusively driven by dissipation and are formulated as completely positive trace preserving (CPTP) maps on underlying graphs. The microscopic derivation of discrete and continuous in time OQWs is presented. It…
Distributed quantum computing (DQC) provides a way to scale quantum computers using multiple quantum processing units (QPU) connected through quantum communication links. In this paper, we have built a distributed quantum computing…
We introduce the driven discrete time quantum walk, where walkers are added during the walk instead of only at the beginning. This leads to interference in walker number and very different dynamics when compared to the original quantum…
Recently, several groups have investigated quantum analogues of random walk algorithms, both on a line and on a circle. It has been found that the quantum versions have markedly different features to the classical versions. Namely, the…
The Quantum Fourier transform (QFT) is a key ingredient in most quantum algorithms. We have compared various spin-based quantum computing schemes to implement the QFT from the point of view of their actual time-costs and the accuracy of the…
In this dissertation we demonstrate that the continuous-time quantum walk models remain powerful for nontrivial graph structures. We consider two aspects of this problem. First, it is known that the standard Continuous-Time Quantum Walk…
We report the experimental measurement of the winding number in an unitary chiral quantum walk. Fundamentally, the spin-orbit coupling in discrete time quantum walks is implemented via birefringent crystal collinearly cut based on…
In the noisy intermediate-scale quantum (NISQ) era, flexible quantum operations are essential for advancing large-scale quantum computing, as they enable shorter circuits that mitigate decoherence and reduce gate errors. However, the…
Quantum walks with one-dimensional translational symmetry are important for quantum algorithms, where the speed-up of the diffusion speed can be reached if long-range couplings are added. Our work studies a scheme of a ring under the strong…
In an interacting continuous time quantum walk, while the walker (the cursor) is moving on a graph, computational primitives (unitary operators associated with the edges) are applied to ancillary qubits (the register). The model with one…