Leonardo Novo

Leonardo Novo

Auto-generated profile, based on publicly available information

Leonardo Novo

International Iberian Nanotechnology Laboratory (INL) Av. Mestre Jose Veiga 4715-330 Braga 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
11 March 2016 in Physical Review Letters
Verified
Journal Article
Closed access
PDF file
SCShantanav Chakraborty
Shantanav Chakraborty
LNLeonardo Novo
Leonardo Novo
AAAndris Ambainis
Andris Ambainis
YOYasser Omar
Yasser Omar
The problem of finding a marked node in a graph can be solved by the spatial search algorithm based on continuous-time quantum walks (CTQW). However, this algorithm is known to run in optimal time only for a handful of graphs. In this work, we prove that for Erdös-Renyi random graphs, i.e., graphs of n vertices where each edge exists with probability p, search by CTQW is almost surely optimal as long as p≥log3/2(n)/n. Consequently, we show that quantum spatial search is in fact optimal for almost all graphs, meaning that the fraction of graphs of n vertices for which this optimality holds tends to one in the asymptotic limit. We obtain this result by proving that search is optimal on graphs where the ratio between the second largest and the largest eigenvalue is bounded by a constant smaller than 1. Finally, we show that we can extend our results on search to establish high fidelity quantum communication between two arbitrary nodes of a random network of interacting qubits, namely, to perform quantum state transfer, as well as entanglement generation. Our work shows that quantum information tasks typically designed for structured systems retain performance in very disordered structures.

2 September 2015 in Scientific Reports
Verified
Journal Article
Open access
PDF file
LNLeonardo Novo
Leonardo Novo
SCShantanav Chakraborty
Shantanav Chakraborty
MMMasoud Mohseni
Masoud Mohseni
HNHartmut Neven
Hartmut Neven
YOYasser Omar
Yasser Omar
Continuous time quantum walks provide an important framework for designing new algorithms and modelling quantum transport and state transfer problems. Often, the graph representing the structure of a problem contains certain symmetries that confine the dynamics to a smaller subspace of the full Hilbert space. In this work, we use invariant subspace methods, that can be computed systematically using the Lanczos algorithm, to obtain the reduced set of states that encompass the dynamics of the problem at hand without the specific knowledge of underlying symmetries. First, we apply this method to obtain new instances of graphs where the spatial quantum search algorithm is optimal: complete graphs with broken links and complete bipartite graphs, in particular, the star graph. These examples show that regularity and high-connectivity are not needed to achieve optimal spatial search. We also show that this method considerably simplifies the calculation of quantum transport efficiencies. Furthermore, we observe improved efficiencies by removing a few links from highly symmetric graphs. Finally, we show that this reduction method also allows us to obtain an upper bound for the fidelity of a single qubit transfer on an XY spin network.

14 October 2022 in Physical Review Letters
Verified
Journal Article
Closed access
PDF file
SASimon Apers
Simon Apers
SCShantanav Chakraborty
Shantanav Chakraborty
LNLeonardo Novo
Leonardo Novo
JRJérémie Roland
Jérémie Roland
Continuous-time quantum walks provide a natural framework to tackle the fundamental problem of finding a node among a set of marked nodes in a graph, known as spatial search. Whether spatial search by continuous-time quantum walk provides a quadratic advantage over classical random walks has been an outstanding problem. Thus far, this advantage is obtained only for specific graphs or when a single node of the underlying graph is marked. In this Letter, we provide a new continuous-time quantum walk search algorithm that completely resolves this: our algorithm can find a marked node in any graph with any number of marked nodes, in a time that is quadratically faster than classical random walks. The overall algorithm is quite simple, requiring time evolution of the quantum walk Hamiltonian followed by a projective measurement. A key component of our algorithm is a purely analogue procedure to perform operations on a state of the form e−tH2|ψ⟩, which, for a given Hamiltonian H, only requires evolving H for time scaling as t. This allows us to quadratically fast-forward the dynamics of a continuous-time classical random walk. The applications of our Letter thus go beyond the realm of quantum walks and can lead to new analog quantum algorithms for preparing ground states of Hamiltonians or solving optimization problems.

8 July 2013 in Physical Review A
Verified
Journal Article
Closed access
LNLeonardo Novo
Leonardo Novo
TMTobias Moroder
Tobias Moroder
OGOtfried Gühne
Otfried Gühne
We consider the problem of characterizing genuine multiparticle entanglement for permutationally invariant states using the approach of positive partial transpose mixtures. We show that the evaluation of this necessary biseparability criterion scales polynomially with the number of particles. In practice, it can be evaluated easily up to ten qubits and improves existing criteria significantly. Finally, we show that our approach solves the problem of characterizing genuine multiparticle entanglement for permutationally invariant three-qubit states.

28 November 2017 in Physical Review Letters
Verified
Journal Article
Closed access
PDF file
SCShantanav Chakraborty
Shantanav Chakraborty
LNLeonardo Novo
Leonardo Novo
SGSerena Di Giorgio
Serena Di Giorgio
YOYasser Omar
Yasser Omar
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(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.

8 November 2024 in Physical Review Letters
Verified
Journal Article
Closed access
CFCarlos Fernandes
Carlos Fernandes
RWRafael Wagner
Rafael Wagner
LNLeonardo Novo
Leonardo Novo
EGErnesto F. Galvão
Ernesto F. Galvão
Quantum theory is traditionally formulated using complex numbers. This imaginarity of quantum theory has been quantified as a resource with applications in discrimination tasks, pseudorandomness generation, and quantum metrology. In the standard formulation, a quantum state is said to have "imaginarity" if the associated density matrix is not real-valued in a given, fixed basis. If instead we consider a set of states, it is possible to devise tests that guarantee imaginarity of some state in the set, independently of the basis chosen. Here we propose such basis-independent witnesses for imaginarity that rely on measurements of unitary-invariant properties of sets of states. For three pure states, we completely characterize the invariant values attainable by quantum theory, and give a partial characterization for four pure states. We show that simple pairwise overlap measurements suffice to witness imaginarity of sets of four states, but not for sets of three. Our witnesses are experimentally friendly, opening up a new path for measuring and using imaginarity as a resource.