Related papers: Efficient implementation of discrete-time quantum …
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,…
In the present paper, the first in a series of two, we propose a model of universal quantum computation using a fermionic/bosonic multi-particle continuous-time quantum walk with two internal states (e.g., the spin-up and down states of an…
In this paper, we present a detailed study on discrete-time Dirac quantum walks (DQWs) on triangular and honeycomb lattices. At the continuous limit, these DQWs coincide with the Dirac equation. Their differences in the discrete regime are…
Non-abelian gauge theories underlie our understanding of fundamental forces in nature, and developing tailored quantum hardware and algorithms to simulate them is an outstanding challenge in the rapidly evolving field of quantum simulation.…
Compilation optimizes quantum algorithms performances on real-world quantum computers. To date, it is performed via classical optimization strategies. We introduce a class of quantum algorithms to perform compilation via quantum computers,…
Quantum networks are complex systems formed by the interaction among quantum processors through quantum channels. Analogous to classical computer networks, quantum networks allow for the distribution of quantum computation among quantum…
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…
The rotation of subspaces by a chosen angle is a fundamental quantum computing operation, with applications in error correction and quantum algorithms such as the Quantum Approximate Optimization Algorithm, the Variational Quantum…
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…
For the ever-growing field of quantum information processing, large-scale, efficient multi-port interferometers serving as photonic processors are required. In this context, the suitability of quantum walks as the interferometric base for…
Quantum magic, which accounts for the non-stabilizer content of a state, is essential for universal quantum computation beyond classically simulable resources. We investigate the generation and evolution of quantum magic in discrete-time…
The discrete-time quantum walk (QW) has been extensively and intensively investigated for the last decade, whose coin operator is defined by a unitary matrix. We extend the QW to a walk determined by a unitary matrix whose component is…
We utilize the theory of local amplitude transfers (LAT) to gain insights into quantum walks (QWs) and quantum annealing (QA) beyond the adiabatic theorem. By representing the eigenspace of the problem Hamiltonian as a hypercube graph, we…
We provide an algorithm that factorizes one-dimensional quantum walks into a protocol of two basic operations: A fixed conditional shift that transports particles between cells and suitable coin operators that act locally in each cell. This…
Quantum computing has garnered attention for its potential to solve complex computational problems with considerable speedup. Despite notable advancements in the field, achieving meaningful scalability and noise control in quantum hardware…
Quantum computers have been proposed as a solution for efficiently solving non-linear differential equations (DEs), a fundamental task across diverse technological and scientific domains. However, a crucial milestone in this regard is to…
A general approach to obtain reduced models for a wide class of discrete-time quantum systems is proposed. The obtained models not only reproduce exactly the output of a given quantum model, but are also guaranteed to satisfy physical…
Quantum random walks are shown to have non-intuitive dynamics, which makes them an attractive area of study for devising quantum algorithms for well-known classical problems as well as those arising in the field of quantum computing. In…
Quantum walks, the quantum analogue of the classical random walk, have been shown to underpin quantum algorithms for fluid dynamics. We propose the quantum half-adder gate method for quantum walks as a good benchmark algorithm, specifically…
We propose a novel heuristic quantum algorithm for the Minimum Vertex Cover (MVC) problem based on continuous-time quantum walks (CTQWs). In this framework, the coherent propagation of a quantum walker over a graph encodes its structural…