Publications

Order by: publication date number of citations

A perturbation theory for multi-time correlation functions in open quantum systems

Piotr Szańkowski

SciPost Phys. 19, 066 (2025) · published 3 September 2025 | · pdf

Dynamical maps are the principal subject of the open system theory. Formally, the dynamical map of a given open quantum system is a density matrix transformation that takes any initial state and sends it to the state at a later time. Physically, it encapsulates the system's evolution due to coupling with its environment. Hence, the theory provides a flexible and accurate framework for computing expectation values of open system observables. However, expectation values-or more generally, single-time correlation functions-capture only the simplest aspects of a quantum system's dynamics. A complete characterization of the dynamics requires access to multi-time correlation functions as well: phenomena like detailed balance, linear and non-linear response, non-equilibrium transport in general, or even sequential measurements of system observables are all described in terms of multi-time correlations. For closed systems, such correlations are well-defined, even though knowledge of the system's state alone is insufficient to determine them fully. In contrast, the standard dynamical map formalism for open systems does not account for multi-time correlations, as it is fundamentally limited to describing state evolution. Here, we extend the scope of open quantum system theory by developing a systematic perturbation theory for computing multi-time correlation functions.
The fermionic double smeared null energy condition

Duarte Fragoso, Lihan Guo

SciPost Phys. Core 8, 045 (2025) · published 26 June 2025 | · pdf

Energy conditions are crucial for understanding why exotic phenomena such as traversable wormholes and closed timelike curves remain elusive. In this paper, we prove the Double Smeared Null Energy Condition (DSNEC) for the fermionic free theory in 4-dimensional flat Minkowski spacetime, extending previous work on the same energy condition for the bosonic case [J. R. Fliss and B. Freivogel, SciPost Phys. 12, 084 (2022); J. R. Fliss et al., SciPost Phys. 14, 024 (2023)] by adapting Fewster and Mistry's method [C. J. Fewster and B. Mistry, Phys. Rev. D 68, 105010 (2003)] to the energy-momentum tensor $T_{++}$. A notable difference from previous works lies in the presence of the $\gamma_0 \gamma_+$ matrix in $T_{++}$, causing a loss of symmetry. This challenge is addressed by making use of its square-root matrix. We provide explicit analytic results for the massless case as well as numerical insights for the mass-dependence of the bound in the case of Gaussian smearing.
Energy-saving fast-forward scaling

Takuya Hatomura

SciPost Phys. Core 8, 019 (2025) · published 11 February 2025 | · pdf

We propose energy-saving fast-forward scaling. Fast-forward scaling is a method which enables us to speed up (or slow down) given dynamics in a certain measurement basis. We introduce energy costs of fast-forward scaling, and find possibility of energy-saving speedup for time-independent measurement bases. As concrete examples, we show such energy-saving fast-forward scaling in a two-level system and quantum annealing of a general Ising spin glass. We also discuss the influence of a time-dependent measurement basis, and give a remedy for unwanted energy costs. The present results pave the way for realization of energy-efficient quantum technologies.
Quenching a Fermi superfluid across the BEC-BCS crossover

Moritz Breyer, Daniel Eberz, Andreas Kell, Michael Köhl

SciPost Phys. 18, 053 (2025) · published 14 February 2025 | · pdf

We study the response of a Fermi superfluid to a rapid change of the interaction strength. For a broad range of quench parameters, the order parameter exhibits damped oscillations, however, we also identify quench regimes in which these oscillations are absent. By comparing our data to a numerical model we find that the damping time constants are explainable by a dephasing in a local density approximation, however, the oscillation frequencies, while being comparable to the superconducting order parameter, display in detail significant differences to the integrable BCS (Bardeen-Cooper-Schrieffer) model.
A correspondence between the Rabi model and an Ising model with long-range interactions

Bruno Scheihing-Hitschfeld, Néstor Sepúlveda

SciPost Phys. 19, 153 (2025) · published 15 December 2025 | · pdf

By means of Trotter's formula, we show that transition amplitudes between a class of generalized coherent states in the Rabi model can be understood in terms of a certain Ising model featuring long-range interactions beyond nearest neighbors in its thermodynamic limit. Specifically, we relate the transition amplitudes in the Rabi model to a sum over binary variables of the form of a partition function of an Ising model with a number of spin sites equal to the number of steps in Trotter's formula applied to the real-time evolution of the Rabi model. From this, we show that a perturbative expansion in the energy splitting of the two-level subsystem in the Rabi model is equivalent to an expansion in the number of spin domains in the Ising model. We conclude by discussing how calculations in one model give nontrivial information about the other model, and vice versa, as well as applications and generalizations this correspondence may find.
A graph-theoretic approach to chaos and complexity in quantum systems

Maxwell West, Neil Dowling, Angus Southwell, Martin Sevior, Muhammad Usman, Kavan Modi, Thomas Quella

SciPost Phys. Core 8, 081 (2025) · published 10 November 2025 | · pdf

There has recently been considerable interest in studying quantum systems via dynamical Lie algebras (DLAs) – Lie algebras generated by the terms which appear in the Hamiltonian of the system. However, there are some important properties that are revealed only at a finer level of granularity than the DLA. In this work we explore, via the commutator graph, average notions of scrambling, chaos and complexity over ensembles of systems with DLAs that possess a basis consisting of Pauli strings. Unlike DLAs, commutator graphs are sensitive to short-time dynamics, and therefore constitute a finer probe to various characteristics of the corresponding ensemble. We link graph-theoretic properties of the commutator graph to the out-of-time-order correlator (OTOC), the frame potential, the frustration graph of the Hamiltonian of the system, and the Krylov complexity of operators evolving under the dynamics. For example, we reduce the calculation of average OTOCs to a counting problem on the graph; separately, we connect the Krylov complexity of an operator to the module structure of the adjoint action of the DLA on the space of operators in which it resides, and prove that its average over the ensemble is lower bounded by the average shortest path length between the initial operator and the other operators in the commutator graph.
Polynomial computational complexity of matrix elements of finite-rank-generated single-particle operators in products of finite bosonic states

Dmitri A. Ivanov

SciPost Phys. Core 7, 022 (2024) · published 22 April 2024 | · pdf

It is known that computing the permanent of the matrix 1+A, where A is a finite-rank matrix, requires a number of operations polynomial in the matrix size. Motivated by the boson-sampling proposal of restricted quantum computation, I extend this result to a generalization of the matrix permanent: An expectation value in a product of a large number of identical bosonic states with a bounded number of bosons. This result complements earlier studies on the computational complexity in boson sampling and related setups. The proposed technique based on the Gaussian averaging is equally applicable to bosonic and fermionic systems. This also allows us to improve an earlier polynomial complexity estimate for the fermionic version of the same problem.
Non-adiabatic linear response in open quantum systems

Xiaotian Nie, Wei Zheng

SciPost Phys. 19, 161 (2025) · published 19 December 2025 | · pdf

Adiabatic theorem and non-adiabatic corrections have been widely applied in modern quantum technology. Recently, non-adiabatic linear response theory has been developed to probe the many-body correlations in closed systems. In this work, we generalize the non-adiabatic linear response theory to open quantum many-body systems. We show that, similar to the closed case, the first-order deviation from the instantaneous steady state is memoryless—it depends only on the final parameters and not on the initial state or ramping path. When ramping the Hamiltonian, the linear response of observables is governed by the derivative of the retarded Green's function, as in closed systems. In contrast, ramping the dissipation gives rise to a different response, characterized by a high-order correlation function defined in the steady state. Our results offer a compact and physically transparent formulation of non-adiabatic response in open systems, and demonstrate that ramping dynamics can serve as a versatile tool for probing many-body correlations beyond equilibrium.
Fast tensor disentangling algorithm

Kevin Slagle

SciPost Phys. 11, 056 (2021) · published 13 September 2021 | · pdf

Many recent tensor network algorithms apply unitary operators to parts of a tensor network in order to reduce entanglement. However, many of the previously used iterative algorithms to minimize entanglement can be slow. We introduce an approximate, fast, and simple algorithm to optimize disentangling unitary tensors. Our algorithm is asymptotically faster than previous iterative algorithms and often results in a residual entanglement entropy that is within 10 to 40% of the minimum. For certain input tensors, our algorithm returns an optimal solution. When disentangling order-4 tensors with equal bond dimensions, our algorithm achieves an entanglement spectrum where nearly half of the singular values are zero. We further validate our algorithm by showing that it can efficiently disentangle random 1D states of qubits.
Extending the planar theory of anyons to quantum wire networks

Tomasz Maciazek, Mia Conlon, Gert Vercleyen, J. K. Slingerland

SciPost Phys. 18, 074 (2025) · published 28 February 2025 | · pdf

The braiding of the worldlines of particles restricted to move on a network (graph) is governed by the graph braid group, which can be strikingly different from the standard braid group known from two-dimensional physics. It has been recently shown that imposing the compatibility of graph braiding with anyon fusion for anyons exchanging at a single wire junction leads to new types of anyon models with the braiding exchange operators stemming from solutions of certain generalised hexagon equations. In this work, we establish these graph-braided anyon fusion models for general wire networks. We show that the character of braiding strongly depends on the graph-theoretic connectivity of the given network. In particular, we prove that triconnected networks yield the same braiding exchange operators as the planar anyon models. In contrast, modular biconnected networks support independent braiding exchange operators in different modules. Consequently, such modular networks may lead to more efficient topological quantum computer circuits. Finally, we conjecture that the graph-braided anyon fusion models will possess the (generalised) coherence property where certain polygon equations determine the braiding exchange operators for an arbitrary number of anyons. We also extensively study solutions to these polygon equations for chosen low-rank multiplicity-free fusion rings, including the Ising theory, quantum double of $\mathbb{Z}_{2}$, and Tambara-Yamagami models. We find numerous solutions that do not appear in the planar theory of anyons.

Previous 1 ... 69 70 71 72 73 74 75 76 77 78 79 Next