165 citations · 625 across the 18 of their papers we have counts for
19 papers
Unstructured Adiabatic Quantum Optimization: Optimality with Limitations
Arthur Braida, Shantanav Chakraborty, Alapan Chaudhuri +4
In the circuit model of quantum computing, amplitude amplification techniques can be used to find solutions to NP-hard problems defined on -bits in time …
Advantages of multistage quantum walks over QAOA
Lasse Gerblich, Tamanna Dasanjh, Horatio Q. X. Wong +4
Methods to find the solution state for optimization problems encoded into Ising Hamiltonians are a very active area of current research. In this work we compare the quantum approxi…
Anomalous bunching of nearly indistinguishable bosons
Léo Pioge, Benoit Seron, Leonardo Novo +1
The commonly assumed straight link between boson bunching and particle indistinguishability in quantum interferometry has recently been challenged [Nat. Photon. 17, 702 (2023)]. Ex…
Efficient validation of Boson Sampling from binned photon-number distributions
Benoit Seron, Leonardo Novo, Alex Arkhipov +1
In order to substantiate claims of quantum computational advantage, it is crucial to develop efficient methods for validating the experimental data. We propose a test of the correc…
Boson bunching is not maximized by indistinguishable particles
Benoît Seron, Leonardo Novo, Nicolas J. Cerf
Boson bunching is amongst the most remarkable features of quantum physics. A celebrated example in optics is the Hong-Ou-Mandel effect, where the bunching of two photons arises fro…
Quadratic speedup for spatial search by continuous-time quantum walk
Simon Apers, Shantanav Chakraborty, Leonardo Novo +1
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. Wheth…
Floquet engineering of continuous-time quantum walks: towards the simulation of complex and next-to-nearest neighbor couplings
Leonardo Novo, Sofia Ribeiro
The formalism of continuous-time quantum walks on graphs has been widely used in the study of quantum transport of energy and information, as well as in the development of quantum…
On the optimality of spatial search by continuous-time quantum walk
Shantanav Chakraborty, Leonardo Novo, Jérémie Roland
One of the most important algorithmic applications of quantum walks is to solve spatial search problems. A widely used quantum algorithm for this problem, introduced by Childs and…
Quantum advantage from energy measurements of many-body quantum systems
Leonardo Novo, Juani Bermejo-Vega, Raúl García-Patrón
The problem of sampling outputs of quantum circuits has been proposed as a candidate for demonstrating a quantum computational advantage (sometimes referred to as quantum "supremac…
Finding a marked node on any graph by continuous-time quantum walk
Shantanav Chakraborty, Leonardo Novo, Jérémie Roland
Spatial search by discrete-time quantum walk can find a marked node on any ergodic, reversible Markov chain quadratically faster than its classical counterpart, i.e.\ in a time…
Environment-assisted analog quantum search
Leonardo Novo, Shantanav Chakraborty, Masoud Mohseni +1
Two main obstacles for observing quantum advantage in noisy intermediate-scale quantum computers (NISQ) are the finite precision effects due to control errors, or disorders, and de…
Optimal quantum spatial search on random temporal networks
Shantanav Chakraborty, Leonardo Novo, Serena Di Giorgio +1
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 fin…
Improved Hamiltonian simulation via a truncated Taylor series and corrections
Leonardo Novo, Dominic W. Berry
We describe an improved version of the quantum simulation method based on the implementation of a truncated Taylor series of the evolution operator. The idea is to add an extra ste…
Corrected quantum walk for optimal Hamiltonian simulation
Dominic W. Berry, Leonardo Novo
We describe a method to simulate Hamiltonian evolution on a quantum computer by repeatedly using a superposition of steps of a quantum walk, then applying a correction to the weigh…
Spatial search by quantum walk is optimal for almost all graphs
Shantanav Chakraborty, Leonardo Novo, Andris Ambainis +1
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…
Quantum walks in synthetic gauge fields with 3D integrated photonics
Octavi Boada, Leonardo Novo, Fabio Sciarrino +1
There is great interest in designing photonic devices capable of disorder-resistant transport and information processing. In this work we propose to exploit 3D integrated photonic…
Systematic Dimensionality Reduction for Quantum Walks: Optimal Spatial Search and Transport on Non-Regular Graphs
Leonardo Novo, Shantanav Chakraborty, Masoud Mohseni +2
Continuous time quantum walks provide an important framework for designing new algorithms and modelling quantum transport and state transfer problems. Often, the graph representing…
Disorder-assisted quantum transport in suboptimal decoherence regimes
Leonardo Novo, Masoud Mohseni, Yasser Omar
We investigate quantum transport in binary tree structures and in hypercubes for the disordered Frenkel-exciton Hamiltonian under pure dephasing noise. We compute the energy transp…
Genuine multiparticle entanglement of permutationally invariant states
Leonardo Novo, Tobias Moroder, Otfried Gühne
We consider the problem of characterizing genuine multiparticle entanglement for permutationally invariant states using the approach of PPT mixtures. We show that the evaluation of…