arXiv subjects

Bharath Sambasivam

Publications and source records attributed to Bharath Sambasivam.

16 recordsLinked to original sources

arXiv2026

A Case Study on Noise Resilient Operator Selection in Adaptive Variational Quantum Algorithms

Hardware noise has been shown to significantly impact the accuracy of ADAPT-VQE, a ground state preparation algorithm. While previous work has studied the impact of noise on its parameter optimization step, its impact on the critical operator selection step remains comparatively unexplored. In this work, we examine the impact of a variety of noise channels on this step, using a linear H$_3$ molecule as a test case. We show that, despite the selection criterion's natural resilience to some noise, both coherent and incoherent noise can prevent convergence for sufficiently high noise rates. We employ quantum error mitigation techniques--dynamical decoupling, zero noise extrapolation, and Pauli twirling--and show that when combined appropriately, these techniques are capable of restoring a successful convergence profile. Our results highlight how error mitigation can improve the performance of ADAPT-VQE and enable convergence in the presence of hardware noise, offering valuable insights into the implementation of the algorithm on near-term quantum hardware.

quant-ph↗

arXiv2026

An efficient algorithm for approximate shadow Hamiltonian simulation

We propose an efficient algorithm based on shadow Hamiltonian simulation to approximately simulate the real-time dynamics of observables under time-independent Hamiltonians. Shadow Hamiltonian simulation works at the level of the operator algebra generated by the observables through commutators with the Hamiltonian. Exactly encoding the quantum state in this picture is generally inefficient for interacting systems due to the exponential growth of the operator algebra. Our algorithm overcomes this bottleneck by systematically identifying the elements of the algebra most relevant to the target observables. This targeted approach is a controlled approximation that yields a highly efficient quantum state encoding that substantially reduces the size of the qubit register required to perform the time evolution using the shadow Hamiltonian. We propose two main pruning schemes, one based on a predefined operator basis and another on a constructed Krylov basis. We also present a hybrid scheme that builds a Krylov basis within a pruned algebra in the predefined basis. We benchmark our algorithm using lattice spin systems in one and two dimensions, for both one- and higher-point correlators as observables.

quant-ph↗

arXiv2026

Quantum simulation of molecular excited-state manifolds and energies using the TEPID-ADAPT-VQE algorithm

The simulation of molecular excited states is a key challenge in quantum chemistry and a promising application for quantum computing. In this work, we investigate the efficacy of the truncated eigenvalue parametrized initial density adaptive variational algorithm (TEPID-ADAPT-VQE) for computing low-lying excited states and potential energy surfaces. TEPID-ADAPT variationally diagonalizes a truncated low-temperature Gibbs state, enabling the simultaneous preparation of multiple excited states within a single optimization. We apply the method to H$_2$, LiH, and linear H$_4$ across bond lengths spanning weakly and strongly correlated regimes. The adaptive derivative-assembled problem-tailored (ADAPT) ansatz construction yields compact circuits suitable for near-term hardware. We also implement a modified version of the MORE-ADAPT-VQE algorithm for comparison with TEPID-ADAPT. We find that both algorithms accurately reproduce excited-state spectra and potential energy curves within chemical accuracy for all the molecules and geometries studied. However, TEPID-ADAPT has the advantage of utilizing only a single, physically motivated hyperparameter (temperature) that controls the energy scale at which excited states are targeted, while MORE-ADAPT utilizes multiple hyperparameters whose optimal values depend sensitively on the target problem. These results demonstrate that combining adaptive ansatz construction with density-matrix-based formulations provides an efficient framework for excited-state quantum chemistry on near-term devices.

quant-ph↗

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

Continuous-variable ADAPT-VQE for bosonic lattice models

We present a continuous-variable adaptive variational quantum eigensolver (CV-ADAPT-VQE). As concrete examples, we consider the ground-state preparation for (i) the Bose-Hubbard model and (ii) the bosonic Kitaev chain, including its extension with an on-site Kerr interaction. The former conserves the total boson number, while the latter conserves global parity. We construct symmetry-preserving operator pools tailored to each case and show, using GPU-based classical simulations, that CV-ADAPT-VQE results in significantly shallower circuits compared to Hamiltonian-based VQE approaches. Our results point toward direct applications in quantum simulations of condensed-matter systems, quantum chemistry, and high-energy physics.

quant-ph↗

arXiv2026

TIMES-ADAPT: A Quantum algorithm for real-time evolution in low-energy subspaces using fixed-depth circuits

We propose a new variational quantum algorithm, which we refer to as TIMES-ADAPT, that prepares time-evolved states in a low-energy or symmetric subspace of a time-independent Hamiltonian on a quantum computer. Using a specially trained unitary that diagonalizes the Hamiltonian in a subspace, we construct fixed-depth circuits for real-time evolution in the subspace, where time only enters as a circuit parameter. We present two versions of the algorithm depending on whether the initial state is specified in the energy eigenbasis or computational basis. We consider two important applications of our methods: wave packet evolution and energy transport in spin systems. We benchmark our algorithms using variants of the Heisenberg XXZ model.

quant-ph↗

arXiv2025

Strategies for Overcoming Gradient Troughs in the ADAPT-VQE Algorithm

The adaptive derivative-assembled problem-tailored variational quantum eigensolver (ADAPT-VQE) provides a promising approach for simulating highly correlated quantum systems on quantum devices, as it strikes a balance between hardware efficiency, trainability, and accuracy. Although ADAPT-VQE avoids many of the shortcomings of other VQEs, it is sometimes hindered by a phenomenon known as gradient troughs. This refers to a non-monotonic convergence of the gradients, which may become very small even though the minimum energy has not been reached. This results in difficulties finding the right operators to add to the ansatz, due to the limited number of shots and statistical uncertainties, leading to stagnation in the circuit structure optimization. In this paper, we propose ways to detect and mitigate this phenomenon. Leveraging the non-commutative algebra of the ansatz, we develop heuristics for determining where to insert new operators into the circuit. We find that gradient troughs are more likely to arise when the same locations are used repeatedly for new operator insertions. Our novel protocols, which add new operators in different ansatz positions, allow us to escape gradient troughs and thereby lower the measurement cost of the algorithm. This approach achieves an effective balance between cost and efficiency, leading to faster convergence without compromising the low circuit depth and gate count of ADAPT-VQE.

quant-ph↗

arXiv2025

TEPID-ADAPT: Adaptive variational method for simultaneous preparation of low-temperature Gibbs and low-lying eigenstates

Preparing Gibbs states, which describe systems in equilibrium at finite temperature, is of great importance, particularly at low temperatures. In this work, we propose a new method -- TEPID-ADAPT -- that prepares the thermal Gibbs state of a given Hamiltonian at low temperatures using a variational method that is partially adaptive and uses a purification with a minimal number of ancillary qubits. We also present an alternative implementation without ancillary qubits. A key technical innovation here is to use a mixed-state ansatz where the entropy can be efficiently calculated, with no computational overhead. Our algorithm uses a truncated, parametrized eigenspectrum of the Hamiltonian. Beyond preparing Gibbs states, this approach also straightforwardly gives us access to the truncated low-energy eigenspectrum of the Hamiltonian, making it also a method that prepares excited states simultaneously. As a result of this, we are also able to prepare thermal states at any lower temperature of the same Hamiltonian without further optimization.

quant-ph↗

arXiv2025

Cosmological Quasiparticles and the Cosmological Collider

The interplay between cosmology and strongly coupled dynamics can yield transient spectral features that vanish at late times, but which may leave behind phenomenological signatures in the spectrum of primordial fluctuations. Of particular interest are strongly coupled extensions of the standard model featuring approximate conformal invariance. In flat space, the spectral density for a scalar operator in a conformal field theory is characterized by a continuum with scaling law governed by the dimension of the operator, and is otherwise featureless. AdS/CFT arguments suggest that for large $N$, in an inflationary background with Hubble rate $H$, this continuum is gapped. We demonstrate that there can be additional peak structures that become sharp and particle-like at phenomenologically interesting regions in parameter space, and we estimate their contribution to cosmological observables. We find phenomena that are potentially observable in future experiments that are unique to these models, including displaced oscillatory features in the squeezed limit of the bi-spectrum. These particles can be either fundamental, and localized to a UV brane, or composite at the Hubble scale, $H$, and bound to a horizon in the bulk of the 5D geometry. We comment on how stabilization of conformal symmetry breaking vacua can be correlated with these spectral features and their phenomenology.

astro-ph.CO↗

arXiv2024

Thermal state preparation of the SYK model using a variational quantum algorithm

We study the preparation of thermal states of the dense and sparse Sachdev-Ye-Kitaev (SYK) model using a variational quantum algorithm for $6 \le N \le 12$ Majorana fermions over a wide range of temperatures. Utilizing IBM's 127-qubit quantum processor, we perform benchmark computations for the dense SYK model with $N = 6$, showing good agreement with exact results. The preparation of thermal states of a non-local random Hamiltonian with all-to-all coupling using the simulator and quantum hardware represents a significant step toward future computations of thermal out-of-time order correlators in quantum many-body systems.

quant-ph↗

arXiv2024

Sachdev-Ye-Kitaev model on a noisy quantum computer

We study the SYK model -- an important toy model for quantum gravity on IBM's superconducting qubit quantum computers. By using a graph-coloring algorithm to minimize the number of commuting clusters of terms in the qubitized Hamiltonian, we find the gate complexity of the time evolution using the first-order product formula for $N$ Majorana fermions is $\mathcal{O}(N^5 J^{2}t^2/ε)$ where $J$ is the dimensionful coupling parameter, $t$ is the evolution time, and $ε$ is the desired precision. With this improved resource requirement, we perform the time evolution for $N=6, 8$ with maximum two-qubit circuit depth of 343. We perform different error mitigation schemes on the noisy hardware results and find good agreement with the exact diagonalization results on classical computers and noiseless simulators. In particular, we compute return probability after time $t$ and out-of-time order correlators (OTOC) which is a standard observable of quantifying the chaotic nature of quantum systems.

quant-ph↗

arXiv2023

Quantum Simulation of an Open System: A Dissipative 1+1D Ising Model

The 1+1D Ising model is an ideal benchmark for quantum algorithms, as it is very well understood theoretically. This is true even when expanding the model to include complex coupling constants. In this work, we implement quantum algorithms designed for the simulation of open or complex coupling quantum field theories on IBM devices with a focus on the measurement of the Lee-Yang edge singularity. This feature corresponds (at large volumes) to a phase transition, and our successful reproduction of the transition represents a non-trivial test for current hardware and its ability to distinguish features of interest in quantum field theories.

quant-ph↗

arXiv2023

New Horizons in the Holographic Conformal Phase Transition

We describe cosmological solutions of the holographic dilaton with the aim of exploring alternatives to the commonly studied thermal Randall-Sundrum phase transition. It is well known that the thermal transition is typically strongly first order, with the requirement of a perturbative 5D gravity theory obstructing completion of the transition. This thermal transition corresponds to nucleation of an infrared brane through the surface of an AdS-Schwarzschild horizon. The approach we study instead invokes an early epoch in which the cosmology is fully 5-dimensional, with highly relativistic brane motion, and with Rindler horizons obscuring the infrared brane at early times. Our approach corresponds, via AdS/CFT, to a non-equilibrium approach to the conformal phase transition. We comment on a class of initial conditions that generically leads to completion of the phase transition without sacrificing perturbativity of the 5D theory.

hep-ph↗

arXiv2020

Quantum Algorithms for Open Lattice Field Theory

Certain aspects of some unitary quantum systems are well-described by evolution via a non-Hermitian effective Hamiltonian, as in the Wigner-Weisskopf theory for spontaneous decay. Conversely, any non-Hermitian Hamiltonian evolution can be accommodated in a corresponding unitary system + environment model via a generalization of Wigner-Weisskopf theory. This demonstrates the physical relevance of novel features such as exceptional points in quantum dynamics, and opens up avenues for studying many body systems in the complex plane of coupling constants. In the case of lattice field theory, sparsity lends these channels the promise of efficient simulation on standardized quantum hardware. We thus consider quantum operations that correspond to Suzuki-Lee-Trotter approximation of lattice field theories undergoing non-Hermitian time evolution, with potential applicability to studies of spin or gauge models at finite chemical potential, with topological terms, to quantum phase transitions - a range of models with sign problems. We develop non-Hermitian quantum circuits and explore their promise on a benchmark, the quantum one-dimensional Ising model with complex longitudinal magnetic field, showing that observables can probe the Lee-Yang edge singularity. The development of attractors past critical points in the space of complex couplings indicates a potential for study on near-term noisy hardware.

hep-lat↗

arXiv2020

Investigating saturation effects in ultraperipheral collisions at the LHC with the color dipole model

We investigate saturation effects in $ep$ scattering as well as in ultraperipheral $p$A and AA collisions at small $x$ with four variants of the impact parameter dependent color dipole model: with and without gluon saturation and with and without a novel mechanism that suppresses unphysical dipole radii above the confinement scale, a problem not addressed by most implementations. We show that $ep$ scattering at HERA can be very well described by any of the four variants. When going from $ep$ to $e$A scattering, saturation effects are expected to increase as $\sim$A$^{1/3}$. In lieu of an electron-ion collider, we confront the different versions of the dipole model with data recorded in ultraperipheral collisions at the LHC in order to estimate the sensitivity of the data to gluon saturation in the target nuclei. We find that ultraperipheral PbPb collisions indicate strong saturation effects while $p$Pb collisions turn out to not have any discriminating power to distinguish saturation from non-saturation scenarios.

hep-ph↗

arXiv2017

Smallest eigenvalue density for regular or fixed-trace complex Wishart-Laguerre ensemble and entanglement in coupled kicked tops

The statistical behaviour of the smallest eigenvalue has important implications for systems which can be modeled using a Wishart-Laguerre ensemble, the regular one or the fixed trace one. For example, the density of the smallest eigenvalue of the Wishart-Laguerre ensemble plays a crucial role in characterizing multiple channel telecommunication systems. Similarly, in the quantum entanglement problem, the smallest eigenvalue of the fixed trace ensemble carries information regarding the nature of entanglement. For real Wishart-Laguerre matrices, there exists an elegant recurrence scheme suggested by Edelman to directly obtain the exact expression for the smallest eigenvalue density. In the case of complex Wishart-Laguerre matrices, for finding exact and explicit expressions for the smallest eigenvalue density, existing results based on determinants become impractical when the determinants involve large-size matrices. In this work, we derive a recurrence scheme for the complex case which is analogous to that of Edelman's for the real case. This is used to obtain exact results for the smallest eigenvalue density for both the regular, and the fixed trace complex Wishart-Laguerre ensembles. We validate our analytical results using Monte Carlo simulations. We also study scaled Wishart-Laguerre ensemble and investigate its efficacy in approximating the fixed-trace ensemble. Eventually, we apply our result for the fixed-trace ensemble to investigate the behaviour of the smallest eigenvalue in the paradigmatic system of coupled kicked tops.

math-ph↗