arXiv:2301.00560 [quant-ph]AbstractReferencesReviewsResources
PauliComposer: Compute Tensor Products of Pauli Matrices Efficiently
Sebastián V. Romero, Juan Santos-Suárez
Published 2023-01-02Version 1
We introduce a simple algorithm that efficiently computes tensor products of Pauli matrices. This is done by tailoring the calculations to this specific case, which allows to avoid unnecessary calculations. The strength of this strategy is benchmarked against state-of-the-art techniques, showing a remarkable acceleration. As a side product, we provide an optimized method for one key calculus in quantum simulations: the Pauli basis decomposition of Hamiltonians.
Comments: 6 pages, 3 figures
Categories: quant-ph
Related articles: Most relevant | Search more
arXiv:2401.05104 [quant-ph] (Published 2024-01-10)
On characteristics of mixed unitary channels being additive or multiplicative with respect to taking tensor products
Tensor products of convex sets and the volume of separable states on N qudits
arXiv:2201.07918 [quant-ph] (Published 2022-01-19)
Tensor products of entangled subspaces and their properties from diagrammatic constructions