Papers › Fully-programmable universal quantum simulator with a one-dimensional quantum processor
Fully-programmable universal quantum simulator with a one-dimensional quantum processor
V. M. Bastidas, T. Haug, C. Gravel, L. -C. Kwek, W. J. Munro, Kae Nemoto
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Current quantum devices execute specific tasks that are hard for classical computers and have the potential to solve problems such as quantum simulation of material science and chemistry, even without error correction. For practical applications it is highly desirable to reconfigure the connectivity of the device, which for superconducting quantum processors is determined at fabrication. In addition, we require a careful design of control lines and couplings to resonators for measurements. Therefore, it is a cumbersome and slow undertaking to fabricate a new device for each problem we want to solve. Here we periodically drive a one-dimensional chain to engineer effective Hamiltonians that simulate arbitrary connectivities. We demonstrate the capability of our method by engineering driving sequences to simulate star, all-to-all, and ring connectivities. We also simulate a minimal example of the 3-SAT problem including three-body interactions, which are difficult to realize experimentally. Our results open a new paradigm to perform quantum simulation in near term quantum devices by enabling us to stroboscopically simulate arbitrary Hamiltonians with a single device and optimized driving sequences
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections