arXiv subjects

Sabhyata Gupta

Publications and source records attributed to Sabhyata Gupta.

6 recordsLinked to original sources

arXiv2026

Ground state preparation of random all-to-all Hamiltonians using ADAPT-VQE

The ground state of random Hamiltonians with all-to-all interactions such as the quantum Sherrington-Kirkpatrick (SK) model and the Sachdev-Ye-Kitaev (SYK) model follow volume-law entanglement and are expected to be hard to model using tensor networks. In recent years, some progress has been made to push the limit of classical methods using neural quantum states. However, it remains an open question whether there exist quantum algorithms that could offer a quantum advantage over the state-of-the-art classical methods in simulating random Hamiltonians. In this work, we show that one such algorithm, TETRIS-ADAPT-VQE, can construct accurate ground states for dense and sparse SYK models containing up to $N=20$ Majorana fermions achieving fidelities $\geq 99.3\%$ and for the quantum SK model with up to $L=18$ sites achieving fidelities $\geq 99.9998\%$. We find that while the preparation of ground states is efficient (in terms of operator pool size and circuit depth) for the SK model, it is not efficient for either dense or moderately sparse SYK models.

quant-ph↗

arXiv2026

Analog quantum simulation of chiral magnetic dynamics using optical superlattices

We propose an analog quantum simulation of chiral magnetic dynamics using ultracold atoms in an optical superlattice. The massive Schwinger model in the zero gauge coupling limit maps onto the Rice-Mele model, with the fermion mass and topological angle encoded in the superlattice parameters. We study the real-time dynamics of the vector current following two quench protocols that drive continuous chirality injection and chirality relaxation. Simulations with realistic superlattice parameters and experimental noise demonstrates clear mass dependence of the current dynamics in both protocols, robust against experimental imperfections. The vector current may be directly measurable via single-bond-resolved detection, establishing cold atom superlattices as a viable platform for probing non-equilibrium chiral phenomena.

cond-mat.quant-gas↗

arXiv2026

Exact stabilizer scars in two-dimensional $U(1)$ lattice gauge theory

The complexity of highly excited eigenstates is a central theme in nonequilibrium many-body physics, underpining questions of thermalization, classical simulability, and quantum information structure. In this work, considering the paradigmatic Rokhsar-Kivelson model, we connect quantum many-body scarring in Abelian lattice gauge theories to an emergent stabilizer structure. We identify a distinct class of scarred eigenstates, termed sublattice scars, originating from gauge-invariant zero modes that form exact stabilizer states. Remarkably, although the underlying Hamiltonian is not a stabilizer Hamiltonian, its eigenspectrum intrinsically hosts exact stabilizer eigenstates. These sublattice scars exhibit vanishing stabilizer R\'enyi entropy together with finite, highly structured entanglement, enabling efficient classical simulation. Exploiting their stabilizer structure, we construct explicit Clifford circuits that prepare these states in a two-dimensional lattice gauge model. Our results demonstrate that the scarred subspace of the Rokhsar-Kivelson spectrum forms an intrinsic stabilizer manifold, revealing a direct connection between stabilizer quantum information, lattice gauge constraints, and quantum many-body scarring.

quant-ph↗

arXiv2024

Fast generation of Pauli transfer matrices utilizing tensor product structure

Analysis of quantum processes, especially in the context of noise, errors, and decoherence is essential for the improvement of quantum devices. An intuitive representation of those processes modeled by quantum channels are Pauli transfer matrices. They display the action of a linear map in the $n$-qubit Pauli basis in a way, that is more intuitive, since Pauli strings are more tangible objects than the standard basis matrices. We set out to investigate classical algorithms that convert the various representations into Pauli transfer matrices. We propose new algorithms that make explicit use of the tensor product structure of the Pauli basis. They convert a quantum channel in a given representation (Chi or process matrix, Choi matrix, superoperator, or Kraus operators) to the corresponding Pauli transfer matrix. Moreover, the underlying principle can also be used to calculate the Pauli transfer matrix of other linear operations over $n$-qubit matrices such as left-, right-, and sandwich multiplication as well as forming the (anti-)commutator with a given operator. Finally, we investigate the runtime of these algorithms, derive their asymptotic scaling and demonstrate improved performance using instances with up to seven qubits.

quant-ph↗

arXiv2024

Simulation of a Rohksar-Kivelson ladder on a NISQ device

We present a quantum-classical algorithm to study the dynamics of the Rohksar-Kivelson plaquette ladder on NISQ devices. We show that complexity is largely reduced using gauge invariance, additional symmetries, and a crucial property associated to how plaquettes are blocked against ring-exchange in the ladder geometry. This allows for an efficient simulation of sizable plaquette ladders with a small number of qubits, well suited for the capabilities of present NISQ devices. We illustrate the procedure for ladders with simulation of up to $8$ plaquettes in an IBM-Q machine, employing scaled quantum gates.

quant-ph↗

arXiv2023

Tensorized Pauli decomposition algorithm

This paper introduces a novel general-purpose algorithm for Pauli decomposition that employs matrix slicing and addition rather than expensive matrix multiplication, significantly accelerating the decomposition of multi-qubit matrices. In a detailed complexity analysis, we show that the algorithm admits the best known worst-case scaling and more favorable runtimes for many practical examples. Numerical experiments are provided to validate the asymptotic speed-up already for small instance sizes, underscoring the algorithm's potential significance in the realm of quantum computing and quantum chemistry simulations.

quant-ph↗