Implementing the sine transform of fermionic modes as a tensor network
arXiv:1705.10186 · doi:10.1103/PhysRevA.96.032308
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 (not considering swap gates), where is the number of lattice sites. Our method provides a systematic approach of generalizing Ferris' spectral tensor network for non-trivial boundary conditions.
arXiv comment11 pages, 5 captioned figures
References in corpus (13)
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- The World as a Hologram
- 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
- Entanglement Renormalization and Holography
- Algorithms for entanglement renormalization
- Quantum circuits for strongly correlated quantum systems
- Fermionic multi-scale entanglement renormalization ansatz
- Advances on Tensor Network Theory: Symmetries, Fermions, Entanglement, and Holography
- Algebraic Signal Processing Theory: Cooley-Tukey Type Algorithms for DCTs and DSTs
- A class of highly entangled many-body states that can be efficiently simulated
- Fourier transform of fermionic systems and the spectral tensor network
- A real space decoupling transformation for quantum many-body systems