A common technique in the study of complex quantum-mechanical systems is to reduce the number of degrees of freedom in the Hamiltonian by using quasi-degenerate perturbation theory. While the Schrieffer-Wolff transformation achieves this and constructs an effective Hamiltonian, its scaling is suboptimal, it is limited to two subspaces, and implementing it efficiently is both challenging and error-prone. We introduce an algorithm for constructing an equivalent effective Hamiltonian as well as a Python package, Pymablock, that implements it. Our algorithm combines an optimal asymptotic scaling and the ability to handle any number of subspaces with a range of other improvements. The package supports numerical and analytical calculations of any order and it is designed to be interoperable with any other packages for specifying the Hamiltonian. We demonstrate how the package handles constructing a k.p model, analyses a superconducting qubit, and computes the low-energy spectrum of a large tight-binding model. We also compare its performance with reference calculations and demonstrate its efficiency.
A common technique in the study of complex quantum-mechanical systems is to reduce the number of degrees of freedom in the Hamiltonian by using quasi-degenerate perturbation theory. While the Schrieffer-Wolff transformation achieves this and constructs an effective Hamiltonian, its scaling is suboptimal, it is limited to two subspaces, and implementing it efficiently is both challenging and error-prone. We introduce an algorithm for constructing an equivalent effective Hamiltonian as well as a Python package, Pymablock, that implements it. Our algorithm combines an optimal asymptotic scaling and the ability to handle any number of subspaces with a range of other improvements. The package supports numerical and analytical calculations of any order and it is designed to be interoperable with any other packages for specifying the Hamiltonian. We demonstrate how the package handles constructing a k.p model, analyses a superconducting qubit, and computes the low-energy spectrum of a large tight-binding model. We also compare its performance with reference calculations and demonstrate its efficiency.
A common technique in the study of complex quantum-mechanical systems is to reduce the number of degrees of freedom in the Hamiltonian by using quasi-degenerate perturbation theory. While the Schrieffer-Wolff transformation achieves this and constructs an effective Hamiltonian, its scaling is suboptimal, it is limited to two subspaces, and implementing it efficiently is both challenging and error-prone. We introduce an algorithm for constructing an equivalent effective Hamiltonian as well as a Python package, Pymablock, that implements it. Our algorithm combines an optimal asymptotic scaling and the ability to handle any number of subspaces with a range of other improvements. The package supports numerical and analytical calculations of any order and it is designed to be interoperable with any other packages for specifying the Hamiltonian. We demonstrate how the package handles constructing a k.p model, analyses a superconducting qubit, and computes the low-energy spectrum of a large tight-binding model. We also compare its performance with reference calculations and demonstrate its efficiency.
The Schrieffer-Wolff transformation aims to solve degenerate perturbation problems and give an effective Hamiltonian that describes the low-energy dynamics of the exact Hamiltonian in the low-energy subspace of an unperturbed Hamiltonian. This unitary transformation decoupling the low-energy and high-energy subspaces for the transformed Hamiltonian can be realized by quantum circuits. We give a fully quantum algorithm for realizing the SW transformation. We also propose a hybrid quantum-classical algorithm for finding the effective Hamiltonian on NISQ hardware, where a general cost function is used to indicate the decoupling degree. Numerical simulations without or with noise and experiments on quantum computer ibmq_manila are implemented for a Heisenberg chain model. Our results verify the algorithm and show its validity on near-term quantum computers.
The Schrieffer-Wolff transformation (SWT) is a foundational perturbative method for deriving effective Hamiltonians in quantum systems by systematically eliminating couplings between pairs of energy distant subspaces. Despite recent advancements, the implementation of SWTs for sufficiently complex systems remains computationally challenging and often requires extensive calculations that are prone to errors. In this work, we introduce an analytical software tool, SymPT (Symbolic Perturbation Theory), designed to automate the SWT and its extensions. Building on a universal framework developed in recent research, SymPT provides a systematic and generalizable solution for deriving the generator of the transformation, enabling accurate computation of effective Hamiltonians for arbitrary perturbative systems. The tool supports both time-independent and time-periodic Hamiltonians, extending beyond standard SWT to incorporate arbitrary coupling elimination, block-diagonalization and full-diagonalization routines, thus enabling precise handling of systems with intricate energy structures.
Perturbative gadgets are general techniques for reducing many-body spin interactions to two-body ones using perturbation theory. This allows for potential realization of effective many-body interactions using more physically viable two-body ones. In parallel with prior work (arXiv:1311.2555 [quant-ph]), here we consider minimizing the physical resource required for implementing the gadgets initially proposed by Kempe, Kitaev and Regev (arXiv:quant-ph/0406180) and later generalized by Jordan and Farhi (arXiv:0802.1874v4). The main innovation of our result is a set of methods that efficiently compute tight upper bounds to errors in the perturbation theory. We show that in cases where the terms in the target Hamiltonian commute, the bounds produced by our algorithm are sharp for arbitrary order perturbation theory. We provide numerics which show orders of magnitudes improvement over gadget constructions based on trivial upper bounds for the error term in the perturbation series. We also discuss further improvement of our result by adopting the Schrieffer-Wolff formalism of perturbation theory and supplement our observation with numerical results.
This thesis develops structure-preserving methods to control and compile quantum evolutions with provable guarantees. In quantum dynamics, a fundamental resource is coherence maintained within a designated subspace; leakage – population transfer out of that subspace – is a major source of error that demands robust methods for its suppression and control. For example, maintaining the evolution within the computational (logical) subspace in quantum computing is essential for practical quantum information processing. On the dynamics side, we study adiabatic evolution under weak perturbations through effective-Hamiltonian frames. Using Bloch wave operators and Schrieffer-Wolff constructions, we obtain block-diagonal generators and prove that their evolutions remain uniformly close to the true dynamics. Moreover, we establish time-independent (“eternal”) bounds on spectral leakage that scale as 𝑂(𝛾−1) in the weak-coupling regime, where 𝛾 is the dimensionless ratio between the strength of the strong system Hamiltonian and the weak drive. The analysis covers both finite-dimensional, time-dependent settings and a novel coarse-grained framework that accommodates continuous spectra and even unbounded Hamiltonians, enabling applications to banded tight-binding models and superconducting-qubit architectures. Optimising quantum algorithms for reduced depth or fewer non-error-corrected physical gates is also key to mitigating leakage. We therefore formulate quantum compiling as exact or approximate unitary synthesis up to a physically irrelevant global phase and solve it via mixed-integer linear programming (MILP). The formulation supports multiple objectives (depth, two-qubit gate count, non-Clifford cost) and provides theoretical guarantees of optimality. To the best of our knowledge, this is the first MILP formulation that targets circuit depth directly, rather than minimising gate counts and inferring depth retroactively. The model explores the algebraic structure of the problem in order to accelerate the solver through symmetry breaking, redundancy elimination, and other mathematically sound constraints. To scale beyond exact global optimisation, we introduce a rolling-horizon strategy that compiles circuits in overlapping windows. An open-source implementation, written in the Julia language and released as QuantumCircuitOpt.jl, provides these capabilities to facilitate further research. In both cases, similarity transformations and algebraic identities reduce complexity while focusing attention on the spectral/target content, and both yield quantitative guarantees. Collectively, these contributions confront leakage, the key threat to coherent, in-subspace computation, with the ultimate aim of getting error-resilient qubits to work.
We introduce version 2.0 of the SmoQyDQMC.jl package, a Julia implementation of the determinant quantum Monte Carlo algorithm. SmoQyDQMC.jl supports generalized tight-binding Hamiltonians with local and extended Hubbard and generalized electron-phonon (e-ph) interactions, including non-linear e-ph coupling and anharmonic lattice potentials. Our implementation uses an optimized hybrid Monte Carlo method with exact forces to efficiently sample the phonon fields, enabling the simulation of low-energy phonon branches, including acoustic phonons. The SmoQyDQMC.jl package also uses a flexible scripting interface, allowing users to adapt it to different workflows and interface with other software packages in the Julia ecosystem. The code for this package can be downloaded from our GitHub repository at https://github.com/SmoQySuite/ SmoQyDQMC.jl or installed using the Julia package manager. The online documentation, including examples, is found at https://smoqysuite.github.io/SmoQyDQMC.jl/stable/.