activity
20172025
most citedGlobal Dipole Symmetry, Compact Lifshitz Theory, Tensor Gauge Theory, and Fractons

111 citations · 612 across the 20 of their papers we have counts for

collaborators

20 papers

cond-mat.str-el2025

Deformed LDPC codes with spontaneously broken non-invertible duality symmetries

Pranay Gorantla, Tzu-Chen Huang

Low-density parity check (LDPC) codes are a well known class of Pauli stabiliser Hamiltonians that furnish fixed-point realisations of nontrivial gapped phases such as symmetry bre…

cond-mat.str-el2025★ 3 cited

String-Membrane-Nets from Higher-Form Gauging: An Alternate Route to -String Condensation

Pranay Gorantla, Abhinav Prem, Nathanan Tantivasadakarn +1

We present a new perspective on the -string condensation procedure for constructing 3+1D fracton phases by implementing this process via the gauging of higher-form symmetries. S…

cond-mat.str-el2024★ 1 cited

Entanglement renormalization of fractonic anisotropic Laplacian models

Yuan Xue, Pranay Gorantla, Zhu-Xi Luo

Gapped fracton phases constitute a new class of quantum states of matter which connects to topological orders but does not fit easily into existing paradigms. They host unconventio…

cond-mat.str-el2024★ 5 cited

Duality-preserving deformation of 3+1d lattice gauge theory with exact gapped ground states

Pranay Gorantla, Tzu-Chen Huang

We propose and analyze a deformation of the 3+1d lattice gauge theory that preserves the non-invertible Wegner duality symmetry at the self-dual point. We identify a…

quant-ph2024★ 13 cited

Tensor networks for non-invertible symmetries in 3+1d and beyond

Pranay Gorantla, Shu-Heng Shao, Nathanan Tantivasadakarn

Tensor networks provide a natural language for non-invertible symmetries in general Hamiltonian lattice models. We use ZX-diagrams, which are tensor network presentations of quantu…

math.CO2023

On the size of maximum cut in planar graphs

Pranay Gorantla, Santhoshini Velusamy

We show that the size of maximum cut in a planar graph with edges is at least . We also show that maximal planar graphs saturate this bound.