Edoardo Tignone

Dr. Edoardo Tignone


Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

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

Representative Publications

View All Publications
16 October 2023 in IEEE Transactions on Quantum Engineering
Verified
Journal Article
Open access
STSimone Tibaldi
Simone Tibaldi
DVDavide Vodola
Davide Vodola
ETEdoardo Tignone
Edoardo Tignone
EEElisa Ercolessi
Elisa Ercolessi
The Quantum Approximate Optimization Algorithm (QAOA) adopts a hybrid quantum-classical approach to find approximate solutions to variational optimization problems. In fact, it relies on a classical subroutine to optimize the parameters of a quantum circuit. In this work we present a Bayesian optimization procedure to fulfil this optimization task, and we investigate its performance in comparison with other global optimizers. We show that our approach allows for a significant reduction in the number of calls to the quantum circuit, which is typically the most expensive part of the QAOA. We demonstrate that our method works well also in the regime of slow circuit repetition rates, and that few measurements of the quantum ansatz would already suffice to achieve a good estimate of the energy. In addition, we study the performance of our method in the presence of noise at gate level, and we find that for low circuit depths it is robust against noise. Our results suggest that the method proposed here is a promising framework to leverage the hybrid nature of QAOA on the noisy intermediate-scale quantum devices.

22 August 2024 in IEEE Transactions on Quantum Engineering
Verified
Journal Article
Open access
CSClaudio Sanavio
Claudio Sanavio
STSimone Tibaldi
Simone Tibaldi
ETEdoardo Tignone
Edoardo Tignone
EEElisa Ercolessi
Elisa Ercolessi
The imputation of missing data is a common procedure in data analysis that consists in predicting missing values of incomplete data points. In this work we analyse a variational quantum circuit for the imputation of missing data. We construct variational quantum circuits with gates complexity $\mathcal {O}(N)$ and $\mathcal {O}(N^{2})$ that return the last missing bit of a binary string for a specific distribution. We train and test the performance of the algorithms on a series of datasets finding good convergence of the results. Finally, we test the circuit for generalization to unseen data. For simple systems, we are able to describe the circuit analytically, making possible to skip the tedious and unresolved problem of training the circuit with repetitive measurements. We find beforehand the optimal values of the parameters and we make use of them to construct an optimal circuit suited to the generation of truly random data.

19 April 2024 in Entropy
Verified
Journal Article
Open access
PDF file
CSClaudio Sanavio
Claudio Sanavio
ETEdoardo Tignone
Edoardo Tignone
EEElisa Ercolessi
Elisa Ercolessi
Quantum annealers are suited to solve several logistic optimization problems expressed in the QUBO formulation. However, the solutions proposed by the quantum annealers are generally not optimal, as thermal noise and other disturbing effects arise when the number of qubits involved in the calculation is too large. In order to deal with this issue, we propose the use of the classical branch-and-bound algorithm, that divides the problem into sub-problems which are described by a lower number of qubits. We analyze the performance of this method on two problems, the knapsack problem and the traveling salesman problem. Our results show the advantages of this method, that balances the number of steps that the algorithm has to make with the amount of error in the solution found by the quantum hardware that the user is willing to risk. The results are obtained using the commercially available quantum hardware D-Wave Advantage, and they outline the strategy for a practical application of the quantum annealers.

11 December 2025 in EPJ Quantum Technology
Verified
Journal Article
Open access
PDF file
STSimone Tibaldi
Simone Tibaldi
LLLucas Leclerc
Lucas Leclerc
DVDavide Vodola
Davide Vodola
ETEdoardo Tignone
Edoardo Tignone
EEElisa Ercolessi
Elisa Ercolessi
This study explores the implementation of the Quantum Approximate Optimisation Algorithm (QAOA) in its analog form using a neutral atom quantum processing

18 April 2021 in arXiv
Verified
Preprint
Open access
PDF file
ECEugenio Cocchi
Eugenio Cocchi
ETEdoardo Tignone
Edoardo Tignone
DVDavide Vodola
Davide Vodola
We demonstrate that a quantum annealer can be used to solve the NP-complete problem of graph partitioning into subgraphs containing Hamiltonian cycles of constrained length. We present a method to find a partition of a given directed graph into Hamiltonian subgraphs with three or more vertices, called vertex 3-cycle cover. We formulate the problem as a quadratic unconstrained binary optimisation and run it on a D-Wave Advantage quantum annealer. We test our method on synthetic graphs constructed by adding a number of random edges to a set of disjoint cycles. We show that the probability of solution is independent of the cycle length, and a solution is found for graphs up to 4000 vertices and 5200 edges, close to the number of physical working qubits available on the quantum annealer.

1 April 2026
Verified
Thesis
Closed access
ETEdoardo Tignone
Edoardo Tignone
Electrodynamique quantique en cavité : des cristaux photoniques aux atomes de Rydberg: Dans le premier chapitre de la thèse, nous étudions la possibilité d’améliorer le couplage opto- mechanique photon-phonon entre le mode de résonance d’une cavité Fabry-Pérot de haute finesse et les vibrations mécaniques des éléments diélectriques (membranes) à l’intérieur de la cavité. En introduisant un défaut quadratique dans la disposition des membranes, nous montrons que le deux couplages (linéaire et quadratique) augmentent. Enfin, nous proposons un modèle très simple avec lequel on cherche à simuler un cristal photonique quasipériodique. Dans le deuxième chapitre de cette thèse, nous présentons nos résultats de recherche sur le transport d’excitons à travers une cavité visant à augmenter l’efficacité du transport. Le modèle que l’on étudie est une chaîne unidimensionnelle d’atomes froids comprenant chacun deux niveaux énergétiques. Grâce au couplage entre exciton et photon, ces deux quanta s’hybrident et forment deux branches de polariton à l’intérieur de la cavité. Nous avons observé qu’à résonance avec un des deux modes de polariton, on peut transmettre l’exciton via le mode polaritonique dans un temps très court. En outre, le désordre n’affecte la propagation excitonique que de façon algébrique. Dans le troisième chapitre de cette thèse, nous présentons nos résultats de recherche sur la réalisa- tion d’interactions entre photons grâce à la médiation d’atomes ultrafroids piégés dans un réseaux optique unidimensionnelle et placés à l’intérieur d’une fibre à cristaux photoniques. Nous avons détecté un régime dans lequel on peut réaliser le “bunching” photon-photon.Dans le quatrième et dernière chapitre de cette thèse, nous étendons les résultats du chapitre précédent aux atomes de Rydberg.