187 citations · 944 across the 36 of their papers we have counts for
8 papers · 1 filter
Unconventional early-time relaxation in the Rydberg chain
Martin Schnee, Roya Radgohar, Stefanos Kourtis
We show that unconventional relaxation dynamics of special initial states in one-dimensional arrays of Rydberg atoms produce non-generic decay of the initial-state survival probabi…
Tensor networks for -spin models
Benjamin Lanthier, Jeremy Côté, Stefanos Kourtis
We introduce a tensor network algorithm for the solution of -spin models. We show that bond compression through rank-revealing decompositions performed during the tensor network…
Nonuniversal Entanglement Level Statistics in Projection-driven Quantum Circuits
Lei Zhang, Justin A. Reyes, Stefanos Kourtis +3
We study the level-spacing statistics in the entanglement spectrum of output states of random universal quantum circuits where qubits are subject to a finite probability of project…
Obstacles to quantum annealing in a planar embedding of XORSAT
Pranay Patil, Stefanos Kourtis, Claudio Chamon +2
We introduce a planar embedding of the k-regular k-XORSAT problem, in which solutions are encoded in the ground state of a classical statistical mechanics model of reversible logic…
Ultra-slow dynamics in a translationally invariant spin model for multiplication and factorization
Lei Zhang, Stefanos Kourtis, Claudio Chamon +2
We construct a model of short-range interacting Ising spins on a translationally invariant two-dimensional lattice that mimics a reversible circuit that multiplies or factorizes in…
Evaluating the Jones polynomial with tensor networks
Konstantinos Meichanetzidis, Stefanos Kourtis
We introduce tensor network contraction algorithms for the evaluation of the Jones polynomial of arbitrary knots. The value of the Jones polynomial of a knot maps to the partition…
Fast counting with tensor networks
Stefanos Kourtis, Claudio Chamon, Eduardo R. Mucciolo +1
We introduce tensor network contraction algorithms for counting satisfying assignments of constraint satisfaction problems (#CSPs). We represent each arbitrary #CSP formula as a te…
Tensor network method for reversible classical computation
Zhi-Cheng Yang, Stefanos Kourtis, Claudio Chamon +2
We develop a tensor network technique that can solve universal reversible classical computational problems, formulated as vertex models on a square lattice [Nat. Commun. 8, 15303 (…