2025/12/23 by Josh Green, Green, Josh, Joshua Snow +3
Computer Science · Physics and Astronomy · #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Physics (quant-ph) #Quantum many-body systems
paper · doi:10.48550/arxiv.2512.20537
openalex publication_date 2025/12/23 · openalex created_date 2025/12/25 · openalex updated_date 2026/07/28
Quantum state preparation represents a critical bottleneck for a broad class of quantum algorithms. In this work, we introduce the Schmidt Spectrum Optimisation (SSO) algorithm as an efficient and scalable approach for preparing quantum states described by Matrix Product States (MPS). The SSO algorithm employs a preparation-by-disentangling strategy by optimising circuit layers of two-qubit gates to progressively remove entanglement from a target state. Each circuit layer is computed sequentially and efficiently on a classical computer using tensor network optimisation techniques. Once the target state has been successfully disentangled, a quantum state-preparation circuit is formed by reversing the sequence of optimised disentangling layers. Across benchmarks including random MPS and MPS approximations to the ground-states of local Hamiltonians, we find that the SSO algorithm significantly improves upon prior variational and disentangling-based approaches, highlighting its potential as a scalable framework for quantum state preparation.