Searcharxiv⌕ Search

arXiv subjects

Kiratholly Nandakumar Madhav Sharma

Publications and source records attributed to Kiratholly Nandakumar Madhav Sharma.

3 recordsLinked to original sources

Heat transport in weakly anharmonic Fermi-Pasta-Ulam-Tsingou chains

We investigate anomalous heat transport in the one-dimensional $β$-Fermi--Pasta--Ulam--Tsingou chain in the weakly anharmonic regime using large-scale equilibrium molecular dynamics. By resolving the heat current into phonon-mode contributions, we show that its long-time autocorrelation is controlled by diagonal mode correlations, whose decay is quantitatively determined by the corresponding phonon damping rates. Extrapolation to the thermodynamic limit gives $Γ_k \propto (βT)^{4/3} k^{5/3}$, with a subleading $k^2$ correction. The latter produces an extended pre-asymptotic regime, $C(t) \sim t^{-4/5}$, before the asymptotic decay $C(t) \sim t^{-3/5}$ is reached, leading to $κ(N) \sim N^{2/5} + O(N^{1/5})$. At weak anharmonicity, off-diagonal mode correlations persist up to a characteristic time $τ_{\mathrm{od}} \sim (βT)^{-2}$, while increasingly large systems are required to resolve the long-wavelength phonon contribution. Weak anharmonicity therefore does not introduce a distinct asymptotic transport mechanism, but shifts the onset of the phonon-dominated regime to progressively longer times and larger length scales.

cond-mat.stat-mech↗

Digital Quantum Simulation of the quantum $β$-FPUT Lattice: Formulation and Resource Estimation

Heat conduction in low-dimensional systems exhibits strong deviations from Fourier behavior due to anharmonicity and long-lived vibrational correlations, challenging conventional computational approaches. The $β$-Fermi--Pasta--Ulam--Tsingou ($β$-FPUT) chain provides a minimal nonlinear lattice model for studying anomalous transport, yet its quantum real-time dynamics remain difficult to access with classical methods. We develop a first-quantized digital quantum-simulation framework for the quantum $β$-FPUT lattice, targeting fault-tolerant quantum computers. By working directly with discretized lattice displacements rather than truncated phonon occupation spaces, the approach captures anharmonic interactions while avoiding bosonic encoding overheads. We construct Trotterized circuit blocks for real-time evolution and introduce a Hermitian quadrature decomposition of Fourier-mode displacement operators that enables shallow quantum circuits for mode-resolved displacement correlators. We analyze the quantum resources required for the full simulation and measurement workflow, providing qubit counts, gate complexity, circuit-depth and resource estimates as functions of system size and resolution within a fault-tolerant workflow. These results establish a concrete algorithmic blueprint for simulating quantum transport dynamics in nonlinear low-dimensional lattice models on fault-tolerant quantum hardware.

quant-ph↗

Quantum state preparation for bell-shaped probability distributions using deconvolution methods

Quantum systems are a natural choice for generating probability distributions due to the phenomena of quantum measurements. The data that we observe in nature from various physical phenomena can be modelled using quantum circuits. To load this data, which is mostly in the form of a probability distribution, we present a hybrid classical-quantum approach. The classical pre-processing step is based on the concept of deconvolution of discrete signals. We use the Jensen-Shannon distance as the cost function to quantify the closeness of the outcome from the classical step and the target distribution. The chosen cost function is symmetric and allows us to perform the deconvolution step using any appropriate optimization algorithm. The output from the deconvolution step is used to construct the quantum circuit required to load the given probability distribution, leading to an overall reduction in circuit depth. The deconvolution step splits a bell-shaped probability mass function into smaller probability mass functions, and this paves the way for parallel data processing in quantum hardware, which consists of a quantum adder circuit as the penultimate step before measurement. We tested the algorithm on IBM Quantum simulators and on the IBMQ Kolkata quantum computer, having a 27-qubit quantum processor. We validated the hybrid Classical-Quantum algorithm by loading two different distributions of bell shape. Specifically, we loaded 7 and 15-element PMF for (i) Standard Normal distribution and (ii) Laplace distribution.

quant-ph↗