High-dimensional Schrödinger systems arising from tensor-product discretizations suffer from exponential state growth, making direct controller synthesis and real-time closed-loop simulation computationally challenging. Hierarchical Tucker (HT) tensor representations offer scalable low-rank surrogates, but the impact of fixed-rank truncation on closed-loop stability is not well understood. This paper develops a local robustness framework for sampled-data feedback control implemented with fixed-rank HT projections. By viewing each truncation as a bounded, rank-dependent perturbation of the nominal closed loop, and assuming a local phase-invariant contraction certificate together with trajectory-level hierarchical spectral decay, we show that the HT-projected dynamics are practically exponentially stable: trajectories converge to a dimension-independent tube whose radius decreases with the prescribed rank. We further obtain an explicit logarithmic rank-accuracy relation and establish conditions under which controllers designed on the HT-truncated surrogate model retain practical exponential tracking guarantees when deployed on the full system, together with an explicit bound quantifying the resulting surrogate-to-plant mismatch. A compact lattice example demonstrates the applicability of the framework.
High-dimensional Schrödinger systems arising from tensor-product discretizations suffer from exponential state growth, making direct controller synthesis and real-time closed-loop simulation computationally challenging. Hierarchical Tucker (HT) tensor representations offer scalable low-rank surrogates, but the impact of fixed-rank truncation on closed-loop stability is not well understood. This paper develops a local robustness framework for sampled-data feedback control implemented with fixed-rank HT projections. By viewing each truncation as a bounded, rank-dependent perturbation of the nominal closed loop, and assuming a local phase-invariant contraction certificate together with trajectory-level hierarchical spectral decay, we show that the HT-projected dynamics are practically exponentially stable: trajectories converge to a dimension-independent tube whose radius decreases with the prescribed rank. We further obtain an explicit logarithmic rank-accuracy relation and establish conditions under which controllers designed on the HT-truncated surrogate model retain practical exponential tracking guarantees when deployed on the full system, together with an explicit bound quantifying the resulting surrogate-to-plant mismatch. A compact lattice example demonstrates the applicability of the framework.
We develop a certified finite-horizon quantum optimal-control framework based on fixed-rank Hierarchical Tucker (HT) surrogates. Under a uniform rank-dependent HT truncation-accuracy condition, we establish exponentially decaying trajectory, cost, and value-function errors and near-optimality of surrogate-generated controls. We further derive a logarithmic rank--performance relation, an a posteriori cost certificate from realized truncation perturbations, and guarantees for inexact surrogate optimization and control convergence under additional regularity conditions. Numerical experiments on controlled XXZ spin chains provide finite-sample evidence consistent with the truncation condition and illustrate the trade-off between HT rank, representation size, surrogate accuracy, and control performance.
We study low-rank tensor methods for the numerical solution of Schrödinger's equation with time-independent and explicitly time-dependent Hamiltonians, motivated by large-scale simulations of many-body quantum systems and quantum computing devices subject to time-dependent control pulses. We outline the recent application of the "basis update and Galerkin" (BUG) method for tensor trains, and describe the established TDVP and TDVP-2 algorithms based on the time-dependent variational principle. For comparison, we also consider the BUG method in the Tucker format. All these approaches enable memory efficient representations of partially entangled quantum states and thereby mitigate the exponential cost of conventional state-vector formulations. The rank-adaptivity relies on the truncated singular value decomposition, in which the rank of a matrix is reduced by setting its smallest singular values to zero, based on a threshold parameter that controls the truncation error. Numerical experiments on representative time-independent and time-dependent Hamiltonian models quantify the tradeoff between accuracy and compression across methods, with particular attention to the interplay between the time-step and the truncation threshold, and how the computational effort scales with the number of sub-systems in the quantum system.
In practical applications, quantum systems are inevitably subject to significant uncertainties, including unknown initial states, imprecise physical parameters, and unmodeled environmental noise, all of which pose major challenges to robust quantum feedback control. This paper proposes a feedback stabilization strategy based on a reduced quantum filter that achieves robustness against time-varying Hamiltonian perturbations and additional dissipative effects, without requiring prior knowledge of the initial state or exact system parameters. The proposed filter estimates only O(N) real variables corresponding to the diagonal elements of the system density matrix in a quantum non-demolition basis in contrast to the O(N^2) variables required by a full stochastic master equation, where N is the Hilbert space dimension. This dimensionality reduction substantially simplifies real-time computation and feedback implementation while preserving both convergence and robustness guarantees. Rigorous analysis further establishes global exponential stability of the target subspace. The results provide a scalable framework for robust and efficient measurement-based feedback control applicable to high-dimensional perturbed open quantum systems.
We introduce a new SVD-based tensor decomposition method for tensor networks with arbitrary graph topologies, extending classical hierarchical SVD-based techniques to networks with cycles and general connectivity. We also introduce addition and rounding procedures for traceable tensor graphs, enabling step-rounding time integration of high-dimensional PDEs directly in graph format, with rank truncation controlled to a prescribed tolerance at every time step. We demonstrate the new method on the decomposition of multivariate functions and on the numerical solution of the Fokker-Planck equation, and find that the graph-format representation attains comparable or better accuracy than the classical tensor train and hierarchical Tucker tensor formats, while using substantially fewer degrees of freedom at lower computational cost.
The application of Model Predictive Control (MPC) to quantum systems faces fundamental challenges arising from measurement-induced disturbances and the probabilistic nature of quantum dynamics. Unlike classical nonlinear systems, quantum measurements inherently disturb the system state, making feedback control intrinsically model-dependent and stochastic. Within the framework of Positive Operator-Valued Measures (POVMs), this thesis focuses on strong quantum measurements, where each observation induces a complete state collapse on the system. When uncertainty is introduced, the measurement process itself becomes a dominant source of disturbance. To address this, a lower bound on the measurement uncertainty is imposed, quantified as the predicted deviation between the measured quantum state and the nominal MPC trajectory, ensuring that the quantum state can be steered along the designed MPC trajectory while maintaining physical realizability and stability. The thesis further develops a stochastic MPC (SMPC) formulation based on quantum filtering equations, describing the conditional evolution of quantum states under continuous observation. A theoretical equivalence between the proposed SMPC scheme and an optimal control problem is established, providing a tractable computational approach for feedback design in quantum stochastic systems. Finally, to address the limitations imposed by explicit identification of quantum systems in complex quantum systems, a data-driven MPC framework is introduced. Using locally observable dynamics and trajectory data, a data-driven MPC formulation is introduced to realize predictive quantum control without explicit system identification. This framework lays the foundation for measurement-aware and physically consistent quantum MPC.
A key bottleneck in quantum machine learning is the computational cost of repeated quantum circuit evaluations during the inference phase. To address this, we present a framework for constructing fast, cheap, provably accurate classical tensor-train surrogates of fully trained quantum machine learning models within local patches of their input data space. The approach combines Taylor polynomial approximation with a tensor-train (TT) representation and embeds it in a statistical learning paradigm via empirical risk minimization. In our analysis, the Taylor-TT construction serves as a deterministic error certificate proving that the TT hypothesis class contains a good approximation; empirical risk minimization then provably recovers a surrogate with controlled generalization error and explicit bounds. This translates into three independently controllable error sources: (i) Taylor truncation error controlled by the patch radius r and polynomial degree p, (ii) TT approximation error controlled by the bond dimension χ, and (iii) statistical estimation error. While the parameter count scales polynomially in the number of data dimensions N, i.e., deff=N(p+1)χ2 rather than the naive (p+1)N, the worst-case constants inherit an exponential factor through the tensor-product feature norm during Taylor polynomial embedding onto TT. This cleanly separates representation complexity from feature-induced constants. Our risk bounds and sample complexity depend explicitly on the local patch radius r.