Complex Quantum Networks
Networks are any systems amenable to being partitioned into pairwise related subsystems; in some cases it is quite natural to use a network representation, while in others it may lead to a compact presentation that helps identifying the key features of an otherwise complicated system. Complex networks combine features from both lattices, such as having a high number of triangles, and from random networks, such as having high navigability.
In some cases, in particular with quantum networks, complexity can also simply refer to networks that are not lattices. A network is said to be quantum when it requires a quantum description, for example when it represents an entangled state of a set of qubits or the interaction pattern of a set of quantum systems. Yet another example is a network of quantum channels.
My research has so far focused on the following two avenues:
I considered quantum information processing tasks on graphs by means of quantum walks. More specifically, I have considered quantum spatial search by continuous-time quantum walks and investigated how the presence of noise affects the optimality of the search. I am collaborating with the Multimode Quantum Optics group of the Sorbonne Université (Paris) for experimental implementations.
I use tools from complex network theory to analyze properties of many-body quantum systems, such as studying networks of bipartite correlations (e.g. entanglement).
Some relevant publications
- Continuous-time quantum walks on dynamical percolation graphs. EPL 124 60001, 2019.
- Quantum spatial search on graphs subject to dynamical noise. Phys. Rev. A, 2018.
- Emergent entanglement structures and self-similarity in quantum spin chains. arXiv:2007.06989, 2020.