arXiv subjects

Stefano Polla

Publications and source records attributed to Stefano Polla.

11 recordsLinked to original sources

arXiv2026

Accurate ground state energy estimation with noise and imperfect state preparation

We introduce a classical estimator for the post-processing of quantum phase estimation (QPE) data when a single target phase is isolated within a known interval, as is typical of ground state energy estimation of gapped systems. Our estimator filters the QPE signal within this promise region and recovers the phase through a moment-projection routine, which is robust to both external spurious phases and experimental noise. In the noiseless case this achieves an exponential suppression of bias with respect to a naive mean estimator. In the presence of global depolarizing noise the bias is exponentially small in the circuit depth $t$, and the variance is $O(t^{-2}F^{-2})$ for circuit fidelity $F$. This improves by a factor of $t^2$ over a naive shifted-and-rescaled-mean approach. To mitigate realistic circuit-level noise, we combine our method with the explicit unbiasing scheme described in [Dutkiewicz et al., 2025]. This yields an overhead interpolating between the $F^{-4}$ scaling typical of explicitly unbiased error mitigation and a reduced $F^{-2}$ scaling when the noise samples fall outside the promise interval. We validate our estimators on a small-scale simulation of the Ising model, observing better-than-expected performance for a global depolarizing noise approximation. This robustness to both multiple eigenvalues and realistic noise makes limited-depth phase estimation practical for early fault tolerant quantum experiments.

quant-ph↗

arXiv2026

Optimizing and Comparing Quantum Resources of Statistical Phase Estimation and Krylov Subspace Diagonalization

We develop a framework that enables direct and meaningful comparison of two early fault-tolerant methods for the computation of eigenenergies, namely \gls{qksd} and \gls{spe}, within which both methods use expectation values of Chebyshev polynomials of the Hamiltonian as input. For \gls{qksd} we propose methods for optimally distributing shots and ensuring sufficient non-linearity of states spanning the Krylov space. For \gls{spe} we improve rigorous error-bounds, achieving roughly a factor $2/3$ reduction of circuit depth. We provide insights into the scalability of and the practical realization of these methods by computing the maximum Chebyshev degree, linearly related to circuit depth, and the respective number of repetitions required for the simulation of molecules with active spaces up to 54 electrons in 36 orbitals by leveraging \gls{mps}/\gls{dmrg}.

quant-ph↗

arXiv2025

Learning Minimal Representations of Fermionic Ground States

We introduce an unsupervised machine-learning framework that discovers optimally compressed representations of quantum many-body ground states. Using an autoencoder neural network architecture on data from $L$-site Fermi-Hubbard models, we identify minimal latent spaces with a sharp reconstruction quality threshold at $L-1$ latent dimensions, matching the system's intrinsic degrees of freedom. We demonstrate the use of the trained decoder as a differentiable variational ansatz to minimize energy directly within the latent space. Crucially, this approach circumvents the $N$-representability problem, as the learned manifold implicitly restricts the optimization to physically valid quantum states.

quant-ph↗

arXiv2024

Error mitigation and circuit division for early fault-tolerant quantum phase estimation

As fully fault-tolerant quantum computers capable of solving useful problems remain a distant goal, we anticipate an era of "early fault tolerance" where limited error correction is available. We propose a framework for designing early fault-tolerant algorithms by trading between error correction overhead and residual logical noise, and apply it to quantum phase estimation (QPE). We develop a quantum-Fourier-transform (QFT)-based QPE technique that is robust to global depolarising noise and outperforms the previous state of the art at low and moderate noise rates. We further introduce the Explicitly Unbiased Maximum Likelihood Estimation (EUMLE), a data processing technique that mitigates arbitrary errors in QFT-based QPE schemes. EUMLE provides consistent, asymptotically normal error-mitigated estimates, addressing the open problem of extending error mitigation beyond expectation value estimation. Applying this scheme to the ground state problem of the two-dimensional Hubbard model and various molecular Hamiltonians, we find we can roughly halve the number of physical qubits with a $\sim 10\times$ wall-clock time overhead, but further reduction causes a steep runtime increase. This work provides an end-to-end analysis of early fault-tolerance cost reductions and space-time trade-offs, and identifies which areas can be improved in the future.

quant-ph↗

arXiv2024

Learning Density Functionals from Noisy Quantum Data

The search for useful applications of noisy intermediate-scale quantum (NISQ) devices in quantum simulation has been hindered by their intrinsic noise and the high costs associated with achieving high accuracy. A promising approach to finding utility despite these challenges involves using quantum devices to generate training data for classical machine learning (ML) models. In this study, we explore the use of noisy data generated by quantum algorithms in training an ML model to learn a density functional for the Fermi-Hubbard model. We benchmark various ML models against exact solutions, demonstrating that a neural-network ML model can successfully generalize from small datasets subject to noise typical of NISQ algorithms. The learning procedure can effectively filter out unbiased sampling noise, resulting in a trained model that outperforms any individual training data point. Conversely, when trained on data with expressibility and optimization error typical of the variational quantum eigensolver, the model replicates the biases present in the training data. The trained models can be applied to solving new problem instances in a Kohn-Sham-like density optimization scheme, benefiting from automatic differentiability and achieving reasonably accurate solutions on most problem instances. Our findings suggest a promising pathway for leveraging NISQ devices in practical quantum simulations, highlighting both the potential benefits and the challenges that need to be addressed for successful integration of quantum computing and ML techniques.

quant-ph↗

arXiv2024

FragPT2: Multi-Fragment Wavefunction Embedding with Perturbative Interactions

Embedding techniques allow the efficient description of correlations within localized fragments of large molecular systems, while accounting for their environment at a lower level of theory. We introduce FragPT2: a novel embedding framework that addresses multiple interacting active fragments. Fragments are assigned separate active spaces, constructed by localizing canonical molecular orbitals. Each fragment is then solved with a multi-reference method, self-consistently embedded in the mean field from other fragments. Finally, inter-fragment correlations are reintroduced through multi-reference perturbation theory. Our framework provides an exhaustive classification of inter-fragment interaction terms, offering a tool to analyze the relative importance of various processes such as dispersion, charge transfer, and spin exchange. We benchmark FragPT2 on challenging test systems, including \ce{N_2} dimers, multiple aromatic dimers, and butadiene. We demonstrate that our method can be succesful even for fragments defined by cutting through a covalent bond.

physics.chem-ph↗

arXiv2023

Virtual mitigation of coherent non-adiabatic transitions by echo verification

Transitions out of the ground space limit the performance of quantum adiabatic algorithms, while hardware imperfections impose stringent limitations on the circuit depth. We propose an adiabatic echo verification protocol which mitigates both coherent and incoherent errors, arising from non-adiabatic transitions and hardware noise, respectively. Quasi-adiabatically evolving forward and backwards allows for an echo-verified measurement of any observable. In addition to mitigating hardware noise, our method uses positive-time dynamics only. Crucially, the estimator bias of the observable is reduced when compared to standard adiabatic preparation, achieving up to a quadratic improvement.

quant-ph↗

arXiv2023

A hybrid quantum algorithm to detect conical intersections

Conical intersections are topologically protected crossings between the potential energy surfaces of a molecular Hamiltonian, known to play an important role in chemical processes such as photoisomerization and non-radiative relaxation. They are characterized by a non-zero Berry phase, which is a topological invariant defined on a closed path in atomic coordinate space, taking the value $\pi$ when the path encircles the intersection manifold. In this work, we show that for real molecular Hamiltonians, the Berry phase can be obtained by tracing a local optimum of a variational ansatz along the chosen path and estimating the overlap between the initial and final state with a control-free Hadamard test. Moreover, by discretizing the path into $N$ points, we can use $N$ single Newton-Raphson steps to update our state non-variationally. Finally, since the Berry phase can only take two discrete values (0 or $\pi$), our procedure succeeds even for a cumulative error bounded by a constant; this allows us to bound the total sampling cost and to readily verify the success of the procedure. We demonstrate numerically the application of our algorithm on small toy models of the formaldimine molecule (\ce{H2C=NH}).

quant-ph↗

arXiv2022

Optimizing the information extracted by a single qubit measurement

We consider a quantum computation that only extracts one bit of information per $N$-qubit quantum state preparation. This is relevant for error mitigation schemes where the remainder of the system is measured to detect errors. We optimize the estimation of the expectation value of an operator by its linear decomposition into bitwise-measurable terms. We prove that optimal decompositions must be in terms of reflections with eigenvalues $\pm1$. We find the optimal reflection decomposition of a fast-forwardable operator, and show a numerical improvement over a simple Pauli decomposition by a factor $N^{0.7}$

quant-ph↗

arXiv2020

Error mitigation via verified phase estimation

The accumulation of noise in quantum computers is the dominant issue stymieing the push of quantum algorithms beyond their classical counterparts. We do not expect to be able to afford the overhead required for quantum error correction in the next decade, so in the meantime we must rely on low-cost, unscalable error mitigation techniques to bring quantum computing to its full potential. This paper presents a new error mitigation technique based on quantum phase estimation that can also reduce errors in expectation value estimation (e.g., for variational algorithms). The general idea is to apply phase estimation while effectively post-selecting for the system register to be in the starting state, which allows us to catch and discard errors which knock us away from there. We refer to this technique as "verified phase estimation" (VPE) and show that it can be adapted to function without the use of control qubits in order to simplify the control circuitry for near-term implementations. Using VPE, we demonstrate the estimation of expectation values on numerical simulations of intermediate scale quantum circuits with multiple orders of magnitude improvement over unmitigated estimation at near-term error rates (even after accounting for the additional complexity of phase estimation). Our numerical results suggest that VPE can mitigate against any single errors that might occur; i.e., the error in the estimated expectation values often scale as O(p^2), where p is the probability of an error occurring at any point in the circuit. This property, combined with robustness to sampling noise reveal VPE as a practical technique for mitigating errors in near-term quantum experiments.

quant-ph↗

arXiv2019

Quantum digital cooling

We introduce a method for digital preparation of ground states of simulated Hamiltonians, inspired by cooling in nature and adapted to leverage the capabilities of digital quantum hardware. The cold bath is simulated by a single ancillary qubit, which is reset periodically and coupled to the system non-perturbatively. Studying this cooling method on a 1-qubit system toy model, we optimize two cooling protocols based on weak-coupling and strong-coupling approaches. Extending the insight from the 1-qubit system model, we develop two scalable protocols for larger systems. The LogSweep protocol extends the weak-coupling approach by sweeping energies to resonantly match any targeted transition. We test LogSweep on the 1D tranverse-field Ising model, demonstrating approximate ground state preparation with an error that can be made polynomially small in the computation time for all three phases of the system. The BangBang protocol extends the strong-coupling approach, and exploits a heuristics for local Hamiltonians to maximise the probability of de-exciting system transitions in the shortest possible time. Although this protocol does not promise long-time convergence, it allows for a rapid cooling to an approximation of the ground state, making this protocol appealing for near-term demonstrations.

quant-ph↗