Engineering topics

Cerezo, Marco Vinicio Sebastian

Publications and source records attributed to Cerezo, Marco Vinicio Sebastian.

3 records

DOE OSTI2024

A Lie algebraic theory of barren plateaus for deep parameterized quantum circuits

Variational quantum computing schemes train a loss function by sending an initial state through a parametrized quantum circuit, and measuring the expectation value of some operator. Despite their promise, the trainability of these algorithms is hindered by barren plateaus (BPs) induced by the expressiveness of the circuit, the entanglement of the input data, the locality of the observable, or the presence of noise. Up to this point, these sources of BPs have been regarded as independent. In this work, we present a general Lie algebraic theory that provides an exact expression for the variance of the loss function of sufficiently deep parametrized quantum circuits, even in the presence of certain noise models. Our results allow us to understand under one framework all aforementioned sources of BPs. This theoretical leap resolves a standing conjecture about a connection between loss concentration and the dimension of the Lie algebra of the circuit’s generators.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2022

Inference-Based Quantum Sensing

In a standard quantum sensing (QS) task one aims at estimating an unknown parameter θ, encoded into an n-qubit probe state, via measurements of the system. The success of this task hinges on the ability to correlate changes in the parameter to changes in the system response $\mathscr{R}$⁡(θ) (i.e., changes in the measurement outcomes). For simple cases the form of $\mathscr{R}$⁡(θ) is known, but the same cannot be said for realistic scenarios, as no general closed-form expression exists. Here, in this Letter, we present an inference-based scheme for QS. We show that, for a general class of unitary families of encoding, $\mathscr{R}$⁡(θ) can be fully characterized by only measuring the system response at 2⁢n+1 parameters. This allows us to infer the value of an unknown parameter given the measured response, as well as to determine the sensitivity of the scheme, which characterizes its overall performance. We show that inference error is, with high probability, smaller than δ, if one measures the system response with a number of shots that scales only as Ω⁢(log 3 ⁡(n)/δ 2 ). Furthermore, the framework presented can be broadly applied as it remains valid for arbitrary probe states and measurement schemes, and, even holds in the presence of quantum noise. We also discuss how to extend our results beyond unitary families. Finally, to showcase our method we implement it for a QS task on real quantum hardware, and in numerical simulations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2022

Equivalence of quantum barren plateaus to cost concentration and narrow gorges

Optimizing parameterized quantum circuits (PQCs) is the leading approach to make use of near-term quantum computers. However, very little is known about the cost function landscape for PQCs, which hinders progress towards quantum-aware optimizers. In this work, we investigate the connection between three different landscape features that have been observed for PQCs: (1) exponentially vanishing gradients (called barren plateaus (BPs)), (2) exponential cost concentration about the mean, and (3) the exponential narrowness of minima (called narrow gorges). Here we analytically prove that these three phenomena occur together, i.e., when one occurs then so do the other two. A key implication of this result is that one can numerically diagnose BPs via cost differences rather than via the computationally more expensive gradients. More broadly, our work shows that quantum mechanics rules out certain cost landscapes (which otherwise would be mathematically possible), and hence our results could be interesting from a quantum foundations perspective.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗