Related papers: Efficient implementation of discrete-time quantum …
As the field of quantum computing grows, novel algorithms which take advantage of quantum phenomena need to be developed. As we are currently in the NISQ (noisy intermediate scale quantum) era, quantum algorithm researchers cannot reliably…
The development of a universal fault-tolerant quantum computer that can solve efficiently various difficult computational problems is an outstanding challenge for science and technology. In this work, we propose a technique for an efficient…
Quantum random walks (QRWs) can be used to perform both quantum simulations and quantum algorithms. In order to exploit this potential, quantum walks on different types of graphs must be physically implemented. To this end we design, model…
Quantum noise in real-world devices poses a significant challenge in achieving practical quantum advantage, since accurately compiled and executed circuits are typically deep and highly susceptible to decoherence. To facilitate the…
The universal quantum computation model based on quantum walk by Childs has opened the door for a new way of studying the limitations and advantages of quantum computation, as well as for its intermediate-term simulation. In recent years,…
Continuous-time quantum walks (CTQW) have shown the capability to perform efficiently the spatial search of a marked site on many kinds of graphs. However, most of such graphs are hard to realize in an experimental setting. Here we study…
Classical simulators play a major role in the development and benchmark of quantum algorithms and practically any software framework for quantum computation provides the option of running the algorithms on simulators. However, the…
Quantum walks play an important role for developing quantum algorithms and quantum simulations. Here we present one dimensional three-state quantum walk(lazy quantum walk) and show its equivalence for circuit realization in ternary quantum…
Simulating real-time dynamics of gauge theories represents a paradigmatic use case to test the hardware capabilities of a quantum computer, since it can involve non-trivial input states preparation, discretized time evolution, long-distance…
Advances in recent years have made it possible to explore quantum dots as a viable technology for scalable quantum information processing. Charge qubits for example can be realized in the lowest bound states of coupled quantum dots and the…
Quantum gates are the building blocks of quantum circuits, which in turn are the cornerstones of quantum information processing. In this work, we theoretically investigate a single-step implementation of both a universal two- (CNOT) and…
Understanding the intricate quantum spin dynamics of radical pair reactions is crucial for unraveling the underlying nature of chemical processes across diverse scientific domains. In this work, we leverage Trotterization to map coherent…
Quantum state engineering, namely the generation and control of arbitrary quantum states, is drawing more and more attention due to its wide applications in quantum information and computation. However, there is no general method in theory,…
Solving partial differential equations for extremely large-scale systems within a feasible computation time serves in accelerating engineering developments. Quantum computing algorithms, particularly the Hamiltonian simulations, present a…
In this paper, we consider continuous-time quantum walks (CTQWs) on one-dimension ring lattice of N nodes in which every node is connected to its 2m nearest neighbors (m on either side). In the framework of the Bloch function ansatz, we…
Due to the scarcity of quantum computing resources, researchers and developers have very limited access to real quantum computers. Therefore, judicious planning and utilization of quantum computer runtime are essential to ensure smooth…
One way to approximate a quantum annealing schedule is to use multiple quantum walks chained together, without intermediate measurements, to produce a multi-stage quantum walk (MSQW). Previous work has shown that a MSQW is better than QAOA…
Quantum computing has the potential to solve complex problems faster and more efficiently than classical computing. It can achieve speedups by leveraging quantum phenomena like superposition, entanglement, and tunneling. Quantum walks (QWs)…
Quantum walks, being the quantum analogue of classical random walks, are expected to provide a fruitful source of quantum algorithms. A few such algorithms have already been developed, including the `glued trees' algorithm, which provides…
We introduce a fidelity-based measure $\text{D}_{\text{CQ}}(t)$ to quantify the differences between the dynamics of classical (CW) and quantum (QW) walks over a graph. We provide universal, graph-independent, analytic expressions of this…