Quantum control papers on arXiv, selected and classified automatically by QOC. https://llorebaga.github.io/QOC/topics/controllability/ 2026-10-10T00:00:00Z QOC https://arxiv.org/abs/2610.14938 2026-10-10T00:00:00Z 2026-10-10T00:00:00Z Sergey KuznetsovAlexander Pechen

In this work, we study operator controllability of finite-dimensional closed quantum systems driven by a single coherent control. Two general Lie-algebraic results on controllability of such systems are proved. The first gives sufficient conditions under which controllability of the system is preserved when controlled energy-level shifts are added. The second gives a sufficient basis-element condition under which the dynamical Lie algebra contains $\mathfrak{su}(N)$ and the system is therefore operator controllable. These results, together with known controllability conditions, are applied to obtain a complete classification of operator controllability of all three-level quantum systems in terms of their free and interaction Hamiltonian matrix elements. This classification covers all combinations of energy-level and level-spacing degeneracies, two or three allowed transitions, as well as the presence or absence of controlled energy-level shifts, and gives necessary and sufficient conditions for operator controllability in each case.

https://arxiv.org/abs/2609.24475 2026-09-21T00:00:00Z 2026-09-21T00:00:00Z Andrew Rowan BarlowHans-Martin RieserMarkus Lange

Variational hybrid quantum models are a common paradigm for realising machine learning on quantum hardware. Nonetheless, they are challenging to train due to several problems intrinsic to the loss landscapes formed by variational quantum circuits. To mitigate these issues, researchers have extended the idea of subspace controllability leading to an increase in the success rate of variational models in finding the global minimum for quantum-based tasks. However, it remains unknown whether these results extend to classical-based tasks, and if any advantages are realised over a hyperparameter search. We begin to address this question by employing controllable circuits in a multi- classification task using MNIST-1D. Our results show that over a hyperparameter search, the majority of quantum models that achieve the lowest training and validation losses are subspace controllable. These results indicate that the hyperparameter search can be restricted to such models, in turn reducing computational cost and time.

https://arxiv.org/abs/2609.11351 2026-09-10T00:00:00Z 2026-09-10T00:00:00Z Mariane Mangin-Brinet

Analog quantum computers provides direct access to continuous many-body dynamics, but their native control Hamiltonians generate only a restricted operator space. Consequently, the fidelity with which they can reproduce a target Hamiltonian's dynamics depends not only on spectral agreement but on whether the physical controls can actually generate the required evolution. We introduce a geometry-independent framework for diagnosing and optimizing this compatibility between the spectral algebra generated by a target Hamiltonian $H$ and a Krylov-type operator space generated from the device's independently tunable control Hamiltonians and a fixed initial state. The encoding problem can be formulated as an optimization over the unitary orbit of the target Hamiltonian. We maximize a smooth subspace-overlap functional using Riemannian gradient descent on $U(d)$, thereby selecting a spectrally equivalent representation whose target algebra is better aligned with the native controls. We apply this framework to the deuteron Hamiltonian encoded on a Rydberg-atom analog processor. The standard binary encoding is strongly misaligned with this space for small system sizes, while principal-angle optimization substantially improves the algebraic compatibility of the encoding. Moreover, using a single geometry-independent optimized encoding substantially reduces the sensitivity of state-preparation fidelity to the atomic geometry. These results establish algebraic reachability as a useful preprocessing criterion for analog encoding design: it identifies representation-level incompatibilities before device-specific geometry and pulse optimization, while the distinction between algebra-level and state-level reachability clarifies when full encoding optimization is necessary and when geometry-dependent control resources can compensate for incomplete algebraic alignment.

https://arxiv.org/abs/2608.30771 2026-08-31T00:00:00Z 2026-08-31T00:00:00Z Oxana ShayaKonstantin GolovkinMainak RoyVincent Russo

The dynamical Lie algebra (DLA) governs the controllability, expressibility, and simulation complexity of a quantum system. Explicitly computing it has been a major computational bottleneck: brute-force Lie closure scales exponentially in the number of qubits $n$. Many applications, however, consult only the isomorphism type of the DLA. We introduce PauLie, an open-source framework that decides this isomorphism type for DLAs generated by arbitrary Pauli strings, building on the anticommutation-graph reduction of Aguilar et al. PauLie runs in $O(n|\mathcal{G}|\max(n,|\mathcal{G}|))$ time, where $|\mathcal{G}|$ is the number of generators, turning DLA classification into a routine preprocessing step. We demonstrate its use as a structural oracle for routing Lie-algebraic simulation and Cartan decomposition, diagnosing barren plateaus in variational quantum algorithms, and engineering universal Pauli string generator sets with optimal generation rate.

https://arxiv.org/abs/2607.04320 2026-07-05T00:00:00Z 2026-07-05T00:00:00Z D. A. AbraamianLev LokutsievskiyAlexander Pechen

We analytically determine the ultimate limits of state preparation in two-level open quantum systems driven by coherent control. For a dissipative qubit governed by a GKSL master equation, we give an exact characterization of the reachable set in the Bloch ball. Dissipation excludes a region of states in the Bloch ball which cannot be approached even under arbitrarily strong coherent driving, and we prove that this region has a nontrivial geometry whose boundary is a surface of revolution around the $x$-axis which is analytic except for two conical singularities. We derive a closed-form control protocol for moving on this boundary, and construct an explicit protocol that steers the system arbitrarily close to any prescribed boundary state. These results provide a complete geometric constructive description of reachable qubit states in the standard dissipative environment, establishing fundamental bounds on controllability and state-preparation fidelity for open two-level quantum systems.

https://arxiv.org/abs/2606.24645 2026-06-23T00:00:00Z 2026-06-23T00:00:00Z Younes NaceurLlorenç Balada Gaggioli

Finite-time control is central to quantum technologies, yet rigorous limits on reachable targets and optimal control times remain largely unknown. We develop a framework for finite-time reachability and optimal-time certificates in constrained quantum control based on moment relaxations with implicitly time-dependent differential constraints. For fixed control horizons and control constraints, the method yields rigorous upper bounds on achievable terminal fidelities, lower bounds on the optimal control times required to reach them, and certificate gaps for benchmarking explicit control pulses. We demonstrate the versatility of our framework in three use cases: entangled-state preparation in two and three qubits, one-qubit gate synthesis across different control geometries, and excitation transfer in an $N$-qubit $XX$ chain. Our work establishes differential moment hierarchies as a practical tool for certifying reachability limits and optimal control times in quantum control, providing hardware-aware quantum speed limits while highlighting structure exploitation as a key ingredient for scalable certification.

https://arxiv.org/abs/2606.19470 2026-06-17T00:00:00Z 2026-06-17T00:00:00Z Tommaso FrancalanciNicolò SpagnoloMario SigalottiEliott Z. MamonUlysse ChabaudFabio Sciarrino

Photonic linear optical networks provide a versatile platform for quantum information processing and quantum state engineering. However, the set of states that can be generated using passive linear optics alone is fundamentally constrained by bosonic symmetries. Heralding, based on conditional measurements on auxiliary modes, is a widely used technique to overcome these limitations and effectively enlarge the set of accessible states. Despite the widespread use of heralding, it is often unclear how specific ancillary resources impact the overall reachability of the target space. In this work, we investigate the local controllability of photonic states in linear optical networks by analyzing the rank of the Jacobian of the output state with respect to the underlying unitary circuit, which provides a quantitative measure of the dimension of the accessible tangent space at a given configuration. Our analysis ranges from passive linear optics to heralded linear optics, where auxiliary resources and conditional measurements are included. Within this framework, we quantify how different resources enlarge the locally accessible state space beyond that of passive linear optics and determine the resources required for the Jacobian rank to reach its maximal value, thereby achieving full local controllability. As maximal local rank is a necessary condition for global reachability, our framework offers a systematic tool to assess and compare the accessible state space of measurement-based photonic architectures, and to establish practical criteria for the resources needed in high-dimensional quantum state engineering.

https://arxiv.org/abs/2606.13481 2026-06-11T00:00:00Z 2026-07-02T00:00:00Z Dario Pighin

We develop a control-theoretic framework for understanding Quantum Advantage (QA), providing a systematic route to characterize when and how QA can arise. The bilinear controlled Schrödinger equation is the common thread: the target quantum computation is recast as an operator controllability problem on the special unitary group $SU(N)$, and QA is identified with a polynomial-in-$n$ upper bound on the associated minimal-time function. We illustrate the framework on two paradigmatic problems: a) the Quantum Fourier Transform (QFT) on superconducting digital quantum processors (such as IBM's ibm_brisbane), for which we prove operator controllability by a Lie-algebraic argument and derive an $O(n^2)$ upper bound on the minimal time via a gate-concatenation lemma combined with the standard QFT circuit decomposition; b) the Maximum Independent Set (MIS) problem on neutral-atom analog quantum processors (such as Pasqal's hardware), for which we analyze the Rydberg-blockade Hamiltonian as a bilinear control system and reformulate the Quantum Approximate Optimization Algorithm (QAOA) as a continuous-time optimal control problem. By a controllability result, we show how the problem can be solved on Pasqal Quantum Computers and we introduce a control-based definition of Quantum Advantage for MIS. We conclude by outlining several open problems that chart directions for future research at the intersection of Control Theory and Quantum Computing.

https://arxiv.org/abs/2606.12906 2026-06-11T00:00:00Z 2026-06-11T00:00:00Z Plato DeliyannisIman Marvian

We study the controllability of a system of qubits under global control, where control pulses act identically on all qubits. Specifically, we consider a collection of qubits identically coupled to a single bosonic mode, or harmonic oscillator, via the Jaynes-Cummings interaction. This collective coupling, known as the Tavis-Cummings (TC) interaction, has been realized in several quantum computing platforms, including superconducting and atomic qubit systems. Although the qubits do not interact directly with one another, they can become entangled through their common coupling to the bosonic mode. We characterize the group of unitaries that can be implemented on the joint Hilbert space of the qubits and bosonic mode using the TC interaction together with a global $z$ field $J_z$, corresponding to identical z rotations on all qubits. We show that for n>2 qubits the set of realizable unitaries is restricted by an "accidental" symmetry of the TC Hamiltonian, distinct from its "standard" U(1) and permutational symmetries. On the other hand, we find that the Hamiltonian $J_z^2$ breaks this accidental symmetry and, together with the TC interaction and $J_z$, achieves semi-universality: it allows the implementation of arbitrary unitaries that respect permutational and U(1) symmetry, up to certain constraints on the center of the group. In a companion paper, we further analyze this remarkable accidental symmetry and show that it can be understood through Schwinger's bosonic model of angular momentum.

https://arxiv.org/abs/2606.09773 2026-06-08T00:00:00Z 2026-06-08T00:00:00Z Roberto GargiuloPaul HerringerRobert Zeier

Understanding the dynamical properties of quantum systems is an essential task in quantum computing, quantum control, and many-body physics. Tools such as representation theory and Lie theory provide crucial information on reachability and computational power. However, this information can be difficult to access exactly or compute efficiently for arbitrary generating sets. Here we focus on the setting of Pauli strings, which satisfy numerous exceptional properties that simplify the problem. We find deep connections between Pauli Lie algebras and certain subgroups of the Clifford group generated by transvections, through the symplectic properties of the Pauli strings. This allows us to give an invariant-based perspective on these objects and their reachability, in the language of Pauli orbits, symmetries, and invariant subspaces. The invariant-based approach provides efficient algorithms for identifying Lie algebras and orbits, as well as a simple framework for analyzing structured Pauli generating sets. We also show in an elementary way that Clifford subgroups generated by transvections provide 3-designs for the corresponding Pauli Lie groups. We illustrate the framework through structured examples from variational quantum algorithms, restricted quantum computation, many-body systems, and random circuits.

https://arxiv.org/abs/2606.02014 2026-06-01T00:00:00Z 2026-06-01T00:00:00Z Piero LuchiFrancesco Pederiva

We present a framework combining Lie group theory and feed-forward neural networks to efficiently generate quantum optimal control pulses for arbitrary unitary operations in superconducting qubit systems, bypassing the need for explicit optimization at inference time. The exponential scaling of the Hilbert space dimension with qubit number makes standard optimization approaches computationally prohibitive when large ensembles of distinct propagators must be processed, a bottleneck that is particularly acute in Trotterized quantum simulation. Our method addresses this limitation by pre-computing a representative set of control pulses via Lie group theory and training neural networks to map target propagators to their corresponding pulses. We demonstrate the approach on superconducting qubit systems of 2, 3, and 4 qubits, finding high reconstruction fidelity for specific combinations of Lie algebra parameters. As a physically motivated benchmark, we apply the methodology to reconstruct control pulses for the Trotter propagators of a neutrino system undergoing collective flavor oscillations. The successful generalization across system types demonstrates that a single model -- trained once on hardware-specific random propagators -- can serve as a universal control-pulse generator for any target quantum system of compatible Hilbert space dimension, offering a promising route toward scalable quantum simulation.

https://arxiv.org/abs/2605.13774 2026-05-13T00:00:00Z 2026-07-03T00:00:00Z Dimitrios GiannakisGage Hoefer

Using techniques from the theory of von Neumann algebras, we propose a framework for addressing questions of controllability of bilinear systems on infinite dimensional Hilbert spaces. In the setup, we assume only that the drift and control terms arising in a bilinear control system are affiliated with a von Neumann algebra of finite type acting on the same Hilbert space. When the control terms satisfy basic norm bound conditions, we prove existence of time-optimal controls. In the more general setting where all operators may be unbounded, we show how the dynamical Lie algebra for the system is still well-defined and may be used to check approximate controllability of the system in question. We discuss how this approach can be applied to classical dynamical systems through the Koopman operator formalism, and investigate potential candidates for the von Neumann algebra which may guide the choice of controls. We illustrate how an affiliation relation naturally arises in both classical and quantum control systems with a few examples.

https://arxiv.org/abs/2605.05290 2026-05-06T00:00:00Z 2026-05-15T00:00:00Z András GrabaritsE. Medina-GuerraAdolfo del Campo

We study quantum dynamics generated by time-dependent Hamiltonians in Krylov space, the minimal subspace in which the evolution takes place. We establish a direct link between dynamics in the time-dependent Krylov subspace and the underlying Lie-algebraic structure of the Hamiltonian. We develop a general framework in which the dynamics in the time-dependent Krylov subspace is generated by ladder operators of the associated Lie algebra. In particular, we identify the minimal conditions under which the exact time-dependent Krylov dynamics is naturally determined by the interaction-picture Hamiltonian and governed by an embedded $\mathfrak{sl}(2,\mathbb{C})$ subalgebra. We further show that an exact single-exponential representation of the time-evolution operator gives rise to a distinct time-independent Krylov dynamics in a unitarily related basis, from which the exact time-dependent Krylov dynamics can nevertheless be recovered. We also extend the framework to the oscillator algebra as the simplest extension of the nilpotent Heisenberg--Weyl algebra, and provide further examples, including the translated and dilated harmonic oscillator, systems governed by closed Virasoro subalgebras, a spin in a rotating magnetic field, and higher-dimensional generalizations for multi-level systems. In addition, we introduce a new quantum speed limit to the complexity growth rate generated by a time-dependent generator and show that, for evolutions governed by a Lie algebra, it retains the same functional form as in the time-independent case. Remarkably, saturation of this bound is strongly affected by temporal driving and persists only when the Hamiltonian commutes with itself at different times. These results establish a unified framework for characterizing operator growth and Krylov complexity in time-dependent quantum systems with underlying Lie-algebraic structures.

https://arxiv.org/abs/2604.25760 2026-04-28T00:00:00Z 2026-06-25T00:00:00Z Tianen ChenYun Shang

The Quantum Approximate Optimization Algorithm (QAOA) follows a single, fixed evolution path, overlooking the potential computational advantage of coherently superposing multiple trajectories. Here we overcome this limitation with a hybrid quantum walk (HQW) ansatz that super poses multiple Hamiltonian-driven paths coherently within each circuit layer via a dynamical coin operator. QAOA emerges as a special case of this framework with a static Pauli-X coin. Using Pontryagin's minimum principle, we derive the optimal form of the coin operator, demonstrating that it generally differs from a constant gate. A dynamical Lie algebra analysis reveals that HQW generates a strictly larger Jordan-Lie algebra, providing an algebraic foundation for its enhanced expressivity. Especially, we reveal the connection between the unique Jordan product negativity in HQW's DLA and its performance advantages. Numerical experiments on Max-Cut and Maximum Independent Set problems show that HQW systematically outperforms QAOA in convergence speed, solution accuracy, and robustness. Our work establishes a path-superposition paradigm for quantum optimization, combining optimal control theory with algebraic structure to guide the design of advanced quantum algorithms.

https://arxiv.org/abs/2603.15356 2026-03-16T00:00:00Z 2026-04-07T00:00:00Z Saswata RoyOwen C. WetherbeeValla Fatemi

Bosonic codes offer hardware-efficient approaches to logical qubit construction and hosted the first demonstration of beyond-break even logical quantum memory. However, such accomplishments were done for idling information, and realization of fault-tolerant logical operations remains a critical bottleneck for universal quantum computation in scaled systems. Error-transparent (ET) gates offer an avenue to resolve this issue, but experimental demonstrations have been limited to phase gates. Here, we introduce a framework based on dynamic encoding subspaces that enables simple linear drives to accomplish universal gates that are error semi-transparent (EsT) to oscillator photon loss. With an EsT logical gate set of {X, H, T}, we observe a five-fold reduction in infidelity conditioned on photon loss, demonstrate extended active-manipulation lifetimes with quantum error correction, and construct a composite EsT non-Clifford operation using a sequence of eight gates from the set. Our approach is compatible with methods for detectable ancilla errors, offering an approach to error-mitigated universal control of bosonic logical qubits with the standard quantum control toolkit.

https://arxiv.org/abs/2603.04916 2026-03-05T00:00:00Z 2026-07-19T00:00:00Z Yanying LiangRuibin XuMao-Sheng LiHaozhen SituZhu-Jun Zheng

Determining the unitary dynamics accessible from finite Hamiltonian resources is a central problem in Hamiltonian engineering and quantum control. Dynamical Lie algebras (DLAs) connect available control Hamiltonians with the reachable dynamics, but their use as a design tool for modifying Hamiltonian generator sets remains less developed. In this work, we develop a finite-dimensional DLA framework for three generator-set operations: composition, invariance, and reduction. For composition, we construct direct sums of component DLAs using spectral projectors on an auxiliary register. For invariance, we analyze when modifications of Pauli-string generating sets preserve the generated Lie algebra, and introduce algebraic diagnostics for added generators. For reduction, we consider compact reductive DLAs and show how projection onto selected simple ideals gives reduced generating sets whose Lie closures are the corresponding ideal sums. We illustrate these results with finite-dimensional examples and numerical checks, including direct-sum dimension addition, central-spin invariance diagnostics, and DLA-based ansatz reduction for block-local Hamiltonians. The results show how DLA structure can be used to diagnose controllability and guide Hamiltonian generator design under explicit algebraic assumptions.

https://arxiv.org/abs/2602.05595 2026-02-05T00:00:00Z 2026-02-05T00:00:00Z Langyu LiRuoyu WuYong WangGuofeng ZhangJinhu LüQing GaoYu Pan

As a quantum-inspired, non-traditional analog solver architecture, the analog Ising machine (AIM) has emerged as a distinctive computational paradigm to address the rapidly growing demand for computational power. However, the mathematical understanding of its principles, as well as the optimization of its solution speed and accuracy, remain unclear. In this work, we for the first time systematically discuss multiple implementations of AIM and establish a unified mathematical formulation. On this basis, by treating the binarization constraint of AIM (such as injection locking) as a Lagrange multiplier in optimization theory and combining it with a Lyapunov analysis from dynamical systems theory, an analytical framework for evaluating solution speed and accuracy is constructed, and further demonstrate that conventional AIMs possess a theoretical performance upper bound. Subsequently, by elevating the binarization constraint to a control variable, we propose the controllable analog Ising machine (CAIM), which integrates control Lyapunov functions and momentum-based optimization algorithms to realize adaptive sampling-feedback control, thereby surpassing the performance limits of conventional AIMs. In a proof-of-concept CAIM demonstration implemented using an FPGA-controlled LC-oscillator Ising machine, CAIM achieves a twofold speedup and a 7\% improvement in accuracy over AIM on a 50-node all-to-all weighted MaxCut problem, validating both the effectiveness and interpretability of the proposed theoretical framework.

https://arxiv.org/abs/2512.24406 2025-12-30T00:00:00Z 2026-07-23T00:00:00Z Vladimir M. StojanovicTommaso CalarcoAndrea Muratori

We explore the feasibility of realizing Dicke states in qubit arrays with always-on isotropic Heisenberg coupling between adjacent qubits, assuming a single Zeeman-type control acting in the $z$ direction on an actuator qubit. The Lie-algebraic criteria of controllability imply that such an array is not completely controllable, but satisfies the conditions for subspace controllability on any subspace with a fixed number of excitations. Therefore, a qubit array described by the model under consideration is state-to-state controllable for an arbitrary choice of initial and final states that have the same Hamming weight. This limited controllability is exploited here for the time-efficient dynamical generation of an $a$-excitation Dicke state $|D^{N}_{a}\rangle$ ($a=1,2,\ldots, N-1$) in a linear array with $N$ qubits starting from a generic Hamming-weight-$a$ product state. To dynamically generate the desired Dicke states -- including $W$ states $|W_{N}\rangle$ as their special ($a=1$) case -- in the shortest possible time with a single local $Z$ control, we employ an optimal-control scheme based on the {\em dressed chopped random basis} (dCRAB) algorithm. We optimize the target-state fidelity over the expansion coefficients of smoothly-varying control fields in a truncated random Fourier basis; this is done by combining Nelder-Mead-type local optimizations with the multistart-based clustering algorithm that facilitates searches for global extrema. In this manner, we obtain the optimal control fields for Dicke-state preparation in arrays with up to $9$ qubits. Based on our numerical results, we find that the shortest possible state-preparation times scale as $\mathcal{O}(N^{2.08})$ for $W$ states and $\mathcal{O}(N^{1.78})$ for $a=2$ Dicke states.

https://arxiv.org/abs/2512.20357 2025-12-23T00:00:00Z 2025-12-23T00:00:00Z R. F. dos SantosServaas Kokkelmans

The evolution of a quantum system under time-dependent driving exhibits phenomena that are absent in its stationary counterpart. However, the high dimensionality and non-commutative nature of quantum dynamics make this a challenging problem. The Magnus expansion provides an analytic framework to approximate the effective dynamics on short time-scales, but computing high-order terms with existing methods is computationally expensive. We introduce a scalable approach that reduces the computational effort to depend only on the degrees of freedom defining the time-dependent control function. We focus specifically on Hamiltonians consisting of a constant drift term and a controllable term. Our method provides a polynomial expression for the Magnus expansion which can be evaluated several orders of magnitude faster than previous techniques, enabling broad applications in the realms of quantum simulation and quantum optimal control. We showcase an application of the method by designing control pulses for the 5-qubit phase gate on a neutral-atom platform utilizing Rydberg atoms.

https://arxiv.org/abs/2512.13384 2025-12-15T00:00:00Z 2025-12-16T00:00:00Z Lukas BeringerMathias SteinhuberKlaus RichterSteven Tomsovic

Using the key properties of chaos, i.e. ergodicity and exponential instability, as a resource to control classical dynamics has a long and considerable history. However, in the context of controlling "chaotic" quantum unitary dynamics, the situation is far more tenuous. The classical concepts of exponential sensitivity to trajectory initial conditions and ergodicity do not directly translate into quantum unitary evolution. Nevertheless properties inherent to quantum chaos can take on those roles: i) the dynamical sensitivity to weak perturbations, measured by the fidelity decay, serves a similar purpose as the classical sensitivity to initial conditions; and ii) paired with the fact that quantum chaotic systems are conjectured to be statistically described by random matrix theory, implies a method to translate the ergodic feature into the control of quantum dynamics. With those two properties, it can be argued that quantum chaotic dynamical systems, in principle, allow for full controllability beyond a characteristic time that scales only logarithmically with system size and $\hbar^{-1}$. In the spirit of classical targeting, it implies that it is possible to fine tune the immense quantum interference with weak perturbations and steer the system from any initial state into any desired target state, subject to constraints imposed by conserved quantities. In contrast, integrable dynamics possess neither ergodicity nor exponential instability, and thus the weak perturbations apparently must break the integrability for control purposes. The main ideas are illustrated with the quantum kicked rotor. The production of revivals, cat-like entangled states, and the transition from any random state to any other random state is possible as demonstrated.

https://arxiv.org/abs/2511.06940 2025-11-10T00:00:00Z 2025-11-10T00:00:00Z Tim HeibAndreea Silvia GoiaSona BaghiyanRobert ZeierDavid Edward Bruschi

We study, classify, and explore the mathematical properties of finite-dimensional Lie algebras occurring in the quantum dynamics of single-mode and self-interacting bosonic systems. These Lie algebras are contained in the real skew-hermitian Weyl algebra $\hat{A}_1$, defined as the real subalgebra of the Weyl algebra $A_1$ consisting of all skew-hermitian polynomials. A central aspect of our analysis is the choice of basis for $\hat{A}_1$, which is composed of skew-symmetric combinations of two elements of the Weyl algebra called monomials, namely strings of creation and annihilation operators combined with their hermitian conjugate. Motivated by the quest for analytical solutions in quantum optimal control and dynamics, we aim at answering the following three fundamental questions: (i) What are the finite-dimensional Lie subalgebras in $\hat{A}_1$ generated by monomials alone? (ii)~What are the finite-dimensional Lie subalgebras in $\hat{A}_1$ that contain the free Hamiltonian? (iii) What are the non-abelian and finite-dimensional Lie subalgebras that can be faithfully realized in $\hat{A}_1$? We answer the first question by providing all possible realizations of all finite-dimensional non-abelian Lie algebras that are generated by monomials alone. We answer the second question by proving that any non-abelian and finite-dimensional subalgebra of $\hat{A}_1$ that contains a free Hamiltonian term must be a subalgebra of the Schrödinger algebra. We partially answer the third question by classifying all nilpotent and non-solvable Lie algebras that can be realized in $\hat{A}_1$, and comment on the remaining cases. Finally, we also discuss the implications of our results for quantum control theory. Our work constitutes an important stepping stone to understanding quantum dynamics of bosonic systems in full generality.

https://arxiv.org/abs/2511.04354 2025-11-06T00:00:00Z 2026-08-16T00:00:00Z Yaru LiuYucheng Wang

The Mpemba effect, where a state farther from equilibrium relaxes faster than one closer to it, is a striking phenomenon in both classical and quantum systems. In open quantum systems, however, the quantum Mpemba effect (QME) typically occurs only for specifically chosen initial states, which limits its universality. Here we present a general and experimentally feasible strategy to realize both QME and anti-QME. By applying a temporary bond-dissipation quench, we selectively suppresses or enhances slow relaxation modes, thereby reshaping relaxation pathways independently of both the system and the initial state. We demonstrate this mechanism in systems with dephasing and boundary dissipation, and outline feasible cold-atom implementations. Our results establish controllable dissipation as a versatile tool for quantum control, accelerated relaxation, and efficient nonequilibrium protocols.

https://arxiv.org/abs/2510.19397 2025-10-22T00:00:00Z 2026-03-18T00:00:00Z Javier Álvarez-VizosoDavid Barral

The decomposition of arbitrary unitary transformations into sequences of simpler, physically realizable operations is a foundational problem in quantum information science, quantum control, and linear optics. We establish a 1D Quantum Field Theory model for justifying the universality of a broad class of such factorizations. We consider parametrizations of the form $U = D_1 V_1 D_2 V_2 \cdots V_{M-1}D_M$, where $\{D_j\}$ are programmable diagonal unitary matrices and $\{V_j\}$ are fixed mixing matrices. By leveraging concepts like the anomalies of our effective model, we establish universality criteria given the set of mixer matrices. This approach yields a rigorous proof grounded in physics for the conditions required for the parametrization to cover the entire group of special unitary matrices. This framework provides a unified method to verify the universality of various proposed architectures and clarifies the nature of the ``generic'' mixers required for such constructions. We also provide a deterministic algorithm for verifying this genericity condition and a geometry-aware optimization method for finding the parameters of a decomposition.

https://arxiv.org/abs/2510.14461 2025-10-16T00:00:00Z 2025-10-16T00:00:00Z Karine BeauchardRémi CarlesEugenio Pozzoli

We consider Schr{ö}dinger equations with logarithmic nonlinearity and bilinear controls, posed on $\mathbb{T}^d$ or $\mathbb{R}^d$. We prove their small-time global $L^2$-approximate controllability. The proof consists in extending to this nonlinear framework the approach introduced by the first and third authors in \cite{beauchard-pozzoli2} to control the linear equation: it combines the small-time controllability of phases and gradient flows. Due to the nonlinearity, the required estimates are more difficult to establish than in the linear case. The proof here is inspired by WKB analysis. This is the first result of (small-time) global approximate controllability, for nonlinear Schr{ö}dinger equations, with bilinear controls.

https://arxiv.org/abs/2508.20512 2025-08-28T00:00:00Z 2026-06-26T00:00:00Z Shoki SugimotoTakahiro SagawaRyusuke Hamazaki

Extracting useful work from quantum systems is a fundamental problem in quantum thermodynamics. In scenarios where rapid protocols are desired -- whether due to practical constraints or deliberate design choices -- a fundamental trade-off between power and efficiency is yet to be established. Here, we investigate the problem of finite-time optimal work extraction from closed quantum systems, subject to a constraint on the magnitude of the control Hamiltonian. We first reveal the trade-off relation between power and work under a general setup, showing that these fundamental performance metrics cannot be maximized simultaneously. We then identify a solvable class of finite-time optimal work-extraction problems. This class includes nontrivial many-body models such as the Heisenberg model and the SU(n)-Hubbard model. The key assumption is that the control Hamiltonian is optimized over a Lie algebra preserved by the uncontrolled dynamics. Within this class, the optimal work-extraction problem admits an exact reduction to a nonlinear self-consistent equation, circumventing extensive search over time-dependent control paths. The resulting optimal protocol turns out to be particularly simple: it suffices to use a time-independent control Hamiltonian in the interaction picture, determined by that equation. By exploiting the Lie-algebraic structure of the controllable terms, our approach is applicable to quantum many-body systems through efficient numerical computation. Our results highlight the necessity of rapid protocols to achieve the maximum power and provide an exact route to finite-time optimal work extraction in many-body quantum systems.

https://arxiv.org/abs/2507.14691 2025-07-19T00:00:00Z 2025-11-21T00:00:00Z Fernando Gago-EncinasChristiane P. Koch

Universal quantum computing requires the ability to perform every unitary operation, i.e., evolution operator controllability. In view of developing resource-efficient quantum processing units (QPUs), it is important to determine how many local controls and qubit-qubit couplings are required for controllability. Unfortunately, assessing the controllability of large qubit arrays is a difficult task, due to the exponential scaling of Hilbert space dimension. Here we show that it is sufficient to connect two qubit arrays that are evolution operator controllable by a single entangling two-qubit gate in order to obtain a composite qubit array that is evolution operator controllable. The proof provides a template to build up modular QPUs from smaller building blocks with reduced numbers of local controls and couplings. We illustrate the approach with two examples, consisting of 10, respectively 127 qubits, inspired by IBM quantum processors.

https://arxiv.org/abs/2506.10067 2025-06-11T00:00:00Z 2026-10-01T00:00:00Z Andrew A. AlloccaDevesh K. VermaSriram GaneshanJustin H. Wilson

We investigate universal features of measurement-and-feedback control of quantum chaotic dynamics by examining the quantum Arnold cat map, a paradigmatic model of quantum chaos. Inspired by probabilistic control of classical chaos, our protocol stochastically alternates between intrinsic instability and engineered control operations that steer trajectories toward a target point. Simulation of exact quantum dynamics and a semiclassical truncated Wigner approximation reveal universal properties of the cat map's control transition. To further characterize this universality, we introduce the inverted harmonic oscillator as an analytically tractable effective model of instability. By integrating numerical simulations, a semiclassical Fokker-Planck description, and a direct spectral analysis of the stochastic quantum channel, we identify quantum signatures absent in classical limits. The close agreement between quantum simulation, truncated Wigner approximation, and inverted oscillator analysis shows that universal features of the transition are set by uncertainty-limited quantum fluctuations and are insensitive to genuine quantum interference.

https://arxiv.org/abs/2506.01120 2025-06-01T00:00:00Z 2025-06-01T00:00:00Z Yutaro Iiyama

Finding the Lie-algebraic closure of a handful of matrices has important applications in quantum computing and quantum control. For most realistic cases, the closure cannot be determined analytically, necessitating an explicit numerical construction. The standard construction algorithm makes repeated calls to a subroutine that determines whether a matrix is linearly independent from a potentially large set of matrices. Because the common implementation of this subroutine has a high complexity, the construction of Lie closure is practically limited to trivially small matrix sizes. We present efficient alternative methods of linear independence check that simultaneously reduce the computational complexity and memory footprint. An implementation of one of the methods is validated against known results. Our new algorithms enable numerical studies of Lie closure in larger system sizes than was previously possible.

https://arxiv.org/abs/2504.17303 2025-04-24T00:00:00Z 2026-02-02T00:00:00Z Ruikang LiangEugenio PozzoliMonika LeibscherMario SigalottiChristiane P. KochUgo Boscain

We provide a sufficient condition for the controllability of a bilinear closed quantum system steered by a static field and a time-varying field, based on the notion of weakly conically connected spectrum. More precisely, we show that if a controlled Hamiltonian with two inputs has a weakly conically connected spectrum, then, freezing one of the two inputs at almost every constant value, the obtained single-input system is controllable. The result is illustrated with two examples, enantio-selective excitation in a chiral molecule and the driven Jaynes-Cummings Hamiltonian.

https://arxiv.org/abs/2504.04883 2025-04-07T00:00:00Z 2025-12-24T00:00:00Z Jihong CaiAdvith GovindarajanMarius Junge

We study controllability of finite-dimensional open quantum systems under a general Markovian control model combining full coherent (unitary) control with tunable dissipative channels. Assuming the Hamiltonian controls is a Hörmander system that generate $\mathfrak{su}(n)$, we ask how little dissipation suffices to make the full state space $\mathcal{D}(\mathcal{H})$ controllable. We show that minimal non-unital noise can break unitary-orbit invariants and, in many cases, a very small set of jump operators yields transitivity on $\mathcal{D}(\mathcal{H})$. For multi-qubit systems we prove explicit transitivity results for natural resources such as a single-qubit amplitude-damping jump together with a dephasing channel, and we identify obstructions when only self-adjoint jump operators are available (yielding only unital evolutions). We further develop a geometric viewpoint and ask the ``lifting'' question: when can a path of densities be obtained from applying a time-dependent family of Lindbladian to an initial state? For this, we have to analyze the tangent structure of the ``manifold with corners'' and how this tangent structure reflects Lindbldian evolution. Building on this framework, we derive reachability criteria and no-go results based on a norm-decrease alignment condition, including a geometric obstruction arising from the incompatibility between admissible tangent directions and dissipative contraction.