2 December 2019 in Physical Review B
We present a study of the digitized quantum annealing protocol proposed by R. Barends et al. [ Nature (London) 534, 222 (2016)]. Our analysis, performed on the benchmark case of a transverse Ising chain problem, shows that the algorithm has a well-defined optimal working point for the annealing time , scaling as , where is the number of digital Trotter steps, beyond which the residual energy error shoots up toward the value characteristic of the maximally disordered state. We present an analytical analysis for the translationally invariant transverse Ising chain case, but our numerical evidence suggests that this scenario is more general, surviving, for instance, the presence of disorder.
24 January 2022 in Physical Review Letters
We present a numerical strategy to efficiently estimate bipartite entanglement measures, and in particular the entanglement of formation, for many-body quantum systems on a lattice. Our approach exploits the tree tensor operator tensor network Ansatz, a positive loopless representation for density matrices which, as we demonstrate, efficiently encodes information on bipartite entanglement, enabling the upscaling of entanglement estimation. Employing this technique, we observe a finite-size scaling law for the entanglement of formation in 1D critical lattice models at finite temperature for up to 128 spins, extending to mixed states the scaling law for the entanglement entropy.
16 June 2026 in Physical Review Research
Variational quantum algorithms (VQAs) aim at solving classical or quantum optimization problems by optimizing parametrized trial states on a quantum device, based on the outcomes of noisy projective measurements. The associated optimization process benefits from an accurate modeling of the cost function landscape using Gaussian process models (GPMs), whose performance is critically affected by the choice of their kernel. Here, we introduce specialized trigonometric kernels, inspired by the observation that typical VQA cost functions display oscillatory behavior with only few frequencies. Appropriate scores to benchmark the reliability of a GPM are defined, and a systematic comparison between different kernels is carried out on prototypical problems from quantum chemistry and combinatorial optimization. We further introduce RotoGP, a sequential line-search optimizer equipped with a GPM, and test how different kernels can help mitigate noise and improve optimization convergence. Overall, we observe that the trigonometric kernels show the best performance in most of the cases under study.