5 November 2024 in npj Unconventional Computing
Linear algebra is central to many algorithms in engineering, science, and machine learning; hence, accelerating it would have tremendous economic impact. Quantum computing has been proposed for this purpose, although the resource requirements are far beyond current technological capabilities. We consider an alternative physics-based computing paradigm based on classical thermodynamics, to provide a near-term approach to accelerating linear algebra. At first sight, thermodynamics and linear algebra seem to be unrelated fields. Here, we connect solving linear algebra problems to sampling from the thermodynamic equilibrium distribution of a system of coupled harmonic oscillators. We present simple thermodynamic algorithms for solving linear systems of equations, computing matrix inverses, and computing matrix determinants. Under reasonable assumptions, we rigorously establish asymptotic speedups for our algorithms, relative to digital methods, that scale linearly in matrix dimension. Our algorithms exploit thermodynamic principles like ergodicity, entropy, and equilibration, highlighting the deep connection between these two seemingly distinct fields, and opening up algebraic applications for thermodynamic computers.
9 July 2021 in Quantum Science and Technology
Error mitigation is likely to be key in obtaining near term quantum advantage. In this work we present one of the first implementations of several Clifford data regression (CDR) based methods which are used to mitigate the effect of noise in real quantum data. We explore the dynamics of the 1D Ising model with transverse and longitudinal magnetic fields, highlighting signatures of confinement. We find in general CDR based techniques are advantageous in comparison with zero-noise extrapolation and obtain quantitative agreement with exact results for systems of nine qubits with circuit depths of up to 176, involving hundreds of CNOT gates. This is the largest systems investigated so far in a study of this type. We also investigate the two-point correlation function and find the effect of noise on this more complicated observable can be mitigated using Clifford quantum circuit data highlighting the utility of these methods.
7 September 2022 in PRX Quantum
Principal component analysis (PCA) is a dimensionality reduction method in data analysis that involves diagonalizing the covariance matrix of the dataset. Recently, quantum algorithms have been formulated for PCA based on diagonalizing a density matrix. These algorithms assume that the covariance matrix can be encoded in a density matrix, but a concrete protocol for this encoding has been lacking. Our work aims to address this gap. Assuming amplitude encoding of the data, with the data given by the ensemble , then one can easily prepare the ensemble average density matrix . We first show that is precisely the covariance matrix whenever the dataset is centered. For quantum datasets, we exploit global phase symmetry to argue that there always exists a centered dataset consistent with , and hence can always be interpreted as a covariance matrix. This provides a simple means for preparing the covariance matrix for arbitrary quantum datasets or centered classical datasets. For uncentered classical datasets, our method is so-called “PCA without centering,” which we interpret as PCA on a symmetrized dataset. We argue that this closely corresponds to standard PCA, and we derive equations and inequalities that bound the deviation of the spectrum obtained with our method from that of standard PCA. We numerically illustrate our method for the Modified National Institute of Standards and Technology (MNIST) handwritten digit dataset. We also argue that PCA on quantum datasets is natural and meaningful, and we numerically implement our method for molecular ground-state datasets.
31 October 2022 in Physical Review Letters
In a standard quantum sensing (QS) task one aims at estimating an unknown parameter , encoded into an -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 (i.e., changes in the measurement outcomes). For simple cases the form of is known, but the same cannot be said for realistic scenarios, as no general closed-form expression exists. In this Letter, we present an inference-based scheme for QS. We show that, for a general class of unitary families of encoding, can be fully characterized by only measuring the system response at 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 . 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.
1 December 2023 in Journal of Physics: Conference Series
The Bethe ansatz is an analytical method to solve exactly solvable models in quantum mechanics. It has been shown that the states of the Bethe ansatz can be prepared by a deterministic quantum circuit whose quantum gates were determined numerically. We report our progress in recasting the Bethe ansatz as a deterministic quantum circuit. We present the analytical expressions of the quantum gates. Formulae rely upon diagrammatic rules that define the wave functions of the Bethe ansatz by matrix product states. Based on the analytical expressions, we prove the unitarity of the quantum gates. We use our results to clarify on the equivalence between the coordinate and algebraic Bethe ansatze in light of matrix-product states.