Publications

Order by: publication date number of citations

• Pivoting through the chiral-clock family

  Nick G. Jones, Abhishodh Prakash, Paul Fendley

  SciPost Phys. 18, 094 (2025) · published 14 March 2025 | Toggle abstract · pdf

  The Onsager algebra, invented to solve the two-dimensional Ising model, can be used to construct conserved charges for a family of integrable $N$-state chiral clock models. We show how it naturally gives rise to a "pivot" procedure for this family of chiral Hamiltonians. These Hamiltonians have an anti-unitary CPT symmetry that when combined with the usual $\mathbb{Z}_N$ clock symmetry gives a non-Abelian dihedral symmetry group $D_{2N}$. We show that this symmetry gives rise to symmetry-protected topological (SPT) order in this family for all even $N$, and representation-SPT (RSPT) physics for all odd $N$. The simplest such example is a next-nearest-neighbour chain generalising the spin-1/2 cluster model, an SPT phase of matter. We derive a matrix-product state representation of its fixed-point ground state along with the ensuing entanglement spectrum and symmetry fractionalisation. We analyse a rich phase diagram combining this model with the Onsager-integrable chiral Potts chain, and find trivial, symmetry-breaking and (R)SPT orders, as well as extended gapless regions. For odd $N$, the phase transitions are "unnecessarily" critical from the SPT point of view.

  4 citations

• Stochastic series expansion quantum Monte Carlo for Rydberg arrays

  Ejaaz Merali, Isaac J. S. De Vlugt, Roger G. Melko

  SciPost Phys. Core 7, 016 (2024) · published 5 April 2024 | Toggle abstract · pdf

  Arrays of Rydberg atoms are a powerful platform to realize strongly-interacting quantum many-body systems. A common Rydberg Hamiltonian is free of the sign problem, meaning that its equilibrium properties are amenable to efficient simulation by quantum Monte Carlo (QMC). In this paper, we develop a Stochastic Series Expansion QMC algorithm for Rydberg atoms interacting on arbitrary lattices. We describe a cluster update that allows for the efficient sampling and calculation of physical observables for typical experimental parameters, and show that the algorithm can reproduce experimental results on large Rydberg arrays in one and two dimensions.

  4 citations

• Carrollian $\mathscr Lw_{1+\infty}$ representation from twistor space

  Laura Donnay, Laurent Freidel, Yannick Herfray

  SciPost Phys. 17, 118 (2024) · published 22 October 2024 | Toggle abstract · pdf

  We construct an explicit realization of the action of the $\mathscr Lw_{1+∞}$ loop algebra on fields at null infinity. This action is directly derived by Penrose transform of the geometrical action of $\mathscr Lw_{1+∞}$ symmetries in twistor space, ensuring that it forms a representation of the algebra. Finally, we show that this action coincides with the canonical action of $\mathscr Lw_{1+∞}$ Noether charges on the asymptotic phase space.

  4 citations

• An exact mapping between loop-erased random walks and an interacting field theory with two fermions and one boson

  Assaf Shapira, Kay Jörg Wiese

  SciPost Phys. 9, 063 (2020) · published 4 November 2020 | Toggle abstract · pdf

  We give a simplified proof for the equivalence of loop-erased random walks to a lattice model containing two complex fermions, and one complex boson. This equivalence works on an arbitrary directed graph. Specifying to the $d$-dimensional hypercubic lattice, at large scales this theory reduces to a scalar $\phi^4$-type theory with two complex fermions, and one complex boson. While the path integral for the fermions is the Berezin integral, for the bosonic field we can either use a complex field $\phi(x)\in \mathbb C$ (standard formulation) or a nilpotent one satisfying $\phi(x)^2 =0$. We discuss basic properties of the latter formulation, which has distinct advantages in the lattice model.

  4 citations

• Higher-genus Fay-like identities from meromorphic generating functions

  Konstantin Baune, Johannes Broedel, Egor Im, Artyom Lisitsyn, Yannis Moeckli

  SciPost Phys. 18, 093 (2025) · published 14 March 2025 | Toggle abstract · pdf

  A possible way of constructing polylogarithms on Riemann surfaces of higher genera facilitates integration kernels, which can be derived from generating functions incorporating the geometry of the surface. Functional relations among polylogarithms rely on identities for those integration kernels. In this article, we derive identities for Enriquez' meromorphic generating function and investigate the implications for the associated integration kernels. The resulting identities are shown to be exhaustive and therefore reproduce all identities for Enriquez' kernels conjectured in arXiv:2407.11476 recently.

  4 citations

• (1,0) gauge theories on the six-sphere

  Usman Naseer

  SciPost Phys. 6, 002 (2019) · published 8 January 2019 | Toggle abstract · pdf

  We construct gauge theories with a vector-multiplet and hypermultiplets of $(1,0)$ supersymmetry on the six-sphere. The gauge coupling on the sphere depends on the polar angle. This has a natural explanation in terms of the tensor branch of $(1,0)$ theories on the six-sphere. For the vector-multiplet we give an off-shell formulation for all supersymmetries. For hypermultiplets we give an off-shell formulation for one supersymmetry. We show that the path integral for the vector-multiplet localizes to solutions of the Hermitian-Yang-Mills equation, which is a generalization of the (anti-)self duality condition to higher dimensions. For the hypermultiplet, the path integral localizes to configurations where the field strengths of two complex scalars are related by an almost complex structure.

  4 citations

• Temporal fluctuations of correlators in integrable and chaotic quantum systems

  Talía L. M. Lezama, Yevgeny Bar Lev, Lea F. Santos

  SciPost Phys. 15, 244 (2023) · published 18 December 2023 | Toggle abstract · pdf

  We provide bounds on temporal fluctuations around the infinite-time average of out-of-time-ordered and time-ordered correlators of many-body quantum systems without energy gap degeneracies. For physical initial states, our bounds predict the exponential decay of the temporal fluctuations as a function of the system size. We numerically verify this prediction for chaotic and interacting integrable spin-1/2 chains, which satisfy the assumption of our bounds. On the other hand, we show analytically and numerically that for the XX model, which is a noninteracting system with gap degeneracies, the temporal fluctuations decay polynomially with system size for operators that are local in the fermion representation and decrease exponentially in the system size for non-local operators. Our results demonstrate that the decay of the long-time temporal fluctuations of correlators cannot be used as a reliable metric of chaos or lack thereof.

  4 citations

• Tunable dispersion of the edge states in the integer quantum Hall effect

  Maik Malki, Götz S. Uhrig

  SciPost Phys. 3, 032 (2017) · published 29 October 2017 | Toggle abstract · pdf

  Topological aspects represent currently a boosting area in condensed matter physics. Yet there are very few suggestions for technical applications of topological phenomena. Still, the most important is the calibration of resistance standards by means of the integer quantum Hall effect. We propose modifications of samples displaying the integer quantum Hall effect which render the tunability of the Fermi velocity possible by external control parameters such as gate voltages. In this way, so far unexplored possibilities arise to realize devices such as tunable delay lines and interferometers.

  4 citations

• QArray: A GPU-accelerated constant capacitance model simulator for large quantum dot arrays

  Barnaby van Straaten, Joseph Hickie, Lucas Schorling, Jonas Schuff, Federico Fedele, Natalia Ares

  SciPost Phys. Codebases 35 (2024) · published 21 October 2024 | Toggle abstract · pdf

  Semiconductor quantum dot arrays are a leading architecture for the development of quantum technologies. Over the years, the constant capacitance model has served as a fundamental framework for simulating, understanding, and navigating the charge stability diagrams of small quantum dot arrays. However, while the size of the arrays keeps growing, solving the constant capacitance model becomes computationally prohibitive. This paper presents an open-source software package able to compute a $100 × 100$ pixels charge stability diagram of a 16-dot array in less than a second. Smaller arrays can be simulated in milliseconds - faster than they could be measured experimentally, enabling the creation of diverse datasets for training machine learning models and the creation of digital twins that can interface with quantum dot devices in real-time. Our software package implements its core functionalities in the systems programming language Rust and the high-performance numerical computing library JAX. The Rust implementation benefits from advanced optimisations and parallelisation, enabling the users to take full advantage of multi-core processors. The JAX implementation allows for GPU acceleration.

  4 citations

• Codebase release 1.2 for YASTN

  Marek M. Rams, Gabriela Wójtowicz, Aritra Sinha, Juraj Hasik

  SciPost Phys. Codebases 52-r1.2 (2025) · published 26 February 2025 | Toggle abstract · src

  We present an open-source tensor network Python library for quantum many-body simulations. At its core is an Abelian-symmetric tensor, implemented as a sparse block structure managed by a logical layer on top of a dense multidimensional array backend. This serves as the basis for higher-level tensor network algorithms operating on matrix product states and projected entangled pair states. An appropriate backend, such as PyTorch, gives direct access to automatic differentiation (AD) for cost-function gradient calculations and execution on GPU and other supported accelerators. We show the library performance in simulations with infinite projected entangled-pair states, such as finding the ground states with AD and simulating thermal states of the Hubbard model via imaginary time evolution. For these challenging examples, we identify and quantify sources of the numerical advantage exploited by the symmetric-tensor implementation.

  4 citations