Subspace-search variational quantum eigensolver for excited states

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. The original work [Peruzzo et al.; Nat. Commun.; 5, 4213 (2014)] focused only on finding a ground state, whereas the excited states can also induce interesting phenomena in molecules and materials. Calculating excited states is, in general, a more difficult task than finding ground states for classical 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 output states. The k-th 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 disuse of the ancilla qubits is a great improvement from the existing proposals for excited states, which have utilized the swap test, making our proposal a truly near-term quantum algorithm. We further generalize the SSVQE to obtain all excited states up to the k-th by only single optimization procedure. From numerical simulations, we verify the proposed algorithms. This work greatly extends the applicable domain of the VQE to excited states and their related properties like a transition amplitude without sacrificing any feasibility of it.


Quantum chemistryNISQ deviceCondensed matter physics
by K. M. Nakanishi, K. Mitarai and K. Fujii

Generalization of the output of variational quantum eigensolver by parameter interpolation with low-depth ansatz

The variational quantum eigensolver (VQE) is an attracting possible application of near-term quantum computers. Originally, the aim of the VQE is to find a ground state for a given specific Hamiltonian. It is achieved by minimizing the expectation value of the Hamiltonian with respect to an ansatz state by tuning parameters θ on a quantum circuit which constructs the ansatz. Here we consider an extended problem of the VQE, namely, our objective in this work is to “generalize” the optimized output of the VQE just like machine learning. We aim to find ground states for a given set of Hamiltonians {H(x)}, where x is a parameter which specifies the quantum system under consideration, such as geometries of atoms of a molecule. Our approach is to train the circuit on the small number of x’s. Specifically, we employ the interpolation of the optimal circuit parameter determined at different x’s, assuming that the circuit parameter θ has simple dependency on a hidden parameter x as θ(x). We show by numerical simulations that, using an ansatz which we call the Hamiltonian-alternating ansatz, the optimal circuit parameters can be interpolated to give near-optimal ground states in between the trained x’s. The proposed method can greatly reduce, on a rough estimation by a few orders of magnitude, the time required to obtain ground states for different Hamiltonians by the VQE. Once generalized, the ansatz circuit can predict the ground state without optimizing the circuit parameter θ in a certain range of x.


Quantum chemistryNISQ deviceCondensed matter physics
by K. Mitarai, T. Yan and K. Fujii

Boosting computational power through spatial multiplexing in quantum reservoir computing

Quantum reservoir computing provides a framework for exploiting the natural dynamics of quantum systems as a computational resource. It can implement real-time signal processing and solve temporal machine learning problems in general, which requires memory and nonlinear mapping of the recent input stream using the quantum dynamics in computational supremacy region, where the classical simulation of the system is intractable. A nuclear magnetic resonance spin-ensemble system is one of the realistic candidates for such physical implementations, which is currently available in laboratories. In this paper, considering these realistic experimental constraints for implementing the framework, we introduce a scheme, which we call a spatial multiplexing technique, to effectively boost the computational power of the platform. This technique exploits disjoint dynamics, which originate from multiple different quantum systems driven by common input streams in parallel. Accordingly, unlike designing a single large quantum system to increase the number of qubits for computational nodes, it is possible to prepare a huge number of qubits from multiple but small quantum systems, which are operationally easy to handle in laboratory experiments. We numerically demonstrate the effectiveness of the technique using several benchmark tasks and quantitatively investigate its specifications, range of validity, and limitations in detail.


Quantum machine learning
by K. Nakajima, K. Fujii, M. Negoro, K. Mitarai and M. Kitagawa

Quantum Circuit Learning

We propose a classical-quantum hybrid algorithm for machine learning on near-term quantum processors, which we call quantum circuit learning. A quantum circuit driven by our framework learns a given task by tuning parameters implemented on it. The iterative optimization of the parameters allows us to circumvent the high-depth circuit. Theoretical investigation shows that a quantum circuit can approximate nonlinear functions, which is further confirmed by numerical simulations. Hybridizing a low-depth quantum circuit and a classical computer for machine learning, the proposed framework paves the way toward applications of near-term quantum devices for quantum machine learning.


Quantum machine learningNISQ device
by K. Mitarai, M. Negoro, M. Kitagawa and K. Fujii