arXiv:2610.00521
First-quantized quantum simulation with non-local potentials by matrix-product-state encoding
Kazuki Tsuoka, Taichi Kosugi, Masari Watanabe, Hirofumi Nishi, Yu-ichiro Matsushita
Abstract
Quantum simulations based on first-quantized approaches can offer lower space and gate complexities than second-quantized approaches. The gate requirements for these simulations can be further reduced by employing pseudopotentials, a technique widely used in classical quantum chemistry calculations to decrease the number of simulated electrons. However, implementing pseudopotentials in quantum circuits remains challenging due to their non-local nature. In this study, we proposed a method to efficiently implement non-local potentials using matrix product state (MPS) encoding. MPS encoding allows us to efficiently implement a Trotter step operator with a circuit depth of $O(\mathrm{deg}(V_{\mathrm{loc}}) n^{\mathrm{deg}(V_{\mathrm{loc}})} + 8Lnn_{\mathrm{atom}}χ^2 + 2n^2)$, where $\mathrm{deg}(V_{\mathrm{loc}})$ is the degree of the polynomial local potential, $n_{\mathrm{atom}}$ is the number of atoms in the system, $L$ is the maximum number of projector functions across all atoms, and $n$ is the number of qubits used to represent the binary-encoded wave function in one-dimensional space. We demonstrated the effectiveness of this approach by applying it to a model of the ionization of a one-dimensional hydrogen atom driven by an ultrashort laser pulse. Our results showed that MPS encoding significantly reduces the required circuit depth compared to a direct unitary decomposition, providing a pathway for practical first-quantized simulations.
AI Summary
The paper addresses implementing non-local pseudopotentials in first-quantized quantum simulations, where the potential is not diagonal in position or momentum space. It represents separable projector functions as matrix product states (MPS), then implements each projector exponential by conjugating a phase on $|0\rangle^{\otimes n}$ with an MPS state-preparation circuit. Translation circuits allow origin-centered projector preparations to be reused at different atomic positions. For orthonormal projectors with no overlap between atoms, and a polynomial local potential of degree $M$, the derived circuit depth per first-order Trotter step is $O(Mn^M+8Ln n_{\mathrm{atom}}\chi^2+2n^2)$, where $n$ counts grid qubits per spatial dimension, $L$ bounds the number of projectors per atom, and $\chi$ is their maximum MPS bond dimension. The construction uses established MPS encoding, controlled-phase, and Fourier-transform circuits. Numerical tests consider laser-driven ionization of a one-dimensional, single-electron hydrogen model with rank-one or rank-two separable potentials. For the Gaussian–polynomial projector functions, bond dimensions around 8–9 reach numerical precision, with saturation tested through 19 grid qubits. Ten-qubit circuit simulations over 10,000 time steps compare MPS truncations against split-operator evolution. At seven qubits, a rank-one, $\chi=8$ implementation has depth 1,747 versus 23,775 for dense-unitary synthesis. The demonstrated system is restricted to one dimension and one electron; effectiveness for three-dimensional multi-electron pseudopotentials is suggested rather than tested. The depth bound depends on projector compressibility and the stated orthogonality and polynomial-local-potential assumptions.
Error found: The exact factorization of the non-local propagator relies on mutually orthogonal projectors, an assumption stated in the body but omitted from the abstract; overlapping projectors generally require additional splitting. The evidence for small projector MPS bond dimension covers particular one-dimensional polynomial-times-Gaussian functions, so efficient scaling for general non-local pseudopotentials remains unestablished. The reported circuit-depth reduction uses dense-unitary synthesis as its baseline and therefore does not isolate the improvement due to MPS compression relative to other separable-projector implementations.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.