相关论文: Continuous-time quantum walk-based ans\"atze on ne…

Continuous-time quantum walks provide a natural framework to tackle the fundamental problem of finding a node among a set of marked nodes in a graph, known as spatial search. Whether spatial search by continuous-time quantum walk provides a…

Quantum walks are at the heart of modern quantum technologies. They allow to deal with quantum transport phenomena and are an advanced tool for constructing novel quantum algorithms. Quantum walks on graphs are fundamentally different from…

Quantum walks are powerful tools not only to construct the quantum speedup algorithms but also to describe specific models in physical processes. Furthermore, the discrete time quantum walk has been experimentally realized in various…

The hardware requirements of useful quantum algorithms remain unmet by the quantum computers available today. Because it was designed to soften these requirements, the Variational Quantum Eigensolver (VQE) has gained popularity as a…

A central component of variational quantum algorithms (VQA) is the state-preparation circuit, also known as ansatz or variational form. This circuit is most commonly designed to respect the symmetries of the problem Hamiltonian and, in this…

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,…

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…

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…

Recent experimental achievements have demonstrated the potential of neutral atom architectures for fault-tolerant quantum computing. These architectures feature the dynamic rearrangement of atoms during computation, enabling nearly…

We introduce a new tool for quantum algorithms called quantum fast-forwarding (QFF). The tool uses quantum walks as a means to quadratically fast-forward a reversible Markov chain. More specifically, with $P$ the Markov chain transition…

We consider discrete-time nearest-neighbor quantum walks on random environments in one dimension. Using the method based on a path counting, we present both quenched and annealed weak limit theorems for the quantum walk.

We study the first detected recurrence time problem of continuous-time quantum walks on graphs. While previous works have employed projective measurements to determine the first return time, we implement a protocol based on weak…

We construct an oracular (i.e., black box) problem that can be solved exponentially faster on a quantum computer than on a classical computer. The quantum algorithm is based on a continuous time quantum walk, and thus employs a different…

The quantum walk is a dynamical protocol which describes the motion of spinful particles on a lattice. Also, it has been demonstrated to be a powerful platform to explore topological quantum matter. Recently, the quantum walk in coherent…

The LHZ parity embedding is one of the front-running methods for implementing difficult-to-engineer long-range interactions in quantum optimisation problems. Continuous-time quantum walks are a leading approach for solving quantum…

The development and spread of entanglement in complex quantum systems is central to exploring many-body phenomena out of equilibrium. Measuring entanglement dynamics can shed light on information scrambling and thermalisation, namely on…

Quantum simulation has emerged as a valuable arena for demonstrating and understanding the capabilities of near-term quantum computers. Quantum annealing has been used successfully in simulating a range of open quantum systems, both at…

Quantum walks are expected to serve important modelling and algorithmic applications in many areas of science and mathematics. Although quantum walks have been successfully implemented physically in recent times, no major efforts have been…

Quantum walks are the quantum mechanical analogue of classical random walks and an extremely powerful tool in quantum simulations, quantum search algorithms, and even for universal quantum computing. In our work, we have designed and…

We present a theoretical framework for the analysis of amplitude transfer in Quantum Variational Algorithms (QVAs) for combinatorial optimisation with mixing unitaries defined by vertex-transitive graphs, based on their continuous-time…