arXiv subjects

Alba Cervera-Lierta

Publications and source records attributed to Alba Cervera-Lierta.

27 records · Page 2Linked to original sources

arXiv2021

Noisy intermediate-scale quantum (NISQ) algorithms

A universal fault-tolerant quantum computer that can solve efficiently 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 towards 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 in a limited coherence time. In the search for quantum advantage with these devices, algorithms have been proposed for applications in various disciplines spanning physics, machine learning, quantum chemistry and combinatorial optimization. The goal of such algorithms is to leverage the limited available resources to perform classically challenging tasks. In this review, we provide a thorough summary of NISQ computational paradigms and algorithms. We discuss the key structure of these algorithms, their limitations, and advantages. We additionally provide a comprehensive overview of various benchmarking and software tools useful for programming and testing NISQ devices.

quant-ph↗

arXiv2021

The Meta-Variational Quantum Eigensolver (Meta-VQE): Learning energy profiles of parameterized Hamiltonians for quantum simulation

We present the meta-VQE, an algorithm capable to learn the ground state energy profile of a parametrized Hamiltonian. By training the meta-VQE with a few data points, it delivers an initial circuit parametrization that can be used to compute the ground state energy of any parametrization of the Hamiltonian within a certain trust region. We test this algorithm with a XXZ spin chain, an electronic H$_{4}$ 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, resulted in improved accuracy in comparison to individual VQE optimization. The meta-VQE algorithm introduces both a gain in efficiency for parametrized Hamiltonians, in terms of the number of optimizations, and a good starting point for the quantum circuit parameters for individual optimizations. The proposed algorithm proposal 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.

quant-ph↗

arXiv2021

Tequila: A platform for rapid development of quantum algorithms

Variational quantum algorithms are currently the most promising class of algorithms for deployment on near-term quantum computers. In contrast to classical algorithms, there are almost no standardized methods in quantum algorithmic development yet, and the field continues to evolve rapidly. As in classical computing, heuristics play a crucial role in the development of new quantum algorithms, resulting in high demand for flexible and reliable ways to implement, test, and share new ideas. Inspired by this demand, we introduce tequila, a development package for quantum algorithms in python, designed for fast and flexible implementation, prototyping, and deployment of novel quantum algorithms in electronic structure and other fields. Tequila operates with abstract expectation values which can be combined, transformed, differentiated, and optimized. On evaluation, the abstract data structures are compiled to run on state-of-the-art quantum simulators or interfaces.

quant-ph↗

arXiv2020

Data re-uploading for a universal quantum classifier

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 multiple data 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.

quant-ph↗

arXiv2019

Maximal Entanglement: Applications in Quantum Information and Particle Physics

In this PhD thesis, several aspects regarding maximal entanglement are analyzed. In the first chapter, Bell Inequalities are analyzed from an operational perspective as well as novel Bell inequalities are obtained together with their optimal settings for a maximal violation. Multipartite figures of merit, in particular, the hyperdeterminant, are the subject of the second chapter. They are applied to detect quantum phase transitions in several spin models. The third chapter focuses on the simulation of the XY model in a quantum computer. The quantum circuit obtained is tested in three current quantum devices. Quantum computers must be able to generate and hold highly entangled states in order to show a quantum advantage. This statement is analyzed in chapter four, where quantum circuits for maximally entangled states are presented. Finally, chapter five analyzes how maximal entanglement is generated at its fundamental level. Maximal entanglement constraints the QED vertex interaction and predicts a value for the weak mixing angle close to the experimental value.

quant-ph↗

arXiv2019

Quantum circuits for maximally entangled states

We design a series of quantum circuits that generate absolute maximally entangled (AME) states to benchmark a quantum computer. A relation between graph states and AME states can be exploited to optimize the structure of the circuits and minimize their depth. Furthermore, we find that most of the provided circuits obey majorization relations for every partition of the system, and at every step of the quantum computation. The rational for our approach is to benchmark quantum computers with maximal useful entanglement, which can be used to implement multipartite quantum protocols.

quant-ph↗

arXiv2018

Exact Ising model simulation on a quantum computer

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 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.

quant-ph↗

arXiv2018

Multipartite entanglement in spin chains and the Hyperdeterminant

A way to characterize multipartite entanglement in pure states of a spin chain with $n$ sites and local dimension $d$ is by means of the Cayley hyperdeterminant. The latter quantity is a polynomial constructed with the components of the wave function $ψ_{i_1, \dots, i_n}$ which is invariant under local unitary transformation. For spin 1/2 chains (i.e. $d=2$) with $n=2$ and $n=3$ sites, the hyperdeterminant coincides with the concurrence and the tangle respectively. In this paper we consider spin chains with $n=4$ sites where the hyperdeterminant is a polynomial of degree 24 containing around $2.8 \times 10^6$ terms. This huge object can be written in terms of more simple polynomials $S$ and $T$ of degrees 8 and 12 respectively. In this paper we compute $S$, $T$ and the hyperdeterminant for eigenstates of the following spin chain Hamiltonians: the transverse Ising model, the XXZ Heisenberg model and the Haldane-Shastry model. Those invariants are also computed for random states, the ground states of random matrix Hamiltonians in the Wigner-Dyson Gaussian ensembles and the quadripartite entangled states defined by Verstraete et al. in 2002. Finally, we propose a generalization of the hyperdeterminant to thermal density matrices. We observe how these polynomials are able to capture the phase transitions present in the models studied as well as a subclass of quadripartite entanglement present in the eigenstates.

quant-ph↗

arXiv2017

Maximal Entanglement in High Energy Physics

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) $s$-channel processes where the virtual photon carries equal overlaps of the helicities of the final state particles, and ii) the indistinguishable superposition between $t$- and $u$-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 reproducing QED. For $Z$-mediated weak scattering, the maximal entanglement principle leads to non-trivial predictions for the value of the weak mixing angle $θ_W$. Our results are a first step towards understanding the connections between maximal entanglement and the fundamental symmetries of high-energy physics.

hep-th↗