• Home
  • Search
  • Faster quantum state decomposition with Tucker tensor approximation
  • Open Access IconOpen Access
  • Cite Icon2
  • https://doi.org/10.1007/s42484-023-00113-4Copy DOI Icon

Faster quantum state decomposition with Tucker tensor approximation

Show More
  • Abstract
  • PDF
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

Researchers have put a lot of effort into reducing the gap between current quantum processing units (QPU) capabilities and their potential supremacy. One approach is to keep supplementary computations in the CPU, and use QPU only for the core of the problem. In this work, we address the complexity of quantum algorithm of arbitrary quantum state initialization, an important building block of quantum data analysis and machine learning. QPUs do not outperform classical machines with existing precise initialization algorithms. Hence, many studies propose an approximate but robust quantum state initialization. Cutting a quantum state into a product of (almost) independent partitions with the help of CPU reduces the number of two-qubit gates, and correspondingly minimizes the loss of state fidelity in the quantum part of the algorithm. To find the least entangled qubits, current methods compute the singular value decomposition (SVD) for each qubit separately with CPU. In this paper, we optimize CPU usage and memory resource bottlenecks. We consider Tucker tensor decomposition as an alternative to the CPU-based SVD in a single low-entangled qubit detection task without the loss of solution quality. Both proposed methods outperform the SVD in time and memory for systems of at least ten qubits. We achieve an order faster implementation and two orders less memory usage for a system of 15 qubits.

Loading PDF

Similar Papers
  • Research Article

Characterization of fiducial states in prime dimensions via mutually unbiased bases

  • Mar 01, 2013
  • Physica Scripta
  • D Goyeneche +2
  • Book Chapter
  • Citations1

Sorting of Quantum States with Respect to Amount of Entanglement Included

  • Jan 01, 2009
  • Roman Gielerak +1
  • Conference Article
  • Citations1

Degradable states and one-way entanglement distillation

  • Jun 01, 2017
  • Felix Leditzky +2
  • Research Article
  • Citations121

Multigrid Accelerated Tensor Approximation of Function Related Multidimensional Arrays

  • Jan 01, 2009
  • SIAM Journal on Scientific Computing
  • B N Khoromskij +1
  • Research Article
  • Citations140

Optimal Purification of Single Qubits

  • May 24, 1999
  • Physical Review Letters
  • J I Cirac +2
  • Research Article
  • Citations28

Tucker Tensor Analysis of Matérn Functions in Spatial Statistics

  • Jul 07, 2018
  • Computational Methods in Applied Mathematics
  • Alexander Litvinenko +4
  • PDF
  • Research Article
  • Citations14

Everettian relative states in the Heisenberg picture

  • Feb 01, 2021
  • Proceedings. Mathematical, Physical, and Engineering Sciences
  • Samuel Kuypers +1
  • Research Article
  • Citations25

Uniquely defined geometric phase of an open system

  • Jul 08, 2009
  • Physical Review A
  • Nikola Burić +1
  • Research Article

Spectral Theory in Compact Operators.

  • Nov 12, 2024
  • Science and Technology of Engineering, Chemistry and Environmental Protection
  • Yuming Chen
  • Research Article
  • Citations19

Greedy low-rank approximation in Tucker format of solutions of tensor linear systems

  • Mar 15, 2019
  • Journal of Computational and Applied Mathematics
  • I Georgieva +1
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.