28 November 2022 in Physical Review X
Exploiting near-term quantum computers and achieving practical value is a considerable and exciting challenge. Most prominent candidates as variational algorithms typically aim to find the ground state of a Hamiltonian by minimizing a single classical (energy) surface which is sampled from by a quantum computer. Here, we introduce a method we call CoVaR, an alternative means to exploit the power of variational circuits: We find eigenstates by finding joint roots of a polynomially growing number of properties of the quantum state as covariance functions between the Hamiltonian and an operator pool of our choice. The most remarkable feature of our CoVaR approach is that it allows us to fully exploit the extremely powerful classical shadow techniques; i.e., we simultaneously estimate a very large number of covariances. We randomly select covariances and estimate analytical derivatives at each iteration applying a stochastic Levenberg-Marquardt step via a large but tractable linear system of equations that we solve with a classical computer. We prove that the cost in quantum resources per iteration is comparable to a standard gradient estimation; however, we observe in numerical simulations a very significant improvement by many orders of magnitude in convergence speed. CoVaR is directly analogous to stochastic gradient-based optimizations of paramount importance to classical machine learning while we also offload significant but tractable work onto the classical processor. As we demonstrate numerically, the approach shares features with phase-estimation protocols that prepare eigenstates with a dominant initial fidelity contribution.
13 February 2025 in Physical Review A
We introduce a postprocessing technique for classical shadow measurement data that enhances the precision of ground state estimation through high-dimensional subspace expansion; the dimensionality is only limited by the amount of classical postprocessing resources rather than by quantum resources. Crucial steps of our approach are the efficient identification of useful observables from shadow data, followed by our regularized subspace expansion that is designed to be numerically stable even when using noisy data. We analytically investigate noise propagation within our method, and upper bound the statistical fluctuations due to the limited number of snapshots in classical shadows. In numerical simulations, our method can achieve a reduction in the energy estimation errors in many cases, sometimes by more than an order of magnitude. We also demonstrate that our performance improvements are robust against both coherent errors (bad initial state) and gate noise in the state-preparation circuits. Furthermore, performance is guaranteed to be at least as good—and in many cases better—than direct energy estimation without using additional quantum resources, and the approach is thus a very natural alternative for estimating ground state energies directly from classical shadow data.
16 June 2025 in Physical Review A
We explore the important task of applying a phase exp ( i f ( x ) ) to a computational basis state | x 〉 . The closely related task of rotating a target qubit by an angle depending on f ( x ) is also studied. Such operations are key in many quantum subroutines, and frequently f ( x ) can be well approximated by a piecewise function; examples range from the application of diagonal Hamiltonian terms (such as the Coulomb interaction) in grid-based many-body simulation to derivative pricing algorithms. Here, we exploit a parallelization of the piecewise approach so that all constituent elementary rotations are performed simultaneously, that is, we achieve a total rotation depth of one. Moreover, we explore the use of recursive catalyst “towers” to implement these elementary rotations efficiently. We find that strategies prioritizing execution speed can achieve circuit depth as low as O ( log 2 n + log 2 S ) for a register of n qubits and a piecewise approximation of S sections (presuming prior preparation of enabling resource states), albeit total qubit count then scales with S . In the limit of multiple repetitions of the oracle, we find that catalyst tower approaches have an O ( S n ) T -count. Published by the American Physical Society 2025