Related papers: Quantifying State Transfer Strength on Graphs with…
A transport methodology to study the electron transport between quantum dots arrays based in Transfer Hamiltonian approach is presented. The interactions between the quantum dots and between the quantum dots and the electrodes are…
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…
We study quantum transport on finite discrete structures and we model the process by means of continuous-time quantum walks. A direct and effective comparison between quantum and classical walks can be attained based on the average…
In this paper we study quantum state transfer (also called quantum tunneling) on graphs when there is a potential function on the vertex set. We present two main results. First, we show that for paths of length greater than three, there is…
Given a fixed initial state, a desired Hamiltonian, and an amount of time, we provide a complete characterization of the set of Hamiltonians which perform the same action as the desired Hamiltonian on the state of interest. An example is…
Geometric properties of evolutionary graph states of spin systems generated by the operator of evolution with Ising Hamiltonian are examined, using their relationship with fluctuations of energy. We find that the geometric characteristics…
Graph states are a unique resource for quantum information processing, such as measurement-based quantum computation. Here, we theoretically investigate using continuous-variable graph states for single-parameter quantum metrology,…
The random walk formalism is used across a wide range of applications, from modelling share prices to predicting population genetics. Likewise quantum walks have shown much potential as a frame- work for developing new quantum algorithms.…
We characterize a close connection between the continuous-time quantum-walk model and a discrete-time quantum-walk version, based on the staggered model with Hamiltonians in a class of Cayley graphs, which can be considered as a…
Perfect state transfer (PST) has great significance due to its applications in quantum information processing and quantum computation. In this paper we present a characterization on connected simple Cayley graph $\Gamma={\rm Cay}(G,S)$…
We consider a system of qubits coupled via nearest-neighbour interaction governed by the Heisenberg Hamiltonian. We further suppose that all coupling constants are equal to $1$. We are interested in determining which graphs allow for a…
We introduce a model of a quantum walk on a graph in which a particle jumps between neighboring nodes and interacts with independent spins sitting on the edges. Entanglement propagates with the walker. We apply this model to the case of a…
Quantum computing employs controllable interactions to perform sequences of logical gates and entire algorithms on quantum registers. This paradigm has been widely explored, e.g., for simulating dynamics of manybody systems by decomposing…
We construct families of graphs from linear groups $\mathrm{SL}(2,q)$, $\mathrm{GL}(2,q)$ and $\mathrm{GU}(2,q^2)$, where $q$ is an odd prime power, with the property that the continuous-time quantum walks on the associated networks of…
A fundamental problem in Quantum Information Processing is the discrimination amongst a set of quantum states of a system. In this paper, we address this problem on an open quantum system described by a graph, whose evolution is defined by…
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…
In this paper we show how using complex valued edge weights in a graph can completely suppress the flow of probability amplitude in a continuous time quantum walk to specific vertices of the graph when the edge weights, graph topology and…
Ionicioiu and Spiller [Phys. Rev. A 85, 062313 (2012)] have recently presented an axiomatic framework for mapping graphs to quantum states of a suitable physical system. Based on their study, we first extend the axiomatic framework to…
Quantum computation using continuous-time evolution under a natural hardware Hamiltonian is a promising near- and mid-term direction toward powerful quantum computing hardware. We investigate the performance of continuous-time quantum walks…
Perfect state transfer between qubits on a uniformly coupled network, with interactions specified by a graph, has advantages over an engineered chain, such as much faster transfer times (independent of the distance between the input and…