What problem does it solve? Choosing the right quantum state-preparation method is difficult because sparse-support, MPS, multiplexer, Möttönen, and variational Pauli-word approaches each exploit different target structures, work-qubit budgets, and error trade-offs. This Skill acts as a router that selects and compares the correct UnitaryLab leaf algorithm for loading a target amplitude vector into a quantum circuit. ## Core Features & Use Cases - Method Routing: Applies ordered routing rules that honor explicit method requests, recognize supplied MPS tensors, compare structural candidates, and default to Möttönen for general complex targets. - Five Leaf Algorithms: Covers sparse Superposition, Möttönen uniformly controlled rotations, Matrix Product State preparation, recursive Multiplexer preparation, and variational Pauli-word preparation. - Shared Validation Contract: Enforces common rules for normalization, trailing-zero padding, target_qubits >= 1, phase-invariant error comparison, and distinct per-method error metrics. - Use Case: A user supplies a low-entanglement target vector and asks which preparation method fits; the Skill compares MPS against Möttönen using bond dimension, work qubits, and allowed error before generating code from the selected leaf. ## Quick Start Ask the assistant to prepare a given complex amplitude vector on a specified number of qubits and let it select the appropriate UnitaryLab state-preparation method.