Quick Navigation
Topics
Quantum Simulation
Noise-Resilient Quantum Dynamics Using Symmetry-Preserving Ansatzes
arXiv
Authors: Matthew Otten, Cristian L. Cortes, Stephen K. Gray
Year
2019
Paper ID
7219
Status
Preprint
Abstract Read
~2 min
Abstract Words
196
Citations
N/A
Abstract
We describe and demonstrate a method for the computation of quantum dynamics on small, noisy universal quantum computers. This method relies on the idea of `restarting' the dynamics; at least one approximate time step is taken on the quantum computer and then a parameterized quantum circuit ansatz is optimized to produce a state that well approximates the time-stepped results. The simulation is then restarted from the optimized state. By encoding knowledge of the form of the solution in the ansatz, such as ensuring that the ansatz has the appropriate symmetries of the Hamiltonian, the optimized ansatz can recover from the effects of decoherence. This allows for the quantum dynamics to proceed far beyond the standard gate depth limits of the underlying hardware, albeit incurring some error from the optimization, the quality of the ansatz, and the typical time step error. We demonstrate this methods on the Aubry-André model with interactions at half-filling, which shows interesting many-body localization effects in the long time limit. Our method is capable of performing high-fidelity Hamiltonian simulation hundred of time steps longer than the standard Trotter approach. These results demonstrate a path towards using small, lossy devices to calculate quantum dynamics.
Why This Paper Matters
- This paper contributes to the Quantum Simulation research area in the Quantum Articles archive.
- It adds a 2019 reference point for readers tracking recent quantum research.
- We describe and demonstrate a method for the computation of quantum dynamics on small, noisy universal quantum computers.
Paper Tools
Become a member to use research tools
Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.
Show Paper arXiv Publisher Share
Cite This Paper
Copy URL
Compare
Copy DOI Add to Reading List
Category Correction Request
Category Correction Request
Help us improve classification quality by proposing a better category. Every request is reviewed by an admin.
Sign in to submit a category correction request for this paper.
Log In to SubmitReferences & Citation Signals
Community Reactions
Quick sentiment from readers on this paper.
Score:
0
Likes: 0
Dislikes: 0
Sign in to react to this paper.
Discussion & Reviews (Moderated)
Average Rating: 0.0 / 5 (0 ratings)
No written reviews yet.