We present a systematic quantum algorithm, which integrates both the hadronic state preparation and the evaluation of real-time light-front correlators, to study parton distribution functions (PDFs). As a proof of concept, we demonstrate the first direct simulation of the PDFs in the dimensional Nambu-Jona-Lasinio model. We show the results obtained by exact diagonalization and by quantum computation using classical hardware. The agreement between these two distinct methods and the qualitative consistency with QCD PDFs validate the proposed quantum algorithm. Our work suggests the encouraging prospects of calculating QCD PDFs on current and near-term quantum devices. The presented quantum algorithm is expected to have many applications in high energy particle and nuclear physics.
Confinement of quarks due to the strong interaction and the deconfinement at high temperatures and high densities are a basic paradigm for understanding the nuclear matter. Their simulation, however, is very challenging for classical computers due to the sign problem of solving equilibrium states of finite-temperature quantum chromodynamical systems at finite density. In this paper, we propose a variational approach, using the lattice Schwinger model, to simulate the confinement or deconfinement by investigating the string tension. We adopt an ansatz that the string tension can be evaluated without referring to quantum protocols for measuring the entropy in the free energy. Results of numeral simulation show that the string tension decreases both along the increasing of the temperature and the chemical potential, which can be an analog of the phase diagram of QCD. Through numerical simulations on the classical computer, we demonstrate the potential of exploiting near-term quantum computers for investigating the phase diagram of finite-temperature and finite-density nuclear matters.
A variational quantum eigensolver (VQE) optimizes parametrized eigenstates of a Hamiltonian on a quantum processor by updating parameters with a classical computer. Such a hybrid quantum-classical optimization serves as a practical way to leverage classical algorithms in exploiting the power of near-term quantum devices. Here, aiming to solve a group of Hamiltonians more efficiently, we develop an extension of the conventional VQE. A snake algorithm is incorporated to couple optimizing processes for VQEs of different Hamiltonians by gradient descent. Such a so-called collective VQE (CVQE) is applied to simulate molecules with varied bond lengths for demonstration. Numeral simulations show that the CVQE exhibits clear collective behavior in the optimization process of updating parameters. Remarkably, the CVQE tends to avoid a single VQE task to be trapped in the local minimum. The collective optimization utilizes intrinsic relations between related tasks and may inspire advanced hybrid quantum-classical algorithms for solving practical problems with current quantum technologies.
Filter methods realize a projection from a superposed quantum state onto a target state, which can be efficient if two states have sufficient overlap. Here we propose a quantum Gaussian filter (QGF) with the filter operator being a Gaussian function of the system Hamiltonian. A hybrid quantum-classical algorithm feasible on near-term quantum computers is developed, which implements the quantum Gaussian filter as a linear combination of Hamiltonian evolution at various times. Remarkably, the linear combination coefficients are determined classically and can be optimized in the postprocessing procedure. Compared to the existing filter algorithms whose coefficients are given in advance, our method is more flexible in practice under given quantum resources with the help of postprocessing on classical computers. We demonstrate the quantum Gaussian filter algorithm for the quantum Ising model with numeral simulations under noises. We also propose an alternative full quantum approach that implements a QGF with an ancillary continuous-variable mode.
Solving non-Hermitian quantum many-body systems on a quantum computer by minimizing the variational energy is challenging as the energy can be complex. Here, we propose a variational quantum algorithm for solving the non-Hermitian Hamiltonian by minimizing a type of energy variance, where zero variance can naturally determine the eigenvalues and the associated left and right eigenstates. Moreover, the energy is set as a parameter in the cost function and can be tuned to scan the whole spectrum efficiently by using a two-step optimization scheme. Through numerical simulations, we demonstrate the algorithm for preparing the left and right eigenstates, verifying the biorthogonal relations, as well as evaluating the observables. We also investigate the impact of quantum noise on our algorithm and show that its performance can be largely improved using error mitigation techniques. Therefore, our work suggests an avenue for solving non-Hermitian quantum many-body systems with variational quantum algorithms on near-term noisy quantum computers.