Panagiotis Kl. Barkoutsos

Panagiotis Kl. Barkoutsos

Auto-generated profile, based on publicly available information

Panagiotis Kl. Barkoutsos

IBM Quantum, IBM Research - Zurich, Rüschlikon, Switzerland

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

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

Representative Publications

View All Publications
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.

25 March 2020 in The Journal of Chemical Physics
Verified
Journal Article
Closed access
PDF file
ISIgor O. Sokolov
Igor O. Sokolov
PBPanagiotis Kl. Barkoutsos
Panagiotis Kl. Barkoutsos
POPauline J. Ollitrault
Pauline J. Ollitrault
DGDonny Greenberg
Donny Greenberg
JRJulia Rice
Julia Rice
ITIvano Tavernelli
Ivano Tavernelli
The Coupled Cluster (CC) method is used to compute the electronic correlation energy in atoms and molecules and often leads to highly accurate results. However, due to its single-reference nature, standard CC in its projected form fails to describe quantum states characterized by strong electronic correlations and multi-reference projective methods become necessary. On the other hand, quantum algorithms for the solution of many-electron problems have also emerged recently. The quantum unitary variant of CC (UCC) with singles and doubles (q-UCCSD) is a popular wavefunction Ansatz for the variational quantum eigensolver algorithm. The variational nature of this approach can lead to significant advantages compared to its classical equivalent in the projected form, in particular, for the description of strong electronic correlation. However, due to the large number of gate operations required in q-UCCSD, approximations need to be introduced in order to make this approach implementable in a state-of-the-art quantum computer. In this work, we evaluate several variants of the standard q-UCCSD Ansatz in which only a subset of excitations is included. In particular, we investigate the singlet and pair q-UCCD approaches combined with orbital optimization. We show that these approaches can capture the dissociation/distortion profiles of challenging systems, such as H4, H2O, and N2 molecules, as well as the one-dimensional periodic Fermi–Hubbard chain. These results promote the future use of q-UCC methods for the solution of challenging electronic structure problems in quantum chemistry.

17 February 2021 in npj Quantum Information
Verified
Journal Article
Open access
PDF file
ARAnton Robert
Anton Robert
PBPanagiotis Kl. Barkoutsos
Panagiotis Kl. Barkoutsos
SWStefan Woerner
Stefan Woerner
ITIvano Tavernelli
Ivano Tavernelli
Predicting the three-dimensional structure of a protein from its primary sequence of amino acids is known as the protein folding problem. Due to the central role of proteins’ structures in chemistry, biology and medicine applications, this subject has been intensively studied for over half a century. Although classical algorithms provide practical solutions for the sampling of the conformation space of small proteins, they cannot tackle the intrinsic NP-hard complexity of the problem, even when reduced to the simplest Hydrophobic-Polar model. On the other hand, while fault-tolerant quantum computers are beyond reach for state-of-the-art quantum technologies, there is evidence that quantum algorithms can be successfully used in noisy state-of-the-art quantum computers to accelerate energy optimization in frustrated systems. In this work, we present a model Hamiltonian with $${\mathcal{O}}({N}^{4})$$ O ( N 4 ) scaling and a corresponding quantum variational algorithm for the folding of a polymer chain with N monomers on a lattice. The model reflects many physico-chemical properties of the protein, reducing the gap between coarse-grained representations and mere lattice models. In addition, we use a robust and versatile optimization scheme, bringing together variational quantum algorithms specifically adapted to classical cost functions and evolutionary strategies to simulate the folding of the 10 amino acid Angiotensin on 22 qubits. The same method is also successfully applied to the study of the folding of a 7 amino acid neuropeptide using 9 qubits on an IBM 20-qubit quantum computer. Bringing together recent advances in building gate-based quantum computers with noise-tolerant hybrid quantum-classical algorithms, this work paves the way towards accessible and relevant scientific experiments on real quantum processors.

27 October 2020 in Physical Review Research
Verified
Journal Article
Open access
PDF file
POPauline J. Ollitrault
Pauline J. Ollitrault
AKAbhinav Kandala
Abhinav Kandala
CCChun-Fu Chen
Chun-Fu Chen
PBPanagiotis Kl. Barkoutsos
Panagiotis Kl. Barkoutsos
AMAntonio Mezzacapo
Antonio Mezzacapo
ITIvano Tavernelli
Ivano Tavernelli
The computation of molecular excitation energies is essential for predicting photo-induced reactions of chemical and technological interest. While the classical computing resources needed for this task scale poorly, quantum algorithms emerge as promising alternatives. In particular, the extension of the variational quantum eigensolver algorithm to the computation of the excitation energies is an attractive option. However, there is currently a lack of such algorithms for correlated molecular systems that is amenable to near-term, noisy hardware. In this work, we propose an extension of the well-established classical equation of motion approach to a quantum algorithm for the calculation of molecular excitation energies on noisy quantum computers. In particular, we demonstrate the efficiency of this approach in the calculation of the excitation energies of the LiH molecule on an IBM Quantum computer.

3 May 2021 in Physical Review Research
Verified
Journal Article
Open access
PDF file
ACAlexandre Choquette
Alexandre Choquette
APAgustin Di Paolo
Agustin Di Paolo
PBPanagiotis Kl. Barkoutsos
Panagiotis Kl. Barkoutsos
DSDavid Sénéchal
David Sénéchal
ITIvano Tavernelli
Ivano Tavernelli
ABAlexandre Blais
Alexandre Blais
A central component of variational quantum algorithms (VQAs) is the state-preparation circuit, also known as ansatz or variational form. This circuit is most commonly designed such as to exploit symmetries of the problem Hamiltonian and, in this way, constrain the variational search to a subspace of interest. Here, we show that this approach is not always advantageous by introducing ansatzes that incorporate symmetry-breaking unitaries. This class of ansatzes, that we call quantum-optimal-Control-inspired ansates (QOCA), is inspired by the theory of quantum optimal control and leads to an improved convergence of VQAs for some important problems. Indeed, we benchmark QOCA against popular variational forms applied to the Fermi-Hubbard model at half-filling and show that our variational circuits can approximate the ground state of this model with high accuracy. We also show how QOCA can be used to find the ground state of the water molecule and compare the performance of our ansatz against other common choices used for chemistry problems. This work constitutes a first step towards the development of a more general class of symmetry-breaking ansatzes with applications to physics and chemistry problems.

15 March 2021 in The Journal of Chemical Physics
Verified
Journal Article
Closed access
PDF file
MRMax Rossmannek
Max Rossmannek
PBPanagiotis Kl. Barkoutsos
Panagiotis Kl. Barkoutsos
POPauline J. Ollitrault
Pauline J. Ollitrault
ITIvano Tavernelli
Ivano Tavernelli
In the near future, material and drug design may be aided by quantum computer assisted simulations. These have the potential to target chemical systems intractable by the most powerful classical computers. However, the resources offered by contemporary quantum computers are still limited, restricting the simulations to very simple molecules. In order to rapidly scale up to more interesting molecular systems, we propose the embedding of the quantum electronic structure calculation into a classically computed environment obtained at the Hartree–Fock (HF) or density functional theory (DFT) level of theory. This result is achieved by constructing an effective Hamiltonian that incorporates a mean field potential describing the action of the inactive electrons on a selected Active Space (AS). The ground state of the AS Hamiltonian is then determined by means of the variational quantum eigensolver algorithm. We show that with the proposed HF and DFT embedding schemes, we can obtain significant energy corrections to the reference HF and DFT calculations for a number of simple molecules in their strongly correlated limit (the dissociation regime) as well as for systems of the size of the oxirane molecule.