Subspace-search variational quantum eigensolver for excited states

Abstract

The variational quantum eigensolver (VQE), a variational algorithm to obtain an approximated ground state of a given Hamiltonian, is an appealing application of near-term quantum computers. To extend the framework to excited states, we here propose an algorithm, the subspace-search variational quantum eigensolver (SSVQE). This algorithm searches a low-energy subspace by supplying orthogonal input states to the variational ansatz and relies on the unitarity of transformations to ensure the orthogonality of the output states. The kth excited state is obtained as the highest-energy state in the low-energy subspace. The proposed algorithm consists only of two parameter optimization procedures and does not employ any ancilla qubits. The avoidance of the estimation of the inner product and the small number of procedures required are considerable improvements from the existing proposals for excited states, making our proposal an improved near-term quantum algorithm. We further generalize the SSVQE to obtain all excited states up to the kth by only a single optimization procedure. From numerical simulations, we verify the proposed algorithms. This work extends the applicable domain of the VQE to excited states and their related properties as a transition amplitude without sacrificing any of its feasibility. Moreover, the proposed variational subspace search, which generalizes the state search problem to the search of a unitary mapping to a specific subspace, itself would be useful for various quantum information processing methods such as finding a protected subspace or a good variational quantum error correction code.