Abstract
The solving of linear systems provides a rich area to investigate the use of nearer-term, noisy, intermediate-scale quantum computers. In this work, we discuss hybrid quantum-classical algorithms for heavily skewed linear systems for overdetermined and underdetermined cases. Our input model is such that the columns or rows of the matrix defining the linear system are given via quantum circuits of polylogarithmic depth and the number of circuits is much smaller than their Hilbert space dimension. Our algorithms have polylogarithmic dependence on the dimension and polynomial dependence in other natural quantities. In addition, we present an algorithm for the special case of a factorized linear system with run time polylogarithmic in the respective dimensions. At the core of these algorithms is the Hadamard test and in the second part of this paper, we consider the optimization of the circuit depth of this test. Given an -qubit and -depth quantum circuit , we can approximate using qubits and -depth quantum circuits, where . In comparison, the standard implementation requires qubits and depth. Lattice geometries underlie recent quantum supremacy experiments with superconducting devices. We also optimize the Hadamard test for an lattice with and can approximate with qubits and -depth circuits. In comparison, the standard depth is in this setting. Both of our optimization methods are asymptotically tight in the case of one-depth quantum circuits .
- Received 22 October 2020
- Revised 24 February 2021
- Accepted 1 March 2021
DOI:https://doi.org/10.1103/PhysRevA.103.042422
©2021 American Physical Society