Implementing the sine transform of fermionic modes as a tensor network

Abstract

Based on the algebraic theory of signal processing, we recursively decompose the discrete sine transform of first kind (DST-I) into small orthogonal block operations. Using a diagrammatic language, we then second-quantize this decomposition to construct a tensor network implementing the DST-I for fermionic modes on a lattice. The complexity of the resulting network is shown to scale as $\frac{5}{4}n\log n$ (not considering swap gates), where $n$ is the number of lattice sites. Our method provides a systematic approach of generalizing Ferris' spectral tensor network for non-trivial boundary conditions.

11 pages, 5 captioned figures

References in corpus (5)

• A Practical Introduction to Tensor Networks: Matrix Product States and Projected Entangled Pair States
• A class of quantum many-body states that can be efficiently simulated
• Quantum circuits for strongly correlated quantum systems
• Advances on Tensor Network Theory: Symmetries, Fermions, Entanglement, and Holography
• Fourier transform of fermionic systems and the spectral tensor network