Pith. sign in

REVIEW 1 cited by

Nearest-neighbor approximation in one-excitation state evolution along spin-1/2 chain governed by XX-Hamiltonian

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2301.09469 v1 pith:VF4ZI5NL submitted 2023-01-23 quant-ph

classification quant-ph
keywords alphachainevolutioninteractionapproximationgovernedintensityone-excitation
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

The approximation of nearest neighbor interaction (NNI) is widely used in short-time spin dynamics with dipole-dipole interactions (DDI) when the intensity of spin-spin interaction is $\sim 1/r^3$, where $r$ is a distance between those spins. However, NNI can not approximate the long time evolution in such systems. We consider the system with the intensity of the spin-spin interaction $\sim 1/r^{\alpha}$, $\alpha\ge 3$, and find the low boundary $\alpha_c$ of applicability of the NNI to the evolution of an arbitrary one-excitation initial quantum state in the homogeneous spin chain governed by the $XX$-Hamiltonian. We obtain the logarithmic dependence of $\alpha_c$ on the chain length.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Scaling Natural-Language Graph-Based Test Time Compute for Automated Theorem Proving

    cs.CL 2025-02 conditional novelty 4.0 of 10

    KG-Prover shows that traversing a ProofWiki-derived knowledge graph at inference time improves LLM theorem-proving accuracy on miniF2F, ProofNet, and MUSTARDSAUCE without extra fine-tuning.

Pith tools