Bruno Coelho Coutinho

Bruno Coelho Coutinho

Auto-generated profile, based on publicly available information

Bruno Coelho Coutinho

Instituto de Telecomunicaes, Lisbon, Portugal

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
4 March 2013 in Physical Review E
Verified
Journal Article
Closed access
PDF file
BCB. C. Coutinho
B. C. Coutinho
AGAlexander Goltsev
Alexander Goltsev
SDSergey Dorogovtsev
Sergey Dorogovtsev
José Fernando F. MendesJosé Fernando F. Mendes
José Fernando F. Mendes
We study the Kuramoto model on complex networks, in which natural frequencies of phase oscillators and the vertex degrees are correlated. Using the annealed network approximation and numerical simulations, we explore a special case in which the natural frequencies of the oscillators and the vertex degrees are linearly coupled. We find that in uncorrelated scale-free networks with the degree distribution exponent 2<γ<3, the model undergoes a first-order phase transition, while the transition becomes second order at γ>3. If γ=3, the phase synchronization emerges as a result of a hybrid phase transition that combines an abrupt emergence of synchronization, as in first-order phase transitions, and a critical singularity, as in second-order phase transitions. The critical fluctuations manifest themselves as avalanches in the synchronization process. Comparing our analytical calculations with numerical simulations for Erdős-Rényi and scale-free networks, we demonstrate that the annealed network approach is accurate if the mean degree and size of the network are sufficiently large. We also study analytically and numerically the Kuramoto model on star graphs and find that if the natural frequency of the central oscillator is sufficiently large in comparison to the average frequency of its neighbors, then synchronization emerges as a result of a first-order phase transition. This shows that oscillators sitting at hubs in a network may generate a discontinuous synchronization transition.

17 June 2020 in Physical Review Letters
Verified
Journal Article
Closed access
PDF file
BCBruno Coelho Coutinho
Bruno Coelho Coutinho
AWAng-Kun Wu
Ang-Kun Wu
HZHai-Jun Zhou
Hai-Jun Zhou
YLYang-Yu Liu
Yang-Yu Liu
We introduce two generalizations of core percolation in graphs to hypergraphs, related to the minimum hyperedge cover problem and the minimum vertex cover problem on hypergraphs, respectively. We offer analytical solutions of these two core percolations for uncorrelated random hypergraphs whose vertex degree and hyperedge cardinality distributions are arbitrary but have nondiverging moments. We find that for several real-world hypergraphs their two cores tend to be much smaller than those of their null models, suggesting that covering problems in those real-world hypergraphs can actually be solved in polynomial time.

28 April 2022 in Communications Physics
Verified
Journal Article
Open access
PDF file
BCBruno Coelho Coutinho
Bruno Coelho Coutinho
WMWilliam John Munro
William John Munro
KNKae Nemoto
Kae Nemoto
YOYasser Omar
Yasser Omar
Quantum networks allow us to harness networked quantum technologies and to develop a quantum internet. But how robust is a quantum network when its links and nodes start failing? We show that quantum complex networks based on typical noisy quantum-repeater nodes are prone to discontinuous phase transitions with respect to the random loss of operating links and nodes, abruptly compromising the connectivity of the network, and thus significantly limiting the reach of its operation. Furthermore, we determine the critical quantum-repeater efficiency necessary to avoid this catastrophic loss of connectivity as a function of the network topology, the network size, and the distribution of entanglement in the network. From all the network topologies tested, a scale-free network topology shows the best promise for a robust large-scale quantum internet.

12 April 2016 in Monthly Notices of the Royal Astronomical Society
Verified
Journal Article
Closed access
PDF file
SHSungryong Hong
Sungryong Hong
BCBruno C. Coutinho
Bruno C. Coutinho
ADArjun Dey
Arjun Dey
ABAlbert -L. Barabási
Albert -L. Barabási
MVMark Vogelsberger
Mark Vogelsberger
KGKarl Gebhardt
Karl Gebhardt
The large-scale distribution of galaxies is generally analysed using the two-point correlation function. However, this statistic does not capture the topology of the distribution, and it is necessary to resort to higher order correlations to break degeneracies. We demonstrate that an alternate approach using network analysis can discriminate between topologically different distributions that have similar two-point correlations. We investigate two galaxy point distributions, one produced by a cosmological simulation and the other by a Lévy walk. For the cosmological simulation, we adopt the redshift z = 0.58 slice from Illustris and select galaxies with stellar masses greater than 108 M⊙. The two-point correlation function of these simulated galaxies follows a single power law, ξ(r) ∼ r−1.5. Then, we generate Lévy walks matching the correlation function and abundance with the simulated galaxies. We find that, while the two simulated galaxy point distributions have the same abundance and two-point correlation function, their spatial distributions are very different; most prominently, filamentary structures, absent in Lévy fractals. To quantify these missing topologies, we adopt network analysis tools and measure diameter, giant component, and transitivity from networks built by a conventional friends-of-friends recipe with various linking lengths. Unlike the abundance and two-point correlation function, these network quantities reveal a clear separation between the two simulated distributions; therefore, the galaxy distribution simulated by Illustris is not a Lévy fractal quantitatively. We find that the described network quantities offer an efficient tool for discriminating topologies and for comparing observed and theoretical distributions.

23 October 2023 in IEEE Access
Verified
Journal Article
Open access
DCDiogo Cruz
Diogo Cruz
FMFrancisco A. Monteiro
Francisco A. Monteiro
BCBruno C. Coutinho
Bruno C. Coutinho
Quantum error correction codes (QECCs) play a central role in both quantum communications and quantum computation. Practical quantum error correction codes, such as stabilizer codes, are generally structured to suit a specific use, and present rigid code lengths and code rates. This paper shows that it is possible to both construct and decode QECCs that can attain the maximum performance of the finite blocklength regime, for any chosen code length when the code rate is sufficiently high. A recently proposed strategy for decoding classical codes called GRAND (guessing random additive noise decoding) opened doors to efficiently decode classical random linear codes (RLCs) performing near the maximum rate of the finite blocklength regime. By using noise statistics, GRAND is a noise-centric efficient universal decoder for classical codes, provided that a simple code membership test exists. These conditions are particularly suitable for quantum systems, and therefore the paper extends these concepts to quantum random linear codes (QRLCs), which were known to be possible to construct but whose decoding was not yet feasible. By combining QRLCs and a newly proposed quantum-GRAND, this work shows it is possible to decode QECCs that are easy to adapt to changing conditions. The paper starts by assessing the minimum number of gates in the coding circuit needed to reach the QRLCs’ asymptotic performance, and subsequently proposes a quantum-GRAND algorithm that makes use of quantum noise statistics, not only to build an adaptive code membership test, but also to efficiently implement syndrome decoding.

10 February 2020 in Physical Review A
Verified
Journal Article
Closed access
PDF file
TOTomo Osada
Tomo Osada
BCBruno Coutinho
Bruno Coutinho
YOYasser Omar
Yasser Omar
KSKaoru Sanaka
Kaoru Sanaka
WMWilliam J. Munro
William J. Munro
KNKae Nemoto
Kae Nemoto
The scale-free property emerges in various real-world networks and is an essential property that characterizes the dynamics or features of such networks. In this work, we investigate the effect of this scale-free property on a quantum information processing task of finding a marked node in the network, known as the quantum spatial search. We analyze the quantum spatial search algorithm using a continuous-time quantum walk on the Bollobás network, and we evaluate the time T to localize the quantum walker on the marked node starting from an unbiased initial state. Our main finding is that T is determined by the global structure around the marked node, while some local information of the marked node, such as the degree, does not identify T. We discuss this by examining the correlation between T and some centrality measures of the network, and we show that the closeness centrality of the marked node is highly correlated with T. We also characterize the distribution of T by marking different nodes in the network, which displays a multimode log-normal distribution. Especially on the Bollobás network, T is a few orders of magnitude shorter depending on whether the marked node is adjacent to the largest degree hub node. However, as T depends on the property of the marked node, one requires some amount of prior knowledge about such a property of the marked node in order to identify the optimal time to measure the quantum walker and achieve a fast search. These results indicate that the existence of the hub node in the scale-free network plays a crucial role in the quantum spatial search.