Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2507.15421 · Annals of Physics

Slow convergence of Trotter decomposition for rotations

Paolo Facchi A, Francesco Perrini, Vito Viesti

Published May 22, 2026• 0 citations
arXivHTMLPDF
DOI
10.1016/j.aop.2026.170539

Related papers

Optimized higher-order Lie-Trotter-Suzuki decompositions for two and more terms

Yikang Zhang, Thomas Barthel

Bulletin of the American Physical Society•Mar 5, 2019•1 citation

Optimized Lie–Trotter–Suzuki decompositions for two and three non-commuting terms

Thomas Barthel, Yikang Zhang

arXiv:1901.04974•Annals of Physics•Apr 16, 2020•42 citations

Halving the Cost of Controlled Time-Evolution

William A. Simon, Peter J. Love

Quantum simulation is a promising application for quantum computing. Quantum simulation algorithms may require the ability to control the time evolution unitary. Naive techniques to control a unitary can substantially increase the required computational resources. A standard approach to controlling Trotterized time evolution doubles the number of single-qubit arbitrary rotations. Here, we describe a compilation scheme that does not increase the number of arbitrary rotations for symmetric Trotterizations, which applies to second-order and higher Suzuki-Trotter decompositions. This halves the number of arbitrary rotations required to implement controlled, Trotterized time evolution compared to the standard approach. Arbitrary rotations contribute significantly to resource estimates in a fault-tolerant architecture due to the number of required magic states. Therefore, arbitrary rotations dominate the $T$-cost of fault-tolerant implementations of quantum simulation. This construction reduces the number of arbitrary rotations for controlled Trotter evolution to that of uncontrolled Trotter evolution, thereby reducing the cost of fault-tolerant quantum simulation.

quant-pharXiv:2511.13855•Nov 19, 2025•0 citations

On adaptive time-dependent DMRG based on Trotter decompositions

Ulrich Schollwoeck

Bulletin of the American Physical Society•Mar 24, 2005•0 citations

On the theory of collective rotations

Shinzo Nakai, Muneo Sasaki

Nuclear Physics•May 1, 1961•2 citations

CALCULUS OF THE TROTTER APPROXIMATION

Giuseppe Da Prato, Luciano Tubaro

CRC Press eBooks•Aug 19, 1994•0 citations
Quantum simulation is a promising application for quantum computing. Quantum simulation algorithms may require the ability to control the time evolution unitary. Naive techniques to control a unitary can substantially increase the required computational resources. A standard approach to controlling Trotterized time evolution doubles the number of single-qubit arbitrary rotations. Here, we describe a compilation scheme that does not increase the number of arbitrary rotations for symmetric Trotterizations, which applies to second-order and higher Suzuki-Trotter decompositions. This halves the number of arbitrary rotations required to implement controlled, Trotterized time evolution compared to the standard approach. Arbitrary rotations contribute significantly to resource estimates in a fault-tolerant architecture due to the number of required magic states. Therefore, arbitrary rotations dominate the TTT-cost of fault-tolerant implementations of quantum simulation. This construction reduces the number of arbitrary rotations for controlled Trotter evolution to that of uncontrolled Trotter evolution, thereby reducing the cost of fault-tolerant quantum simulation.