This is a textbook about quantum walks and quantum search algorithms. The readers will
take advantage of the pedagogical aspects and learn the topics faster and make less effort …

Trotterization-based, iterative approaches to quantum simulation (QS) are restricted to
simulation times less than the coherence time of the quantum computer (QC), which limits …

The classical random walk formalism plays an important role in a wide range of applications.
Its quantum counterpart, the quantum walk, is proposed as an important theoretical model …

We propose a novel algorithm for quantum spatial search on a star graph using interleaved
continuous-time quantum walks and marking oracle queries. Initializing the system in the …

Dynamical quantum simulation may be one of the first applications to see quantum
advantage. However, the circuit depth of standard Trotterization methods can rapidly exceed …

This paper proposes a highly efficient quantum algorithm for portfolio optimisation targeted
at near-term noisy intermediate-scale quantum computers. Recent work by Hodson et …

Protein–protein interaction (PPI) networks consist of the physical and/or functional
interactions between the proteins of an organism, and they form the basis for the field of …

Solving optimisation problems is a promising near-term application of quantum computers.
Quantum variational algorithms (QVAs) leverage quantum superposition and entanglement …

Quantum walks have proven to be a universal model for quantum computation and to
provide speed-up in certain quantum algorithms. The discrete-time quantum walk (DTQW) …

This paper examines the performance of spatial search where the Grover diffusion operator
is replaced by continuous-time quantum walks on a class of interdependent networks. We …