Related papers: Efficiency of quantum and classical transport on g…
We show a similarity between two different classical simulation methods for measurement based quantum computation -- one relying on a low entanglement (tree tensor network) representation of the computer's state, and the other a tensor…
A prominent model for transportation networks is branched transport, which seeks the optimal transportation scheme to move material from a given initial to a final distribution. The cost of the scheme encodes a higher transport efficiency…
We use quantum graphs as a model to study various mathematical aspects of the vacuum energy, such as convergence of periodic path expansions, consistency among different methods (trace formulae versus method of images) and the possible…
Classical shadows constitute a protocol to estimate the expectation values of a collection of M observables acting on O(1) qubits of an unknown n-qubit state with a number of measurements that is independent of n and that grows only…
Transport phenomena at the nanoscale are of interest due to the presence of both quantum and classical behavior. In this work, we demonstrate that quantum transport efficiency can be enhanced by a dynamical interplay of the system…
The transfer of information between two physical locations is an essential component of both classical and quantum computing. In quantum computing the transfer of information must be coherent to preserve quantum states and hence the quantum…
Deterministic equilibrium flows in transport networks can be investigated by means of Markov's processes defined on the dual graph representations of the network. Sustained movement patterns are generated by a subset of automorphisms of the…
Classical representations of quantum states and operations as vectors and matrices are plagued by an exponential growth in memory and runtime requirements for increasing system sizes. Based on their use in classical computing, an…
This paper investigates continuous-time quantum walks on directed bipartite graphs based on a graph's adjacency matrix. We prove that on bipartite graphs, probability transport between the two node partitions can be completely suppressed by…
Hitting the exit node from the entrance node faster on a graph is one of the properties that quantum walk algorithms can take advantage of to outperform classical random walk algorithms. Especially, continuous-time quantum walks on…
We study the existence of quantum state transfer on non-integral circulant graphs. We find that continuous time quantum walks on quantum networks based on certain circulant graphs with $2^k$ $\left(k\in\mathbb{Z}\right)$ vertices exhibit…
Optimal transportation provides a means of lifting distances between points on a geometric domain to distances between signals over the domain, expressed as probability distributions. On a graph, transportation problems can be used to…
Quantum computing promises to improve the information processing power to levels unreachable by classical computation. Quantum walks are heading the development of quantum algorithms for searching information on graphs more efficiently than…
We compare the properties of transmission across one-dimensional finite samples which are associated with two types of "quantum diffusion", one related to a classical chaotic dynamics, the other to a multifractal energy spectrum. We…
The general problem of performance advantage obtainable by the use of nonclassical transmitted states over classical ones is considered. Attention is focused on the situation where system loss is significant and additive Gaussian noise may…
We develop a new general algorithm for finding a regular tight-binding lattice Hamiltonian in infinite dimensions for an arbitrary given shape of the density of states (DOS). The availability of such an algorithm is essential for the…
We contrast two sets of conditions that govern the transition in which classical dynamics emerges from the evolution of a quantum system. The first was derived by considering the trajectories seen by an observer (dubbed the ``strong''…
Current advancements in communication equipment demand the investigation of classical information transfer over quantum channels, by encompassing realistic scenarios in finite dimensions. To address this issue, we develop a framework for…
We consider the question of how to distinguish quantum from classical transport through nanostructures. To address this issue we have derived two inequalities for temporal correlations in nonequilibrium transport in nanostructures weakly…
The effective classical/quantum dynamics of a particle constrained on a closed line embedded in a higher dimensional configuration space is analyzed. By considering explicit examples it is shown how different reduction mechanisms produce…