ExplorerQuantum ComputingQuantum Physics
Research PaperResearchia:202602.12057

Tucker iterative quantum state preparation

Carsten Blank

Abstract

Quantum state preparation is a fundamental component of quantum algorithms, particularly in quantum machine learning and data processing, where classical data must be encoded efficiently into quantum states. Existing amplitude encoding techniques often rely on recursive bipartitions or tensor decompositions, which either lead to deep circuits or lack practical guidance for circuit construction. In this work, we introduce Tucker Iterative Quantum State Preparation (Q-Tucker), a novel method that ...

Submitted: February 12, 2026Subjects: Quantum Physics; Quantum Computing

Description / Details

Quantum state preparation is a fundamental component of quantum algorithms, particularly in quantum machine learning and data processing, where classical data must be encoded efficiently into quantum states. Existing amplitude encoding techniques often rely on recursive bipartitions or tensor decompositions, which either lead to deep circuits or lack practical guidance for circuit construction. In this work, we introduce Tucker Iterative Quantum State Preparation (Q-Tucker), a novel method that adaptively constructs shallow, deterministic quantum circuits by exploiting the global entanglement structure of target states. Building upon the Tucker decomposition, our method factors the target quantum state into a core tensor and mode-specific operators, enabling direct decompositions across multiple subsystems.


Source: arXiv:2602.09909v1 - http://arxiv.org/abs/2602.09909v1 PDF: https://arxiv.org/pdf/2602.09909v1 Original Link: http://arxiv.org/abs/2602.09909v1

Please sign in to join the discussion.

No comments yet. Be the first to share your thoughts!

Access Paper
View Source PDF
Submission Info
Date:
Feb 12, 2026
Topic:
Quantum Computing
Area:
Quantum Physics
Comments:
0
Bookmark