Les xarxes impregnen totes les estructures d’informació. Són la base de sistemes naturals, socials i artificials basats en la interacció de diversos agents, descrivint el flux d’informació entre ells. Les diferències en les característiques d’aquestes interaccions i la seva evolució en el temps donen lloc a diferents tipus d’estructures: xarxes regulars, completament aleatòries o, a mig camí entre aquests dos models, les xarxes complexes. La informació quàntica no n’és una excepció, i una de les tasques clau en aquestes xarxes és la transmissió d’informació quàntica entre dos nodes molt separats entre ells.
Tot plegat, una mica d’autopropaganda sobre aquest nou preprint: Limited path entanglement percolation in quantum complex networks, on estudiem l’avantatge que comporta l’estructura complexa d’una xarxa en la comunicació quàntica a través seu, com es pot modificar aquesta estructura per fer-la més útil quan disposem de menys entrellaçament entre nodes i com n’és d’important la seva propietat de món petit quan la presència de soroll ens fixa la distància màxima que pot recorre la informació abans de degradar-se. Aquest n’és l’abstract:
We study entanglement distribution in quantum complex networks where nodes are connected by bipartite entangled states. These networks are characterized by a complex structure, which dramatically affects how information is transmitted through them. For pure quantum state links, quantum networks exhibit a remarkable feature absent in classical networks: it is possible to effectively rewire the network by performing local operations on the nodes. We propose a family of such quantum operations that decrease the entanglement percolation threshold of the network and increase the size of the giant connected component. We provide analytic results for complex networks with arbitrary (uncorrelated) degree distribution. These results are in good agreement with numerical simulations, which also show enhancement in correlated and real world networks. The proposed quantum preprocessing strategies are not robust in the presence of noise. However, even when the links consist of (noisy) mixed state links, one can send quantum information through a connecting path with a fidelity that decreases with the path length. In this noisy scenario, complex networks offer a clear advantage over regular lattices, namely the fact that two arbitrary nodes can be connected through a relatively small number of steps, known as the small world effect. We calculate the probability that two arbitrary nodes in the network can successfully communicate with a fidelity above a given threshold. This amounts to working out the classical problem of percolation with limited path length. We find that this probability can be significant even for paths limited to few connections, and that the results for standard (unlimited) percolation are soon recovered if the path length exceeds by a finite amount the average path length, which in complex networks generally scales logarithmically with the size of the network.










