The reviewed record of science sign in
Pith

arxiv: 2205.09882 · v3 · pith:E4ZUFVNG · submitted 2022-05-19 · quant-ph

Low-rank tensor decompositions of quantum circuits

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:E4ZUFVNGrecord.jsonopen to challenge →

classification quant-ph
keywords quantumcircuitssimulationlow-rankmatrixproductstatesadvantages
0
0 comments X
read the original abstract

Quantum computing is arguably one of the most revolutionary and disruptive technologies of this century. Due to the ever-increasing number of potential applications as well as the continuing rise in complexity, the development, simulation, optimization, and physical realization of quantum circuits is of utmost importance for designing novel algorithms. We show how matrix product states (MPSs) and matrix product operators (MPOs) can be used to express certain quantum states, quantum gates, and entire quantum circuits as low-rank tensors. This enables the analysis and simulation of complex quantum circuits on classical computers and to gain insight into the underlying structure of the system. We present different examples to demonstrate the advantages of MPO formulations and show that they are more efficient than conventional techniques if the bond dimensions of the wave function representation can be kept small throughout the simulation.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Time Evolution on Hybrid Tensor Networks -- A Novel and Parallelizable Algorithm

    quant-ph 2026-06 unverdicted novelty 6.0

    Introduces a parallelizable hybrid tensor network algorithm for time-evolving matrix product states that combines classical BUG integration with quantum methods without synchronization barriers.