Related papers: Efficient and scalable quantum walk algorithms via…
Quantum magnetometry uses quantum resources to measure magnetic fields with precision and accuracy that cannot be achieved by its classical counterparts. In this paper, we propose a scheme for quantum magnetometry using discrete-time…
Computational advantages gained by quantum algorithms rely largely on the coherence of quantum devices and are generally compromised by decoherence. As an exception, we present a quantum algorithm for graph isomorphism testing whose…
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…
We present a novel Adaptive Distribution Generator that leverages a quantum walks-based approach to generate high precision and efficiency of target probability distributions. Our method integrates variational quantum circuits with…
Quantum walks are referred to as quantum analogs to random walks in mathematics. They have been studied as quantum algorithms in quantum information for quantum computers. There are two types of quantum walks. One is the discrete-time…
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…
The efficient resolution of optimization problems is one of the key issues in today's industry. This task relies mainly on classical algorithms that present scalability problems and processing limitations. Quantum computing has emerged to…
Quantum walks are an analog of classical random walks in quantum systems. Quantum walks have smaller hitting times compared to classical random walks on certain types of graphs, leading to a quantum advantage of quantum-walks-based…
In this paper, an algorithm for Quantum Inverse Fast Fourier Transform (QIFFT) is developed to work for quantum data. Analogous to a classical discrete signal, a quantum signal can be represented in Dirac notation, application of QIFFT is a…
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…
With the race to build large-scale quantum computers and efforts to exploit quantum algorithms for efficient problem solving in science and engineering disciplines, the requirement to have efficient and scalable verification methods are of…
The quantum walk formalism is a widely used and highly successful framework for modeling quantum systems, such as simulations of the Dirac equation, different dynamics in both the low and high energy regime, and for developing a wide range…
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…
It is well-known that any quantum gate can be decomposed into the universal gate set {T, H, CNOT}, and recent results have shown that each of these gates can be implemented using a dynamic quantum walk, which is a continuous-time quantum…
We propose a Continuous-Time Quantum Walks (CTQW) model for one-dimensional Dirac dynamics simulation with higher-order approximation. Our model bridges CTQW with a discrete-time model called Dirac Cellular Automata (DCA) via Quantum…
The coherent superposition of position states in a quantum walk (QW) can be precisely engineered towards the desired distributions to meet the need of quantum information applications. The coherent distribution can make full use of quantum…
We present four quantum algorithms for solving a multidimensional drift-diffusion equation. They rely on a quantum linear system solver, a quantum Hamiltonian simulation, a quantum random walk, and the quantum Fourier transform. We compare…
In discrete-time quantum walk (DTQW) the walker's coin space entangles with the position space after the very first step of the evolution. This phenomenon may be exploited to obtain the value of the coin parameter $\theta$ by performing…
The evolution of a walker in standard "Discrete-time Quantum Walk (DTQW)" is determined by coin and shift unitary operators. The conditional shift operator shifts the position of the walker to right or left by unit step size while the…
Program implementation and simulation are essential for research in the field of quantum algorithms. However, complex and large-scale quantum algorithms can pose challenges for existing quantum programming languages and simulators. Here, we…