Tucker iterative quantum state preparation

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 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.

References in corpus (12)

• Geometric measure of entanglement and applications to bipartite and multipartite quantum states
• Quantum Circuits for General Multiqubit Gates
• Hierarchical quantum classifiers
• Quantum Circuits for Isometries
• Strategies for solving the Fermi-Hubbard model on near-term quantum computers
• A divide-and-conquer algorithm for quantum state preparation
• Quantum circuits with uniformly controlled one-qubit gates
• Circuit-Based Quantum Random Access Memory for Classical Data
• Encoding of Matrix Product States into Quantum Circuits of One- and Two-Qubit Gates
• Sequential Generation of Matrix-Product States in Cavity QED
• Configurable sublinear circuits for quantum state preparation
• Low-rank quantum state preparation