2016/01/24 by Andrew Sornborger, Sornborger, Andrew T., P. C. Stancil +3
Computer Science · Physics and Astronomy · #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Physics (quant-ph) #Quantum and electron transport phenomena
paper · pdf · doi:10.48550/arxiv.1601.06419
openalex publication_date 2016/01/24 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/28
Quantum particle simulations have largely been based on time-independent, split-operator schemes in which kinetic and potential operators are interwoven to provide accurate approximations to system dynamics. These simulations can be very expensive in terms of the number of gates required, although individual cases, such as tunneling, have been found where prethreshold simulations are possible. By prethreshold, we mean a quantum computation or simulation with an existing architecture and not requiring error correction. In the case of molecular collisions, switching to a time-dependent formulation can reduce the system dimensionality significantly and provide an opportunity for pre-threshold simulation. Here, we study the efficiency of gate-based quantum simulation of a set of molecular collisions of increasing complexity. We show that prethreshold quantum simulation of such systems is feasible up to Hilbert space dimension 8, but beyond that error correction would be required.