Alba Cervera-Lierta

Alba Cervera-Lierta

Auto-generated profile, based on publicly available information

Alba Cervera-Lierta

Barcelona Supercomputing Center

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

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

Representative Publications

View All Publications
15 February 2022 in Reviews of Modern Physics
Verified
Journal Article
Closed access
PDF file
KBKishor Bharti
Kishor Bharti
ACAlba Cervera-Lierta
Alba Cervera-Lierta
Thi Ha KyawThi Ha Kyaw
Thi Ha Kyaw
THTobias Haug
Tobias Haug
SASumner Alperin-Lea
Sumner Alperin-Lea
AAAlán Aspuru-Guzik
Alán Aspuru-Guzik
A universal fault-tolerant quantum computer that can efficiently solve problems such as integer factorization and unstructured database search requires millions of qubits with low error rates and long coherence times. While the experimental advancement toward realizing such devices will potentially take decades of research, noisy intermediate-scale quantum (NISQ) computers already exist. These computers are composed of hundreds of noisy qubits, i.e., qubits that are not error corrected, and therefore perform imperfect operations within a limited coherence time. In the search for achieving quantum advantage with these devices, algorithms have been proposed for applications in various disciplines spanning physics, machine learning, quantum chemistry, and combinatorial optimization. The overarching goal of such algorithms is to leverage the limited available resources to perform classically challenging tasks. In this review, a thorough summary of NISQ computational paradigms and algorithms is provided. The key structure of these algorithms and their limitations and advantages are discussed. A comprehensive overview of various benchmarking and software tools useful for programming and testing NISQ devices is additionally provided.

6 February 2020 in Quantum
Verified
Journal Article
Open access
PDF file
APAdrián Pérez-Salinas
Adrián Pérez-Salinas
ACAlba Cervera-Lierta
Alba Cervera-Lierta
EGElies Gil-Fuster
Elies Gil-Fuster
JLJosé I. Latorre
José I. Latorre
A single qubit provides sufficient computational capabilities to construct a universal quantum classifier when assisted with a classical subroutine. This fact may be surprising since a single qubit only offers a simple superposition of two states and single-qubit gates only make a rotation in the Bloch sphere. The key ingredient to circumvent these limitations is to allow for multipledata re-uploading. A quantum circuit can then be organized as a series of data re-uploading and single-qubit processing units. Furthermore, both data re-uploading and measurements can accommodate multiple dimensions in the input and several categories in the output, to conform to a universal quantum classifier. The extension of this idea to several qubits enhances the efficiency of the strategy as entanglement expands the superpositions carried along with the classification. Extensive benchmarking on different examples of the single- and multi-qubit quantum classifier validates its ability to describe and classify complex data.

21 December 2018 in Quantum
Verified
Journal Article
Open access
ACAlba Cervera-Lierta
Alba Cervera-Lierta
We present an exact simulation of a one-dimensional transverse Ising spin chain with a quantum computer. We construct an efficient quantum circuit that diagonalizes the Ising Hamiltonian and allows to obtain all eigenstates of the model by just preparing the computational basis states. With an explicit example of that circuit for n=4 spins, we compute the expected value of the ground state transverse magnetization, the time evolution simulation and provide a method to also simulate thermal evolution. All circuits are run in IBM and Rigetti quantum devices to test and compare them qualitatively.

24 November 2017 in SciPost Physics
Verified
Journal Article
Open access
PDF file
ACAlba Cervera-Lierta
Alba Cervera-Lierta
JLJosé Latorre
José Latorre
JRJuan Rojo
Juan Rojo
LRLuca Rottoli
Luca Rottoli
We analyze how maximal entanglement is generated at the fundamental level in QED by studying correlations between helicity states in tree-level scattering processes at high energy. We demonstrate that two mechanisms for the generation of maximal entanglement are at work: i) ss -channel processes where the virtual photon carries equal overlaps of the helicities of the final state particles, and ii) the indistinguishable superposition between tt - and uu -channels. We then study whether requiring maximal entanglement constrains the coupling structure of QED and the weak interactions. In the case of photon-electron interactions unconstrained by gauge symmetry, we show how this requirement allows to reproduce QED. For ZZ -mediated weak scattering, the maximal entanglement principle leads to non-trivial predictions for the value of the weak mixing angle \theta_WθW . Our results are a first step towards understanding the connections between maximal entanglement and the fundamental symmetries of high-energy physics.

23 February 2022 in Physical Review Applied
Verified
Journal Article
Closed access
PDF file
ACAlba Cervera-Lierta
Alba Cervera-Lierta
MKMario Krenn
Mario Krenn
AAAlán Aspuru-Guzik
Alán Aspuru-Guzik
AGAlexey Galda
Alexey Galda
Multipartite entanglement is one of the core concepts in quantum information science with broad applications that span from condensed matter physics to quantum physics foundation tests. Although its most studied and tested forms encompass two-dimensional systems, current quantum platforms technically allow the manipulation of additional quantum levels. We report the experimental demonstration and certification of a high-dimensional multipartite entangled state in a superconducting quantum processor. We generate the three-qutrit Greenberger-Horne-Zeilinger state by designing the necessary pulses to perform high-dimensional quantum operations. We obtain the fidelity of 76%±1%, proving the generation of a genuine three-partite and three-dimensional entangled state. To this date, only photonic devices have been able to create and certify the entanglement of these high-dimensional states. Our work demonstrates that another platform, superconducting systems, is ready to exploit genuine high-dimensional entanglement and that a programmable quantum device accessed on the cloud can be used to design and execute experiments beyond binary quantum computation.

28 May 2021 in PRX Quantum
Verified
Journal Article
Open access
PDF file
ACAlba Cervera-Lierta
Alba Cervera-Lierta
JKJakob S. Kottmann
Jakob S. Kottmann
AAAlán Aspuru-Guzik
Alán Aspuru-Guzik
We present the meta-variational quantum eigensolver (VQE), an algorithm capable of learning the ground-state energy profile of a parameterized Hamiltonian. If the meta-VQE is trained with a few data points, it delivers an initial circuit parameterization that can be used to compute the ground-state energy of any parameterization of the Hamiltonian within a certain trust region. We test this algorithm with an XXZ spin chain, an electronic H4 Hamiltonian, and a single-transmon quantum simulation. In all cases, the meta-VQE is able to learn the shape of the energy functional and, in some cases, it results in improved accuracy in comparison with individual VQE optimization. The meta-VQE algorithm introduces both a gain in efficiency for parameterized Hamiltonians in terms of the number of optimizations and a good starting point for the quantum circuit parameters for individual optimizations. The proposed algorithm can be readily mixed with other improvements in the field of variational algorithms to shorten the distance between the current state of the art and applications with quantum advantage.