Wave communication across regular lattices

A quantum graph approach to metamaterial design

Since the turn of the century, metamaterials have gained a large amount of attention due to their potential for possessing highly nontrivial and exotic properties—such as cloaking or perfect lensing. There has been a great push to create reliable mathematical models that accurately describe the required material composition. Here, we consider a quantum graph approach to metamaterial design. An infinite square periodic quantum graph, constructed from vertices and edges, acts as a paradigm for a 2D metamaterial. Wave transport occurs along the edges with vertices acting as scatterers modelling sub-wavelength resonant elements. These resonant elements are constructed with the help of finite quantum graphs attached to each vertex of the lattice with customisable properties controlled by a unitary scattering matrix. The metamaterial properties are understood and engineered by manipulating the band diagram of the periodic structure. The engineered properties are then demonstrated in terms of the reflection and transmission behaviour of Gaussian beam solutions at an interface between two different metamaterials. We extend this treatment to N layered metamaterials using the Transfer Matrix Method. We demonstrate both positive and negative refraction and beam steering. Our proposed quantum graph modelling technique is very flexible and can be easily adjusted making it an ideal design tool for creating metamaterials with exotic band diagram properties or testing promising multi-layer set ups and wave steering effects.

Optimal Quantum Spatial Search on Random Temporal Networks

To investigate the performance of quantum information tasks on networks whose topology changes in time, we study the spatial search algorithm by continuous time quantum walk to find a marked node on a random temporal network. We consider a network of n nodes constituted by a time-ordered sequence of Erdös-Rényi random graphs G(n,p), where p is the probability that any two given nodes are connected: After every time interval τ, a new graph G(n,p) replaces the previous one. We prove analytically that, for any given p, there is always a range of values of τ for which the running time of the algorithm is optimal, i.e., O(sqrt[n]), even when search on the individual static graphs constituting the temporal network is suboptimal. On the other hand, there are regimes of τ where the algorithm is suboptimal even when each of the underlying static graphs are sufficiently connected to perform optimal search on them. From this first study of quantum spatial search on a time-dependent network, it emerges that the nontrivial interplay between temporality and connectivity is key to the algorithmic performance. Moreover, our work can be extended to establish high-fidelity qubit transfer between any two nodes of the network. Overall, our findings show that one can exploit temporality to achieve optimal quantum information tasks on dynamical random networks.

Statistical theory of designed quantum transport across disordered networks

We explain how centrosymmetry, together with a dominant doublet of energy eigenstates in the local density of states, can guarantee interference-assisted, strongly enhanced, strictly coherent quantum excitation transport between two predefined sites of a random network of two-level systems. Starting from a generalization of the chaos-assisted tunnelling mechanism, we formulate a random matrix theoretical framework for the analytical prediction of the transfer time distribution, of lower bounds of the transfer efficiency, and of the scaling behavior of characteristic statistical properties with the size of the network. We show that these analytical predictions compare well to numerical simulations, using Hamiltonians sampled from the Gaussian orthogonal ensemble.

Microwave experiments simulating quantum search and directed transport in artificial graphene

A series of quantum search algorithms have been proposed recently providing an algebraic speedup compared to classical search algorithms from N to √N, where N is the number of items in the search space. In particular, devising searches on regular lattices has become popular in extending Grover's original algorithm to spatial searching. Working in a tight-binding setup, it could be demonstrated, theoretically, that a search is possible in the physically relevant dimensions 2 and 3 if the lattice spectrum possesses Dirac points. We present here a proof of principle experiment implementing wave search algorithms and directed wave transport in a graphene lattice arrangement. The idea is based on bringing localized search states into resonance with an extended lattice state in an energy region of low spectral density-namely, at or near the Dirac point. The experiment is implemented using classical waves in a microwave setup containing weakly coupled dielectric resonators placed in a honeycomb arrangement, i.e., artificial graphene. Furthermore, we investigate the scaling behavior experimentally using linear chains.

Quantum search on graphene lattices

We present a continuous-time quantum search algorithm on a graphene lattice. This provides the sought-after implementation of an efficient continuous-time quantum search on a two-dimensional lattice. The search uses the linearity of the dispersion relation near the Dirac point and can find a marked site on a graphene lattice faster than the corresponding classical search. The algorithm can also be used for state transfer and communication.