Related papers: Perfect state transfer using Markovian quantum wal…
The join $X\vee Y$ of two graphs $X$ and $Y$ is the graph obtained by joining each vertex of $X$ to each vertex of $Y$. We explore the behaviour of a continuous quantum walk on a weighted join graph having the adjacency matrix or Laplacian…
In order to obtain perfect state transfer between two sites in a network of interacting qubits, their corresponding vertices in the underlying graph must satisfy a combinatorial property called strong cospectrality. Here we determine the…
Quantum walks play an important role in the area of quantum algorithms. Many interesting problems can be reduced to searching marked states in a quantum Markov chain. In this context, the notion of quantum hitting time is very important,…
This dissertation unifies one of the central methods of classical rate calculation, `Transition-State Theory' (TST), with quantum mechanics, thereby deriving a rigorous `Quantum Transition-State Theory' (QTST). The resulting QTST is…
A method for high-fidelity quantum state transfer in a quantum network coupled to a continuum, based on time reversal in the continuum after decay, is theoretically suggested. Provided that the energy spectrum of the network is symmetric…
Chains of transmon qubits are considered promising systems to implement different quantum information tasks. In particular as channels that perform high-quality quantum state transfer. We study how changing the interaction strength between…
We have developed a steady state theory of complex transport networks used to model the flow of commodity, information, viruses, opinions, or traffic. Our approach is based on the use of the Markov chains defined on the graph…
Quantum walks on graphs are fundamental to quantum computing and have led to many interesting open problems in algebraic graph theory. This review article highlights three key classes of open problems in this domain; perfect state transfer,…
We study the possibility of performing perfect teleportation of unknown quantum states from multiple senders to a single receiver with a previously shared stabilizer state. In the model we considered, the utilized stabilizer state is…
Many classical randomized algorithms (e.g., approximation algorithms for #P-complete problems) utilize the following random walk algorithm for {\em almost uniform sampling} from a state space $S$ of cardinality $N$: run a symmetric ergodic…
Quantum walks are the quantum-mechanical analog of random walks, in which a quantum `walker' evolves between initial and final states by traversing the edges of a graph, either in discrete steps from node to node or via continuous evolution…
With continuing improvements on the quality of fabricated quantum devices, it becomes increasingly crucial to analyze noisy quantum process in greater details such as characterizing the non-Markovianity in a quantitative manner. In this…
Regular families of coupled quantum networks are described such the unknown state of a qubit can be perfectly routed from any node to any other node in a time linear in the distance. Unlike previous constructions, the transfer can be…
We completely characterize circulant graphs with valency up to $4$ that admit perfect state transfer. Those of valency $3$ do not admit it. On the other hand, circulant graphs with valency $4$ admit perfect state transfer only in two…
The \textit{transition matrix} of a graph $\Gamma$ with adjacency matrix $A$ is defined by $H(\tau ) := \exp(-\mathbf{i}\tau A)$, where $\tau \in \mathbb{R}$ and $\mathbf{i} = \sqrt{-1}$. The graph $\Gamma$ exhibits \textit{perfect state…
Quantum state tomography (QST) is a central task for quantum information processing, enabling quantum cryptography, computation, and state certification. Traditional QST relies on projective measurements of single- and two-qubit Pauli…
Continuous time quantum walks provide an important framework for designing new algorithms and modelling quantum transport and state transfer problems. Often, the graph representing the structure of a problem contains certain symmetries that…
Multiple quantum (MQ) NMR coherence spectra, which can be obtained experimentally in MQ NMR, can be transferred from the sender to the remote receiver without mixing the MQ-coherences of different orders and distortions. The only effect of…
I introduce a new type of continuous-time quantum walk on graphs called the quantum snake walk, the basis states of which are fixed-length paths (snakes) in the underlying graph. First I analyze the quantum snake walk on the line, and I…
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…