arXiv subjects

Salini Karuvade

Publications and source records attributed to Salini Karuvade.

10 recordsLinked to original sources

arXiv2026

Blind-spots of Randomized Benchmarking Under Temporal Correlations

Randomized benchmarking (RB) is a widely adopted protocol for estimating the average gate fidelity in quantum hardware. However, its standard formulation relies on the assumption of temporally uncorrelated noise, an assumption often violated in current devices. In this work, we derive analytic expressions for the average sequence fidelity (ASF) in the presence of temporally correlated (non-Markovian) noise with classical memory, including cases where such correlations originate from interactions with a quantum environment. We show how the ASF can be interpreted to extract meaningful benchmarking parameters under such noise and identify classes of interaction Hamiltonians that render temporal correlations completely invisible to RB. We further provide operational criteria for witnessing temporal correlations due to quantum memory through RB experiments. Importantly, while classical correlations may remain undetectable in the ASF data, they can nonetheless significantly affect worst-case errors quantified by the diamond norm, a metric central to fault tolerant quantum computing. In particular, we demonstrate that temporal correlations may suppress worst-case errors highlighting that temporal correlations may not always have detrimental effects on gate performance.

quant-ph↗

arXiv2025

Quantum advantage without exponential concentration: Trainable kernels for symmetry-structured data

Quantum kernel methods promise enhanced expressivity for learning structured data, but their usefulness has been limited by kernel concentration and barren plateaus. Both effects are mathematically equivalent and suppress trainability. We analytically prove that covariant quantum kernels tailored to datasets with group symmetries avoid exponential concentration, ensuring stable variance and guaranteed trainability independent of system size. Our results extend beyond prior two-coset constructions to arbitrary coset families, broadening the scope of problems where quantum kernels can achieve advantage. We further derive explicit bounds under coherent noise models - including unitary errors in fiducial state preparation, imperfect unitary representations, and perturbations in group element selection - and show through numerical simulations that the kernel variance remains finite and robust, even under substantial noise. These findings establish a family of quantum learning models that are simultaneously trainable, resilient to coherent noise, and linked to classically hard problems, positioning group-symmetric quantum kernels as a promising foundation for near-term and scalable quantum machine learning.

quant-ph↗

arXiv2025

Resolvent-based quantum phase estimation: Towards estimation of parametrized eigenvalues

Quantum algorithms for estimating the eigenvalues of matrices, including the phase estimation algorithm, serve as core subroutines in a wide range of quantum algorithms, including those in quantum chemistry and quantum machine learning. The standard quantum eigenvalue (phase) estimation algorithm accepts a Hermitian (unitary) matrix and a state in an unknown superposition of its eigenstates as input, and coherently records the estimates for real eigenvalues (eigenphases) in an ancillary register. Extension of quantum eigenvalue and phase estimation algorithms to the case of non-normal input matrices is obstructed by several factors such as non-orthogonality of eigenvectors, existence of generalized eigenvectors and the fact that eigenvalues may lie anywhere on the complex plane. In this work, we propose a novel approach for estimating the eigenvalues of non-normal matrices based on preparation of a state that we call the "resolvent state". We construct the first efficient algorithm for estimating the phases of the unimodular eigenvalues of a given non-unitary matrix. We then construct an efficient algorithm for estimating the real eigenvalues of a given non-Hermitian matrix, achieving complexities that match the best known results while operating under significantly relaxed assumptions on the non-real part of the spectrum. The resolvent-based approach that we introduce also extends to estimating eigenvalues that lie on a parametrized complex curve, subject to explicitly stated conditions, thereby paving the way for a new paradigm of parametric eigenvalue estimation.

quant-ph↗

arXiv2025

Characterizing noisy quantum computation with imperfectly addressed errors

Quantum protocols on hardware are subject to noise that prohibits performance. Protocols for addressing errors, such as error correction or error mitigation, may fail to combat errors in quantum computation if noise violates critical assumptions required for these protocols to be effective. However, tools for characterizing such failures in realistic operating conditions are limited. For example, while brute force simulations may be used to characterize the impact of such failures on a handful of input states, such simulations lack a complete description for how noise transforms state-spaces in the full quantum Hilbert space. In this work, we associate quantum computation subject to realistic noise to an ensemble of random superoperators and study the eigen- and singular spectral distributions over this ensemble. We propose a new theoretical framework to characterize singular values of random complex matrices using matrix Chernoff concentration. Using our framework, we analyze imperfectly addressed errors in error mitigation and error correction. We find that distributions of singular spectra depend on how noise violates critical assumptions of these protocols. Finally, we quantitatively discuss how our work may be applied to understanding limiting behavior of quantum computation, such as establishing spectral gaps and relaxation times for specific families of quantum Markov processes. Our work paves the way for new tools to diagnose when to trust the output of noisy quantum computers.

quant-ph↗

arXiv2023

Observing a Changing Hilbert-Space Inner Product

In quantum mechanics, physical states are represented by rays in Hilbert space $\mathscr H$, which is a vector space imbued by an inner product $\langle\,|\,\rangle$, whose physical meaning arises as the overlap $\langleϕ|ψ\rangle$ for $|ψ\rangle$ a pure state (description of preparation) and $\langleϕ|$ a projective measurement. However, current quantum theory does not formally address the consequences of a changing inner product during the interval between preparation and measurement. We establish a theoretical framework for such a changing inner product, which we show is consistent with standard quantum mechanics. Furthermore, we show that this change is described by a quantum channel, which is tomographically observable, and we elucidate how our result is strongly related to the exploding topic of PT-symmetric quantum mechanics. We explain how to realize experimentally a changing inner product for a qubit in terms of a qutrit protocol with a unitary channel.

quant-ph↗

arXiv2023

Reply to the Comment on `The operational foundations of PT-symmetric and quasi-Hermitian quantum theory'

This document is our reply to the Comment (Miloslav Znojil 2023 J. Phys. A: Math. Theor. 56, 038001) on our recent work titled `The operational foundations of PT-symmetric and quasi-Hermitian quantum theory'. The original Comment consists of three addenda to our work. The first addendum claims that our work is ill-motivated as the motivating question, namely whether PT-symmetric quantum theory extends the standard quantum theory, was already answered in the literature. The second addendum points to some missing references in our work, and the third addendum suggests what constraints could lead to an extension of standard quantum theory. In our reply, we explain that the claim in the first addendum is a result of a misinterpretation of our motivating question. When interpreted correctly, the third addendum in the Comment in itself elaborates on why our motivating question is interesting and relevant. We also briefly comment on the prospects of an extension of standard quantum theory along the lines suggested in the third addendum. As our response to the second addendum, we explain our rationale behind citing certain references while leaving out others.

quant-ph↗

arXiv2022

The operational foundations of PT-symmetric and quasi-Hermitian quantum theory

PT-symmetric quantum theory was originally proposed with the aim of extending standard quantum theory by relaxing the Hermiticity constraint on Hamiltonians. However, no such extension has been formulated that consistently describes states, transformations, measurements and composition, which is a requirement for any physical theory. We aim to answer the question of whether a consistent physical theory with PT-symmetric observables extends standard quantum theory. We answer this question within the framework of general probabilistic theories, which is the most general framework for physical theories. We construct the set of states of a system that result from imposing PT-symmetry on the set of observables, and show that the resulting theory allows only one trivial state. We next consider the constraint of quasi-Hermiticity on observables, which guarantees the unitarity of evolution under a Hamiltonian with unbroken PT-symmetry. We show that such a system is equivalent to a standard quantum system. Finally, we show that if all observables are quasi-Hermitian as well as PT-symmetric, then the system is equivalent to a real quantum system. Thus our results show that neither PT-symmetry nor quasi-Hermiticity constraints are sufficient to extend standard quantum theory consistently.

quant-ph↗

arXiv2021

Security for Quantum Networks

Reliable and efficient functioning of a quantum network depends on identifying and mitigating security risks originating from within and outside the network. We aim to construct a comprehensive framework for developing and assessing secure quantum networks. We articulate issues for making quantum networks secure in general, summarise the state of the art and identify priority directions for further investigation. Our analysis builds on the secure communication protocols developed for classical layered network architectures such as the open-systems interconnection (OSI) model and the transmission control protocol/internet protocol (TCP/IP) model. Our work will lead to the development of a hardware-independent framework for securing general quantum networks that allows developers to identify mandatory security mechanisms and incorporate additional security requirements of the clients during design of the networks.

quant-ph↗

arXiv2019

Uniquely determined pure quantum states need not be unique ground states of quasi-local Hamiltonians

We consider the problem of characterizing states of a multipartite quantum system from restricted, quasi-local information, with emphasis on uniquely determined pure states. By leveraging tools from dissipative quantum control theory, we show how the search for states consistent with an assigned list of reduced density matrices may be restricted to a proper subspace, which is determined solely by their supports. The existence of a quasi-local observable which attains its unique minimum over such a subspace further provides a sufficient criterion for a pure state to be uniquely determined by its reduced states. While the condition that a pure state is uniquely determined is necessary for it to arise as a non-degenerate ground state of a quasi-local Hamiltonian, we prove the opposite implication to be false in general, by exhibiting an explicit analytic counterexample. We show how the problem of determining whether a quasi-local parent Hamiltonian admitting a given pure state as its unique ground state is dual, in the sense of semidefinite programming, to the one of determining whether such a state is uniquely determined by the quasi-local information. Failure of this dual program to attain its optimal value is what prevents these two classes of states to coincide.

quant-ph↗

arXiv2017

Generic pure quantum states as steady states of quasi-local dissipative dynamics

We investigate whether a generic multipartite pure state can be the unique asymptotic steady state of locality-constrained purely dissipative Markovian dynamics. In the simplest tripartite setting, we show that the problem is equivalent to characterizing the solution space of a set of linear equations and establish that the set of pure states obeying the above property has either measure zero or measure one, solely depending on the subsystems' dimension. A complete analytical characterization is given when the central subsystem is a qubit. In the N-partite case, we provide conditions on the subsystems' size and the nature of the locality constraint, under which random pure states cannot be quasi-locally stabilized generically. Beside allowing for the possibility to approximately stabilize entangled pure states that cannot be exact steady states in settings where stabilizability is generic, our results offer insights into the extent to which random pure states may arise as unique ground states of frustration free parent Hamiltonians. We further argue that, to high probability, pure quantum states sampled from a t-design enjoy the same stabilizability properties of Haar-random ones as long as suitable dimension constraints are obeyed and t is sufficiently large. Lastly, we demonstrate a connection between the tasks of quasi-local state stabilization and unique state reconstruction from local tomographic information, and provide a constructive procedure for determining a generic N-partite pure state based only on knowledge of the support of any two of the reduced density matrices of about half the parties, improving over existing results.

quant-ph↗