Dynamical Hamiltonian engineering of 2D rectangular lattices in a one-dimensional ion chain
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Abstract Controlling the interaction graph between spins or qubits in a quantum simulator allows user-controlled tailoring of native interactions to achieve a target Hamiltonian. Engineering long-ranged phonon-mediated spin–spin interactions in a trapped ion quantum simulator offers such a possibility. Trapped ions, a leading candidate for quantum simulation, are most readily trapped in a linear 1D chain, limiting their utility for readily simulating higher dimensional spin models. In this work, we introduce a hybrid method of analog-digital simulation for simulating 2D spin models which allows for the dynamic changing of interactions to achieve a new graph using a linear 1D chain. We focus this numerical work on engineering 2D rectangular nearest-neighbor spin lattices, demonstrating that the required control parameters scale linearly with ion number. This hybrid approach offers compelling possibilities for the use of 1D chains in the study of Hamiltonian quenches, dynamical phase transitions, and quantum transport in 2D and 3D.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it