arXiv subjects

Lilith Zschetzsche

Publications and source records attributed to Lilith Zschetzsche.

3 recordsLinked to original sources

arXiv2026

Complexity of Quadratic Bosonic Hamiltonian Simulation: $\mathsf{BQP}$-Completeness and $\mathsf{PostBQP}$-Hardness

The computational complexity of simulating the dynamics of physical quantum systems is a central question at the interface of quantum physics and computer science. In this work, we address this question for the simulation of exponentially large bosonic Hamiltonians with quadratic interactions. We present two results: First, we introduce a broad class of quadratic bosonic problems for which we prove that they are $\mathsf{BQP}$-complete. Importantly, this class includes two known $\mathsf{BQP}$-complete problems as special cases: Classical oscillator networks and continuous-time quantum walks. Second, we show that extending the aforementioned class to even more general quadratic Hamiltonians results in a $\mathsf{PostBQP}$-hard problem. This reveals a sharp transition in the complexity of simulating large quantum systems on a quantum computer, as well as in the difference in complexity between their simulation on classical and quantum computers.

quant-ph↗

arXiv2025

Direct Equivalence between Dynamics of Quantum Walks and Coupled Classical Oscillators

Continuous time quantum walks on exponentially large, sparse graphs form a powerful paradigm for quantum computing: On the one hand, they can be efficiently simulated on a quantum computer. On the other hand, they are themselves BQP-complete, providing an alternative framework for thinking about quantum computing -- a perspective which has indeed led to a number of novel algorithms and oracle problems. Recently, simulating the dynamics of a system of harmonic oscillators (that is, masses and springs) was set forth as another BQP-complete problem defined on exponentially large, sparse graphs. In this work, we establish a direct and transparent mapping between these two classes of problems. As compared to linking the two classes of problems via their BQP-completeness, our mapping has several desirable features: It is transparent, in that it respects the structure of the problem, including the geometry of the underlying graph, initialization, read-out, and efficient oracle access, resulting in low overhead in terms of both space and time; it allows to map also between restricted subsets of instances of both problems which are not BQP-complete; it provides a recipe to directly translate any quantum algorithm designed in the quantum walk paradigm to harmonic oscillators (and vice versa); and finally, it provides an alternative, transparent way to prove BQP-completeness of the harmonic oscillator problem by mapping it to BQP-completeness construction for the quantum walk problem (or vice versa).

quant-ph↗

arXiv2023

Suppression of polaron self-localization by correlations

We investigate self-localization of a polaron in a homogeneous Bose-Einstein condensate in one dimension. This effect, where an impurity is trapped by the deformation that it causes in the surrounding Bose gas, has been first predicted by mean field calculations, but has not been seen in experiments. We study the system in one dimension, where, according to the mean field approximation, the self-localization effect is particularly robust, and present for arbitrarily weak impurity-boson interactions. We address the question whether self-localization is a real effect by developing a variational method which incorporates impurity-boson correlations non-perturbatively and solving the resulting inhomogeneous correlated polaron equations. We find that correlations inhibit self-localization except for very strongly repulsive or attractive impurity-boson interactions. Our prediction for the critical interaction strength for self-localization agrees with a sharp drop of the inverse effective mass to almost zero found in quantum Monte Carlo simulations of polarons in one dimension.

cond-mat.quant-gas↗