arXiv subjects

Tim Pokart

Publications and source records attributed to Tim Pokart.

4 recordsLinked to original sources

arXiv2026

Entanglement Barriers from Computational Complexity: Matrix-Product-State Approach to Satisfiability

We approach the 3-SAT satisfiability problem with the quantum-inspired method of imaginary time propagation (ITP) applied to matrix product states (MPS) on a classical computer. This ansatz is fundamentally limited by a quantum entanglement barrier that emerges in imaginary time, reflecting the exponential hardness expected for this NP-complete problem. Strikingly, we argue based on careful analysis of the structure imprinted onto the MPS by the 3-SAT instances that this barrier arises from classical computational complexity. To reveal this connection, we elucidate with stochastic models the specific relationship between the classical hardness of the $\sharp$P $\supseteq$ NP-complete counting problem $\sharp$3-SAT and the entanglement properties of the quantum state. Our findings illuminate the limitations of this quantum-inspired approach and demonstrate how purely classical computational complexity can manifest in quantum entanglement. Furthermore, we present estimates of the non-stabilizerness required by the protocol, finding a similar resource barrier. Specifically, the necessary amount of non-Clifford operations scales superlinearly in system size, thus implying extensive resource requirements of ITP on different architectures such as Clifford circuits or gate-based quantum computers.

quant-ph↗

arXiv2026

Diffusion in quantum state preparation: From passive cooling to system-bath engineering

We investigate and compare two particle number-conserving protocols for the preparation of a topologically nontrivial state. The first is derived from thermally coupling the system to a cold bath, while the second is based on engineered dissipation. We numerically study the time required to reach the target state as well as its robustness against physically important perturbations. Crucially, in both protocols, the cooling capability is limited by dissipatively induced diffusion processes. The resulting quadratic scaling of the cooling time with system size is also corroborated analytically using mean-field approximations and a purely classical random-walk model. Furthermore, we find that the engineered protocol admits a unique and stable dark state, which contributes to an ongoing discussion regarding the applicability of dissipative state preparation to many-body systems.

cond-mat.quant-gas↗

arXiv2024

Adiabatic preparation of a number-conserving atomic Majorana phase

We construct a protocol to adiabatically prepare the ground state of a widely discussed number-conserving model Hamiltonian for ultracold atoms in optical lattices that supports Majorana edge states. In particular, we introduce a symmetry breaking mass term that amounts to threading a commensurate (artificial) magnetic flux through the plaquettes of the considered two-leg ladder which opens a constant bulk gap. This enables the preparation of the topological Majorana phase from a trivial Mott insulator state with optimal asymptotic scaling of the ramp time in system size, which is linear owing to the critical nature of the target state. Using constructive bosonization techniques that account for both finite size effects and global fermion number conservation, we are able to fully explain with theory the somewhat counterintuitive necessity of the aforementioned commensurate flux for a controlled bulk gap. Our analytical predictions are corroborated and quantified by unbiased numerical matrix product states (MPS) simulations. Directly building up on previous experimental work, the crucial flux-term of the proposed protocol is feasible with state-of-the-art experimental techniques in atomic quantum simulators.

cond-mat.quant-gas↗

arXiv2023

Geometrically Taming Dynamical Entanglement Growth in Purified Quantum States

Entanglement properties of purified quantum states are of key interest for two reasons. First, in quantum information theory, minimally entangled purified states define the Entanglement of Purification as a fundamental measure for the complexity of the corresponding physical mixed state. Second, dynamical entanglement growth in purified states represents the main bottleneck for calculating dynamical physical properties on classical computers in the framework of tensor network states. Here, we demonstrate how geometric methods including parallel transport may be harnessed to reduce such dynamical entanglement growth, and to obtain a general prescription for maintaining (locally) optimal entanglement entropy when time-evolving a purified state. Adapting and extending by higher order skew corrections the notion of Uhlmann geometric phases, we reveal the relation between dynamical entanglement growth and the geometry of the Hilbert-Schmidt bundle as the mathematical foundation of purified states. With benchmarks on a non-integrable spin chain model, we compare the computational performance of matrix product state algorithms based on our present geometric disentangling method to previous approaches for taming entanglement growth in purified states. Our findings provide numerical evidence that geometric disentanglers are a powerful approach, superior in various aspects to known methods for disentangling purified states in a range of physically relevant computational scenarios. To exclude the effect of algorithmic imperfections, we also provide a numerically exact analysis for systems of moderate size.

cond-mat.str-el↗