arXiv subjects

K. S. Raghunathan

Publications and source records attributed to K. S. Raghunathan.

4 recordsLinked to original sources

arXiv2012

Search on a Fractal Lattice using a Quantum Random Walk

The spatial search problem on regular lattice structures in integer number of dimensions $d\geq2$ has been studied extensively, using both coined and coinless quantum walks. The relativistic Dirac operator has been a crucial ingredient in these studies. Here we investigate the spatial search problem on fractals of non-integer dimensions. Although the Dirac operator cannot be defined on a fractal, we construct the quantum walk on a fractal using the flip-flop operator that incorporates a Klein-Gordon mode. We find that the scaling behavior of the spatial search is determined by the spectral (and not the fractal) dimension. Our numerical results have been obtained on the well-known Sierpinski gaskets in two and three dimensions.

quant-ph↗

arXiv2010

Search on a Hypercubic Lattice through a Quantum Random Walk: II. d=2

We investigate the spatial search problem on the two-dimensional square lattice, using the Dirac evolution operator discretised according to the staggered lattice fermion formalism. $d=2$ is the critical dimension for the spatial search problem, where infrared divergence of the evolution operator leads to logarithmic factors in the scaling behaviour. As a result, the construction used in our accompanying article \cite{dgt2search} provides an $O(\sqrt{N}\log N)$ algorithm, which is not optimal. The scaling behaviour can be improved to $O(\sqrt{N\log N})$ by cleverly controlling the massless Dirac evolution operator by an ancilla qubit, as proposed by Tulsi \cite{tulsi}. We reinterpret the ancilla control as introduction of an effective mass at the marked vertex, and optimise the proportionality constants of the scaling behaviour of the algorithm by numerically tuning the parameters.

quant-ph↗

arXiv2005

Quantum Random Walks without a Coin Toss

We construct a quantum random walk algorithm, based on the Dirac operator instead of the Laplacian. The algorithm explores multiple evolutionary branches by superposition of states, and does not require the coin toss instruction of classical randomised algorithms. We use this algorithm to search for a marked vertex on a hypercubic lattice in arbitrary dimensions. Our numerical and analytical results match the scaling behaviour of earlier algorithms that use a coin toss instruction.

quant-ph↗

arXiv2005

Quantum Random Walks do not need a Coin Toss

Classical randomized algorithms use a coin toss instruction to explore different evolutionary branches of a problem. Quantum algorithms, on the other hand, can explore multiple evolutionary branches by mere superposition of states. Discrete quantum random walks, studied in the literature, have nonetheless used both superposition and a quantum coin toss instruction. This is not necessary, and a discrete quantum random walk without a quantum coin toss instruction is defined and analyzed here. Our construction eliminates quantum entanglement from the algorithm, and the results match those obtained with a quantum coin toss instruction.

quant-ph↗