aiqbenchInformații despre AI & calcul cuantic

...

Română · beta. Traducerea a fost făcută automat și este încă în curs de revizuire. Citește pagina în engleză

perspectiva aiqbenchCalcul cuantic

This research presents optimized Trotter-Suzuki schemes designed to reduce gate counts for simulating lattice field theories on quantum hardware. By improving the efficiency of time evolution computations, these methods address a critical bottleneck in scaling practical quantum simulations beyond current limitations. The work offers concrete algorithmic advances that directly benefit researchers developing algorithms for real-time dynamics and tensor network applications.

Sursă care acoperăarXiv

Ce este aceastaLectura unui model asupra articolului și a acoperirii conexe, scrisă pentru aiqbench. Nu sunt cuvintele publicației.

Reducing the Gate Count with Efficient Trotter-Suzuki Schemes

arXiv31 iulie 20261 min de cititArticolul și perspectiva sunt în engleză.

arXiv:2602.21145v2 Announce Type: replace-cross Abstract: Hamiltonian formulations of lattice field theories provide access to real-time dynamics, but their simulation is difficult to implement efficiently. Trotter-Suzuki decompositions are at the center of time evolution computation, either on quantum hardware or classically, for instance with the use of tensor networks. While low-order Trotterizations remain the standard choice due to their simplicity, higher-order schemes offer the potential for improved efficiency. In this work we outline a short guide to Trotter-Suzuki schemes and their implementations in general. To help with this, we highlight new efficient schemes found by our optimization framework, and demonstrate their performance on the Heisenberg model.

Abstract:Hamiltonian formulations of lattice field theories provide access to real-time dynamics, but their simulation is difficult to implement efficiently. Trotter-Suzuki decompositions are at the center of time evolution computation, either on quantum hardware or classically, for instance with the use of tensor networks. While low-order Trotterizations remain the standard choice due to their simplicity, higher-order schemes offer the potential for improved efficiency. In this work we outline a short guide to Trotter-Suzuki schemes and their implementations in general. To help with this, we highlight new efficient schemes found by our optimization framework, and demonstrate their performance on the Heisenberg model.

arXiv:2602.21145 [hep-lat]

(or arXiv:2602.21145v2 [hep-lat] for this version)

Text integral sub licența deschisă a publicației · 108 cuvinte

Citește pe arXiv ↗Întreabă despre acest articol