Improving Schr\"odinger Equation Implementations with Gray Code for Adiabatic Quantum Computers
Chia Cheng Chang, Kenneth S. McElvain, Ermal Rrapaj, Yantao Wu

TL;DR
This paper introduces a novel encoding of the Schrödinger equation for adiabatic quantum computing using Gray codes, reducing model complexity and analyzing the time complexity of adiabatic evolution.
Contribution
It presents a new formulation of the Schrödinger equation with Gray code encodings, linking potential mapping to Walsh series, and provides numerical evidence on adiabatic evolution complexity.
Findings
Gray code encoding reduces model complexity.
Polynomial time complexity with volume for initial state preparation.
Sensitivity of adiabatic evolution to ultraviolet scales.
Abstract
We reformulate the continuous space Schr\"odinger equation in terms of spin Hamiltonians. For the kinetic energy operator, the critical concept facilitating the reduction in model complexity is the idea of position encoding. Binary encoding of position produces a Heisenberg-like model and yields exponential improvement in space complexity when compared to classical computing. Encoding with a binary reflected Gray code, and a Hamming distance 2 Gray code yields the additional effect of reducing the spin model down to the XZ and transverse Ising model respectively. We also identify the bijective mapping between diagonal unitaries and the Walsh series, producing the mapping of any real potential to a series of -local Ising models through the fast Walsh transform. Finally, in a finite volume, we provide some numerical evidence to support the claim that the total time needed for adiabatic…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
