Giacomo Nannicini

Giacomo Nannicini

Auto-generated profile, based on publicly available information

Giacomo Nannicini

Department of Industrial and Systems Engineering, University of Southern California, Los Angeles, USA

Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

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

Representative Publications

View All Publications
28 October 2024 in Nature Reviews Physics
Verified
Journal Article
Closed access
PDF file
AAAmira Abbas
Amira Abbas
AAAndris Ambainis
Andris Ambainis
BABrandon Augustino
Brandon Augustino
ABAndreas Bärtschi
Andreas Bärtschi
HBHarry Buhrman
Harry Buhrman
CZChrista Zoufal
Christa Zoufal

20 April 2020 in Quantum
Verified
Journal Article
Open access
PDF file
PBPanagiotis Kl. Barkoutsos
Panagiotis Kl. Barkoutsos
GNGiacomo Nannicini
Giacomo Nannicini
ARAnton Robert
Anton Robert
ITIvano Tavernelli
Ivano Tavernelli
SWStefan Woerner
Stefan Woerner
Hybrid quantum/classical variational algorithms can be implemented on noisy intermediate-scale quantum computers and can be used to find solutions for combinatorial optimization problems. Approaches discussed in the literature minimize the expectation of the problem Hamiltonian for a parameterized trial quantum state. The expectation is estimated as the sample mean of a set of measurement outcomes, while the parameters of the trial state are optimized classically. This procedure is fully justified for quantum mechanical observables such as molecular energies. In the case of classical optimization problems, which yield diagonal Hamiltonians, we argue that aggregating the samples in a different way than the expected value is more natural. In this paper we propose the Conditional Value-at-Risk as an aggregation function. We empirically show -- using classical simulation as well as quantum hardware -- that this leads to faster convergence to better solutions for all combinatorial optimization problems tested in our study. We also provide analytical results to explain the observed difference in performance between different variational algorithms.

14 January 2019 in Physical Review E
Verified
Journal Article
Open access
PDF file
GNGiacomo Nannicini
Giacomo Nannicini
The recent literature on near-term applications for quantum computers contains several examples of the applications of hybrid quantum-classical variational approaches. This methodology can be applied to a variety of optimization problems, but its practical performance is not well studied yet. This paper moves some steps in the direction of characterizing the practical performance of the methodology, in the context of finding solutions to classical combinatorial optimization problems. Our study is based on numerical results obtained applying several classical nonlinear optimization algorithms to Hamiltonians for six combinatorial optimization problems; the experiments are conducted via noise-free classical simulation of the quantum circuits implemented in Qiskit. We empirically verify that: (1) finding the ground state is harder for Hamiltonians with many Pauli terms; (2) classical global optimization methods are more successful than local methods due to their ability of avoiding the numerous local optima; (3) there does not seem to be a clear advantage in introducing entanglement in the variational form.

1 July 2017 in IBM Journal of Research and Development
Verified
Journal Article
Closed access
GDG. I. Diaz
G. I. Diaz
AFA. Fokoue-Nkoutche
A. Fokoue-Nkoutche
GNG. Nannicini
G. Nannicini
HSH. Samulowitz
H. Samulowitz

27 August 2018 in Mathematical Programming Computation
Verified
Journal Article
Closed access
PDF file
ACAlberto Costa
Alberto Costa
GNGiacomo Nannicini
Giacomo Nannicini

21 October 2022 in ACM Transactions on Quantum Computing
Verified
Journal Article
Open access
GNGiacomo Nannicini
Giacomo Nannicini
LBLev S. Bishop
Lev S. Bishop
OGOktay Günlük
Oktay Günlük
PJPetar Jurcevic
Petar Jurcevic
We consider the problem of mapping a logical quantum circuit onto a given hardware with limited 2-qubit connectivity. We model this problem as an integer linear program, using a network flow formulation with binary variables that includes the initial allocation of qubits and their routing. We consider several cost functions: an approximation of the fidelity of the circuit, its total depth, and a measure of cross-talk, all of which can be incorporated in the model. Numerical experiments on synthetic data and different hardware topologies indicate that the error rate and depth can be optimized simultaneously without significant loss. We test our algorithm on a large number of quantum volume circuits, optimizing for error rate and depth; our algorithm significantly reduces the number of CNOTs compared to Qiskit’s default transpiler SABRE [ 19 ] and produces circuits that, when executed on hardware, exhibit higher fidelity.