Quantum algorithms are touted as a way around some classically intractable problems such as the simulation of quantum mechanics. At the end of all quantum algorithms is a quantum measurement whereby classical data is extracted and utilized. In fact, many of the modern hybrid-classical approaches are essentially quantum measurements of states with short quantum circuit descriptions. Here, we compare and examine three methods of extracting the time-dependent one-particle probability density from a quantum simulation: direct Z-measurement, Bayesian phase estimation, and harmonic inversion. We have tested these methods in the context of the potential inversion problem of time-dependent density functional theory. Our test results suggest that direct measurement is the preferable method. We also highlight areas where the other two methods may be useful and report on tests using Rigetti's quantum virtual device. This study provides a starting point for imminent applications of quantum computing.
Quantum algorithms are touted as a way around some classically intractable problems such as the simulation of quantum mechanics. At the end of all quantum algorithms is a quantum measurement whereby classical data is extracted and utilized. In fact, many of the modern hybrid-classical approaches are essentially quantum measurements of states with short quantum circuit descriptions. Here, we compare and examine three methods of extracting the time-dependent one-particle probability density from a quantum simulation: direct Z-measurement, Bayesian phase estimation, and harmonic inversion. We have tested these methods in the context of the potential inversion problem of time-dependent density functional theory. Our test results suggest that direct measurement is the preferable method. We also highlight areas where the other two methods may be useful and report on tests using Rigetti's quantum virtual device. This study provides a starting point for imminent applications of quantum computing.
Simulating the dynamics of complex quantum systems is a central application of quantum devices. Here we propose leveraging the power of measurements to simulate short-time quantum dynamics of physically prepared quantum states in classical postprocessing using a truncated Taylor series approach. While limited to short simulation times, our hybrid quantum-classical method is equipped with rigorous error bounds. It is extendable to estimate low-order Taylor approximations of smooth time-dependent functions of tractable linear combinations of measurable operators. These insights can be made use of in the context of Hamiltonian learning and device verification, short-time imaginary-time evolution, or the application of intractable operations to subuniversal quantum simulators in classical postprocessing.
Quantum algorithms hold the promise of fundamentally changing the way we approach problems in physics, chemistry, computer science, and engineering. This thesis explores new provably efficient quantum algorithms for three fundamental directions in quantum computing: simulation, optimization, and estimation. Together, our results in each of these directions contribute to the broader effort of making quantum computation a practical tool for science and engineering. First, in the area of quantum simulation, we propose Wave Matrix Lindbladization, a set of algorithms that extend the philosophy of density matrix exponentiation to Lindbladian dynamics by working with program-state encodings of Lindblad operators. Specifically, when these operators are local, we show that these algorithms are provably efficient by analyzing their sample and gate complexities. Second, for optimization, we study quantum Boltzmann machines as a variational ansatz for ground-state energy estimation, proving efficient gradient estimation and convergence to approximate stationary points. We also propose hybrid quantum-classical algorithms for semidefinite programming, establish rigorous convergence guarantees, and validate their robustness to noise through numerical simulations for applications such as MaxCut. Finally, for estimation, we develop the tapered quantum phase estimation algorithm, a coherent phase estimation method that leverages taper/window functions from signal processing to reach optimal query complexity without relying on expensive coherent median techniques, and we provide error guarantees in both asymptotic and non-asymptotic regimes along with efficient taper state preparation.
The tomographic reconstruction of the state of a quantum-mechanical system is an essential component in the development of quantum technologies. We present an overview of different tomographic methods for determining the quantum-mechanical density matrix of a single qubit: (scaled) direct inversion, maximum likelihood estimation (MLE), minimum Fisher information distance and Bayesian mean estimation (BME). We discuss the different prior densities in the space of density matrices, on which both MLE and BME depend, as well as ways of including experimental errors and of estimating tomography errors. As a measure of the accuracy of these methods, we average the trace distance between a given density matrix and the tomographic density matrices it can give rise to through experimental measurements. We find that the BME provides the most accurate estimate of the density matrix, and suggest using either the pure-state prior, if the system is known to be in a rather pure state, or the Bures prior if any state is possible. The MLE is found to be slightly less accurate. We comment on the extrapolation of these results to larger systems.
In recent years, Bayesian methods have been proposed as a solution to a wide range of issues in quantum state and process tomography. State-of-the-art Bayesian tomography solutions suffer from three problems: numerical intractability, a lack of informative prior distributions, and an inability to track time-dependent processes. Here, we address all three problems. First, we use modern statistical methods, as pioneered by Huszár and Houlsby (2012 Phys. Rev. A 85 052120 ) and by Ferrie (2014 New J. Phys. 16 093035 ), to make Bayesian tomography numerically tractable. Our approach allows for practical computation of Bayesian point and region estimators for quantum states and channels. Second, we propose the first priors on quantum states and channels that allow for including useful experimental insight. Finally, we develop a method that allows tracking of time-dependent states and estimates the drift and diffusion processes affecting a state. We provide source code and animated visual examples for our methods.
Quantum computing offers potential advantages for solving partial differential equations (PDEs). However, most existing quantum PDE solvers primarily focus on preparing quantum states for solutions, while the efficient recovery of classical information from these states remains less explored. Motivated by the readout limitation, we propose a quantum-classical hybrid framework for Bayesian PDE inversion problems: The quantum processor evolves the PDE and evaluate the loss function with sampling noises, while the classical computer tunes the hyper-parameters in the Gaussian Process Regression to explore the next trial candidate. To match the quantum solvers for linear and semi-linear autonomous evolution PDEs, we suggest to use a normalized quantum-state loss as the data-misfit function and evaluate the new misfit by combining quantum PDE solvers with the Hadamard test, thereby allowing us to extract useful classical information using only a limited number of quantum state copies without reconstructing the full solution vector. The analysis of error propagation and overall complexity of loss evaluation under a prescribed accuracy shows that the new data-misfit function outperforms the conventional L2-loss under quantum measurements. Quantum circuit simulations of 1D and 2D linear convection diffusion equations under approximate and finite sampling loss evaluations, together with classical numerical experiments on a nonlinear forced viscous Burgers equation, demonstrate the feasibility of the proposed approach for parameter inversion even when the loss evaluations are affected by sampling noise. This framework may provide a viable quantum-assisted scheme for PDE-based inverse problems and elucidate the potential of quantum PDE algorithms in addressing a complete quantum-to-end optimization stack.
We show that chemically accurate potential energy surfaces (PESs) can be generated from quantum computers by measuring only the density along an adiabatic transition between different molecular geometries. In lieu of using phase estimation, the energy is evaluated by performing line-integration using the inverted real-space time-dependent density functional theory Kohn-Sham (KS) potential obtained from the geometry-varying densities of the full wave function. The accuracy of this method depends on the validity of the adiabatic evolution itself and the potential inversion process (which is theoretically exact but can be numerically unstable), whereas the total evolution time is the defining factor for the precision of phase estimation. We examine the method with a one-dimensional system of two electrons for both the ground and first triplet states in first quantization, as well as the ground state of three- and four-electron systems in second quantization. It is shown that few accurate measurements can be utilized to obtain chemical accuracy across the full potential energy curve, with a shorter propagation time than may be required using phase estimation for a similar accuracy. We also show that an accurate potential energy curve can be calculated by making many imprecise density measurements (using a few shots) along the time evolution and smoothing the resulting density evolution. Finally, it is important to note that the method is able to classically provide a check of its own accuracy by comparing the density resulting from a time-independent KS calculation using the inverted potential with the measured density. This can be used to determine whether longer adiabatic evolution times are required to satisfy the adiabatic theorem.