Quadratic Clifford expansion for efficient benchmarking and initialization of variational quantum algorithms
Kosuke Mitarai, Yasunari Suzuki, Wataru Mizukami, Yuya O. Nakagawa, Keisuke Fujii
Abstract
Variational quantum algorithms are considered to be appealing applications of near-term quantum computers. However, it has been unclear whether they can outperform classical algorithms or not. To reveal their limitations, we must seek a technique to benchmark them on large-scale problems. Here we propose a perturbative approach for efficient benchmarking of variational quantum algorithms. The proposed technique performs perturbative expansion of a circuit consisting of Clifford and Pauli rotation gates, which is enabled by exploiting the classical simulatability of Clifford circuits. Our method can be applied to a wide family of parameterized quantum circuits consisting of Clifford gates and single-qubit rotation gates. The approximate optimal parameter obtained by the method can also serve as an initial guess for further optimizations on a quantum device. As the first application of the method, we perform a benchmark of so-called hardware-efficient-type ansatzes when they are applied to the variational quantum eigensolver (VQE) of one-dimensional hydrogen chains up to ${\mathrm{H}}_{24}$, which corresponds to a 48-qubit system using a standard workstation. This is the largest scale benchmark of the VQE to the best of our knowledge and reveals the limitation of hardware-efficient-type ansatzes.