Related papers: Efficiency of quantum and classical transport on g…
It is shown that a good estimate of the fidelity of an experimentally realized quantum process can be obtained by measuring the outputs for only two complementary sets of input states. The number of measurements required to test a quantum…
Large scale numerical experiments are commonplace today in theoretical physics. The high performance algorithms described herein are the most compact, efficient methods known for representing and analyzing systems modeled well by sets or…
In this work, we study the performance of classical and quantum magnetic Otto cycles with a working substance composed of a single graphene quantum dot modeled by the continuum approach with the use of the zigzag boundary condition.…
In this paper, we study the quantum walk on the 2D Penrose Lattice, which is intermediate between periodic and disordered structure. Quantum walk on Penrose Lattice is less efficient in transport comparing to the regular lattices. By…
We present a static framework for analysing quantum routing protocols that we call the \textit{cost-vector formalism}. Here, quantum networks are recast as multi-graphs where edges represent two-qubit entanglement resources that…
Quantum walks, being the quantum analogue of classical random walks, are expected to provide a fruitful source of quantum algorithms. A few such algorithms have already been developed, including the `glued trees' algorithm, which provides…
This paper is a brief review of classical and quantum transport phenomena, as well as related spectral properties, exhibited by one-dimensional periodically kicked systems. Two representative and fundamentally different classes of systems…
The low frequency quantum transport properties of a three-probe mesoscopic conductor are studied using B\"uttiker's AC transport formalism. The static transmission coefficients and emittance matrix of the system were computed by explicitly…
Quantum walks, both discrete and continuous, serve as fundamental tools in quantum information processing with diverse applications. This work introduces a hybrid quantum walk model that integrates the coin mechanism of discrete walks with…
In static classical statistical systems the problem of information transport from a boundary to the bulk finds a simple description in terms of wave functions or density matrices. While the transfer matrix formalism is a type of Heisenberg…
We determine the characteristic of dissipative quantum transport in a coupled qubit network in the presence of on-site and off-diagonal external driving. The work is motivated by the dephasing-assisted quantum transport where noise is…
We propose a protocol optimization technique that is applicable to both weighted or unweighted graphs. Our aim is to explore by how much a small variation around the Shortest Path or Optimal Path protocols can enhance protocol performance.…
[...] In this thesis, we are interested in generalizing factor graphs and the relevant methods toward describing quantum systems. Two generalizations of classical graphical models are investigated, namely double-edge factor graphs (DeFGs)…
We consider a quantum walk with two marked vertices, sender and receiver, and analyze its application to perfect state transfer on complete bipartite graphs. First, the situation with both the sender and the receiver vertex in the same part…
The power of quantum computers is still somewhat speculative. While they are certainly faster than classical ones at some tasks, the class of problems they can efficiently solve has not been mapped definitively onto known classical…
Highly efficient transfer of quantum resources including quantum excitations, states, and information on quantum networks is an important task in quantum information science. Here, we propose a bipartite-graph framework for studying quantum…
In this paper, we analyze the potential for new types of searches using the formalism of scattering random walks on Quantum Computers. Given a particular type of graph consisting of nodes and connections, a "Tree Maze", we would like to…
Recently, several works have analysed the efficiency of photosynthetic complexes in a transient scenario and how that efficiency is affected by environmental noise. Here, following a quantum master equation approach, we study the energy and…
In this paper, we numerically study quantum walks on two kinds of two-dimensional graphs: cylindrical strip and Mobius strip. The two kinds of graphs are typical two-dimensional topological graph. We study the crossing property of quantum…
The graph isomorphism problem is theoretically interesting and also has many practical applications. The best known classical algorithms for graph isomorphism all run in time super-polynomial in the size of the graph in the worst case. An…