arXiv subjects

Pingal Pratyush Nath

Publications and source records attributed to Pingal Pratyush Nath.

8 recordsLinked to original sources

arXiv2026

Classical Shadows with Selective GHZ Measurements

Classical shadows allow the prediction of many quantum-state properties from measurement data, but their efficiency strongly depends on the underlying measurement ensemble. We introduce selective GHZ measurement (SGM) shadows, which perform Greenberger-Horne-Zeilinger (GHZ)-basis measurements on randomly selected subsets of qubits and computational-basis measurements on their complement. The corresponding quantum circuits are practically feasible, with their number of CNOT gates scaling linearly with the number of qubits. This is in stark contrast to global Clifford circuits, which are generally difficult to implement. Varying the subset distribution allows tuning the SGM shadow protocol for different classes of observables with prescribed X/Y support, allowing us to outperform local Pauli as well as global Clifford shadows in certain scenarios. We determine the exact shadow channel and its inverse for arbitrary subset distributions and prove an explicit bound on the shadow norm using methods from discrete Fourier analysis and Markov semigroup theory. For natural choices of subset distributions, this gives a polynomial scaling for observables with fixed X/Y-locality. Numerical simulations of up to 50 qubits support the predicted improvements for nonlocal observables and long-range systems, and demonstrate the practical benefits of our protocol's generality by showing how the subset distributions can be tailored to settings such as fermionic modes under the Jordan-Wigner transformation.

quant-ph↗

arXiv2026

Quantum complexity and localization in random and time-periodic unitary circuits

We study the growth and saturation of complexity in Krylov basis in random quantum circuits. In Haar-random unitary evolution, we show that, for large system sizes, this notion of complexity grows linearly before saturating at a late-time value of $d/2$, where $d$ is the Hilbert space dimension, at timescales $\sim d$. Our numerical analysis encompasses two classes of random circuits: brick-wall random unitary circuits and Floquet random circuits. In brick-wall case, complexity in Krylov basis exhibits dynamics consistent with Haar-random unitary evolution, while the inclusion of measurements significantly slows its growth down. For Floquet random circuits, we show that localized phases lead to reduced late-time saturation values of the complexity enabling us to probe the transition between thermal and many-body localized phases.

quant-ph↗

arXiv2025

Krylov complexity for non-local spin chains

Building upon recent research in spin systems with non-local interactions, this study investigates operator growth using the Krylov complexity in different non-local versions of the Ising model. We find that the non-locality results in a faster scrambling of the operator to all sites. While the saturation value of Krylov complexity of local integrable and local chaotic theories differ by a significant margin, this difference is much suppressed when non-local terms are introduced in both regimes. This results from the faster scrambling of information in the presence of non-locality. In addition, we investigate the behavior of level statistics and spectral form factor as probes of quantum chaos to study the integrability breaking due to non-local interactions. Our numerics indicate that in the non-local case, late time saturation of Krylov complexity distinguishes between different underlying theories, while the early time complexity growth distinguishes different degrees of non-locality.

quant-ph↗

arXiv2025

Speed limits to the growth of Krylov complexity in open quantum systems

Recently, the propagation of information through quantum many-body systems, developed to study quantum chaos, have found many application from black holes to disordered spin systems. Among other quantitative tools, Krylov complexity has been explored as a diagnostic tool for information scrambling in quantum many-body systems. We introduce a universal limit to the growth of the Krylov complexity in dissipative open quantum systems by utilizing the uncertainty relation for non-hermitian operators. We also present the analytical results of Krylov complexity for characteristic behavior of Lanczos coefficients in dissipative systems. The validity of these results are demonstrated by explicit study of transverse-field Ising model under dissipative effects.

quant-ph↗

arXiv2025

Certified Random Number Generation using Quantum Computers

In recent decades, quantum technologies have made significant strides toward achieving quantum utility. However, practical applications are hindered by challenges related to scaling the number of qubits and the depth of circuits. In this paper, we investigate how current quantum computers can be leveraged for practical applications, particularly in generating secure random numbers certified by Quantum Mechanics. While random numbers can be generated and certified in a device-independent manner through the violation of Bell's inequality, this method requires significant spatial separation to satisfy the no-signaling condition, making it impractical for implementation on a single quantum computer. Instead, we employ temporal correlations to generate randomness by violating the Leggett-Garg inequality, which relies on the No-Signaling in Time condition to certify randomness, thus overcoming spatial constraints. By applying this protocol to existing quantum computers, we demonstrate the feasibility of secure, semi-device-independent random number generation using low-depth circuits with single-qubit gates.

quant-ph↗

arXiv2024

Single system based generation of certified randomness using Leggett-Garg inequality

We theoretically formulate and experimentally demonstrate a secure scheme for semi-device-independent quantum random number generation by utilizing Leggett-Garg inequality violations, within a loophole-free photonic architecture. The quantification of the generated randomness is rigorously estimated by analytical as well as numerical approaches, both of which are in perfect agreement. We securely generate $9,19,118$ truly unpredictable bits. This opens up an unexplored avenue towards an empirically convenient class of reliable random number generators harnessing the quantumness of single systems.

quant-ph↗

arXiv2023

On Krylov complexity in open systems: an approach via bi-Lanczos algorithm

Continuing the previous initiatives arXiv: 2207.05347 and arXiv: 2212.06180, we pursue the exploration of operator growth and Krylov complexity in dissipative open quantum systems. In this paper, we resort to the bi-Lanczos algorithm generating two bi-orthogonal Krylov spaces, which individually generate non-orthogonal subspaces. Unlike the previously studied Arnoldi iteration, this algorithm renders the Lindbladian into a purely tridiagonal form, thus opening up a possibility to study a wide class of dissipative integrable and chaotic systems by computing Krylov complexity at late times. Our study relies on two specific systems, the dissipative transverse-field Ising model (TFIM) and the dissipative interacting XXZ chain. We find that, for the weak coupling, initial Lanczos coefficients can efficiently distinguish integrable and chaotic evolution before the dissipative effect sets in, which results in more fluctuations in higher Lanczos coefficients. This results in the equal saturation of late-time complexity for both integrable and chaotic cases, making the notion of late-time chaos dubious.

quant-ph↗

arXiv2022

Operator growth and Krylov construction in dissipative open quantum systems

Inspired by the universal operator growth hypothesis, we extend the formalism of Krylov construction in dissipative open quantum systems connected to a Markovian bath. Our construction is based upon the modification of the Liouvillian superoperator by the appropriate Lindbladian, thereby following the vectorized Lanczos algorithm and the Arnoldi iteration. This is well justified due to the incorporation of non-Hermitian effects due to the environment. We study the growth of Lanczos coefficients in the transverse field Ising model (integrable and chaotic limits) for boundary amplitude damping and bulk dephasing. Although the direct implementation of the Lanczos algorithm fails to give physically meaningful results, the Arnoldi iteration retains the generic nature of the integrability and chaos as well as the signature of non-Hermiticity through separate sets of coefficients (Arnoldi coefficients) even after including the dissipative environment. Our results suggest that the Arnoldi iteration is meaningful and more appropriate in dealing with open systems.

quant-ph↗