Related papers: Persistent Quantum Memory in Iterated Lifts
Global control offers a promising route to scalable quantum computing. A recent conjecture by Hu et al. (arXiv:2508.19075) proposes that any connected qubit graph equipped with global Ising-type interactions and tunable global transverse…
We present a novel application of the HHL (Harrow-Hassidim-Lloyd) algorithm -- a quantum algorithm solving systems of linear equations -- in solving an open problem about quantum random walks, namely computing hitting (or absorption)…
In this work, we generalize the recently-introduced graph composition framework to the non-boolean setting. A quantum algorithm in this framework is represented by a hypergraph, where each hyperedge is adjacent to multiple vertices. The…
The Scattering Quantum Random Walk scheme has found success as a basis for search algorithms on highly symmetric graph structures. In this paper we examine its effectiveness at locating a specially marked vertex on square grid graphs,…
I review the decoherent (or consistent) histories approach to quantum mechanics, due to Griffiths, to Gell-Mann and Hartle, and to Omnes. This is an approach to standard quantum theory specifically designed to apply to genuinely closed…
In this paper we study continuous-time quantum walks on Cayley graphs of the symmetric group, and prove various facts concerning such walks that demonstrate significant differences from their classical analogues. In particular, we show that…
We study perfect state transfer in Grover walks on two important classes of graphs: strongly regular graphs and strongly walk-regular graphs. The latter class is a generalization of the former. We first give a complete classification of…
Recent developments in quantum gravity have shown the Lorentzian treatment to be a fruitful approach towards the emergence of macroscopic spacetimes. In this paper, we discuss another related aspect of the Lorentzian treatment: we argue…
Persistence diagrams (PDs), often characterized as sets of death and birth of homology class, have been known for providing a topological representation of a graph structure, which is often useful in machine learning tasks. Prior works rely…
In quantum computation theory, quantum random walks have been utilized by many quantum search algorithms which provide improved performance over their classical counterparts. However, due to the importance of the quantum decoherence…
In this paper, we explore quantum interference in molecular conductance from the point of view of graph theory and walks on lattices. By virtue of the Cayley-Hamilton theorem for characteristic polynomials and the Coulson-Rushbrooke pairing…
A quantum particle evolving by Schr\"odinger's equation in discrete space constitutes a continuous-time quantum walk on a graph of vertices and edges. When a vertex is marked by an oracle, the quantum walk effects a quantum search…
In the forthcoming years the LHC experiments are going to be upgraded to benefit from the substantial increase of the LHC instantaneous luminosity, which will lead to larger, denser events, and, consequently, greater complexity in…
This work investigates how shallow, NISQ-compatible quantum layers can improve temporal representation learning in real-world sequential data. We develop a QLSTM Seq2Seq autoencoder in which a depth-1 variational quantum circuit is embedded…
A $k$-lift of an $n$-vertex base graph $G$ is a graph $H$ on $n\times k$ vertices, where each vertex $v$ of $G$ is replaced by $k$ vertices $v_1,\cdots{},v_k$ and each edge $(u,v)$ in $G$ is replaced by a matching representing a bijection…
Motivated by the immense success of random walk and Markov chain methods in the design of classical algorithms, we consider_quantum_ walks on graphs. We analyse in detail the behaviour of unbiased quantum walk on the line, with the example…
For quantum search via the continuous-time quantum walk, the evolution of the whole system is usually limited in a small subspace. In this paper, we discuss how the symmetries of the graphs are related to the existence of such an invariant…
We study numerically the behavior of continuous-time quantum walks over networks which are topologically equivalent to square lattices. On short time scales, when placing the initial excitation at a corner of the network, we observe a fast,…
We introduce an analytically treatable spin decoherence model for quantum walk on a line that yields the exact position probability distribution of an unbiased classical random walk at all-time scales. This spin decoherence model depicts a…
Quantum walk is a potent technique for building quantum algorithms. This paper examines the quantum walk search algorithm on complete multipartite graphs with multiple marked vertices, which has not been explored before. Two specific cases…