arXiv subjects

Swati Kumari

Publications and source records attributed to Swati Kumari.

15 recordsLinked to original sources

arXiv2026

Connection between the contextuality breaking and incompatibility breaking qubit channels

Contextuality and measurement incompatibility are two fundamental aspects of nonclassicality, and their manifestations in observed quantum correlations are often deeply interconnected. Recently, measurement incompatibility has been studied in connection with nonlocality, particularly in terms of their robustness under various quantum channels. This line of investigation helps establish a connection between the channels that break nonlocality and those that break incompatibility. In this study, we focus on an asymmetric bipartite Bell scenario involving three and four inputs on Alice and Bob sides, respectively, with each of these inputs having dichotomous outcomes. Under the assumption of locality, the observed statistics in this asymmetric scenario obeys the Elegant Bell inequality (EBI). Here, we use a different version of the EBI that relies on the assumption of the preparation noncontextuality. By taking the violation of this noncontextual version of EBI as a witness of preparation contextuality we establish a connection between the channels that break contextuality and the channels that break triple-wise measurement incompatibility. Our results suggest that any channel which breaks EBI contextuality will also break Clauser-Horne-Shimony-Holt (CHSH) nonlocality; however, the reverse does not hold. We also show that a depolarising channel that breaks N-wise incompatibility can also break a certain form of contextuality, witnessed by a generalised inequality involving N measurements on one wing of a bipartite Bell scenario.

quant-ph↗

arXiv2025

Modeling Wavelet Transformed Quantum Support Vector for Network Intrusion Detection

Network traffic anomaly detection is a critical cybersecurity challenge requiring robust solutions for complex Internet of Things (IoT) environments. We present a novel hybrid quantum-classical framework integrating an enhanced Quantum Support Vector Machine (QSVM) with the Quantum Haar Wavelet Packet Transform (QWPT) for superior anomaly classification under realistic noisy intermediate-scale Quantum conditions. Our methodology employs amplitude-encoded quantum state preparation, multi-level QWPT feature extraction, and behavioral analysis via Shannon Entropy profiling and Chi-square testing. Features are classified using QSVM with fidelity-based quantum kernels optimized through hybrid training with simultaneous perturbation stochastic approximation (SPSA) optimizer. Evaluation under noiseless and depolarizing noise conditions demonstrates exceptional performance: 96.67% accuracy on BoT-IoT and 89.67% on IoT-23 datasets, surpassing quantum autoencoder approaches by over 7 percentage points.

quant-ph↗

arXiv2025

Modeling Quantum Autoencoder Trainable Kernel for IoT Anomaly Detection

Escalating cyber threats and the high-dimensional complexity of IoT traffic have outpaced classical anomaly detection methods. While deep learning offers improvements, computational bottlenecks limit real-time deployment at scale. We present a quantum autoencoder (QAE) framework that compresses network traffic into discriminative latent representations and employs quantum support vector classification (QSVC) for intrusion detection. Evaluated on three datasets, our approach achieves improved accuracy on ideal simulators and on the IBM Quantum hardware demonstrating practical quantum advantage on current NISQ devices. Crucially, moderate depolarizing noise acts as implicit regularization, stabilizing training and enhancing generalization. This work establishes quantum machine learning as a viable, hardware-ready solution for real-world cybersecurity challenges.

cs.LG↗

arXiv2025

OpenCoderRank: Personalized Technical Assessments with Generative AI

Organizations and educational institutions use time-bound assessment tasks to evaluate coding and problem-solving skills. These assessments measure not only the correctness of the solutions, but also their efficiency. Problem setters (educator/interviewer) are responsible for crafting these challenges, carefully balancing difficulty and relevance to create meaningful evaluation experiences. Conversely, problem solvers (student/interviewee) apply critical and logical thinking to arrive at correct solutions. In the era of Large Language Models (LLMs), LLMs assist problem setters in generating diverse and challenging questions, but they can undermine assessment integrity for problem solvers by providing easy access to solutions. We introduce OpenCoderRank, a lightweight, self-hosted platform that emulates real-world timed technical assessments in resource-constrained environments. OpenCoderRank is intentionally model-agnostic: it facilitates the creation, deployment and automatic grading of problems while offering fine-grained control over time limits, input-output pairs and execution constraints. OpenCoderRank is evaluated using two methods: 1. BERTScore, 2. LLM evaluation. Our findings indicate that OpenCoderRank connects problem setters and solvers by supporting time-constrained preparation and self-hosted, customizable assessments in resource-constrained settings.

cs.SE↗

arXiv2025

On the Parameterized Complexity of Odd Coloring

A proper vertex coloring of a connected graph $G$ is called an odd coloring if, for every vertex $v$ in $G$, there exists a color that appears odd number of times in the open neighborhood of $v$. The minimum number of colors required to obtain an odd coloring of $G$ is called the \emph{odd chromatic number} of $G$, denoted by $χ_{o}(G)$. Determining $χ_o(G)$ known to be ${\sf NP}$-hard. Given a graph $G$ and an integer $k$, the \odc{} problem is to decide whether $χ_o(G)$ is at most $k$. In this paper, we study the parameterized complexity of the problem, particularly with respect to structural graph parameters. We obtain the following results: \begin{itemize} \item We prove that the problem admits a polynomial kernel when parameterized by the distance to clique. \item We show that the problem cannot have a polynomial kernel when parameterized by the vertex cover number unless ${\sf NP} \subseteq {\sf Co {\text -} NP/poly}$. \item We show that the problem is fixed-parameter tractable when parameterized by distance to cluster, distance to co-cluster, or neighborhood diversity. \item We show that the problem is ${\sf W[1]}$-hard parameterized by clique-width. \end{itemize} Finally, we study the complexity of the problem on restricted graph classes. We show that it can be solved in polynomial time on cographs and split graphs but remains NP-complete on certain subclasses of bipartite graphs.

cs.DS↗

arXiv2024

Scaffolding fundamentals and recent advances in sustainable scaffolding techniques for cultured meat development

In cultured meat (CM) products the paramount significance lies in the fundamental attributes like texture and sensory of the processed end product. To cater to the tactile and gustatory preferences of real meat, the product needs to be designed to incorporate its texture and sensory attributes. Presently CM products are mainly grounded products like sausage, nugget, frankfurter, burger patty, surimi, and steak with less sophistication and need to mimic real meat to grapple with the traditional meat market. The existence of fibrous microstructure in connective and muscle tissues has attracted considerable interest in the realm of tissue engineering. Scaffolding plays an important role in CM production by aiding cell adhesion, growth, differentiation, and alignment. A wide array of scaffolding technologies has been developed for implementation in the realm of biomedical research. In recent years researchers also focus on edible scaffolding to ease the process of CM. However, it is imperative to implement cutting edge technologies like 3D scaffolds, 3D printing, electrospun nanofibers in order to advance the creation of sustainable and edible scaffolding methods in CM production, with the ultimate goal of replicating the sensory and nutritional attributes to mimic real meat cut. This review discusses recent advances in scaffolding techniques and biomaterials related to structured CM production and required advances to create muscle fiber structures to mimic real meat. Keywords: Cultured meat, Scaffolding, Biomaterials, Edible scaffolding, Electrospinning, 3D bioprinting, real meat.

q-bio.TO↗

arXiv2023

On Locally Identifying Coloring of Cartesian Product and Tensor Product of Graphs

For a positive integer $k$, a proper $k$-coloring of a graph $G$ is a mapping $f: V(G) \rightarrow \{1,2, \ldots, k\}$ such that $f(u) \neq f(v)$ for each edge $uv$ of $G$. The smallest integer $k$ for which there is a proper $k$-coloring of $G$ is called the chromatic number of $G$, denoted by $χ(G)$. A locally identifying coloring (for short, lid-coloring) of a graph $G$ is a proper $k$-coloring of $G$ such that every pair of adjacent vertices with distinct closed neighborhoods has distinct set of colors in their closed neighborhoods. The smallest integer $k$ such that $G$ has a lid-coloring with $k$ colors is called locally identifying chromatic number (for short, lid-chromatic number) of $G$, denoted by $χ_{lid}(G)$. This paper studies the lid-coloring of the Cartesian product and tensor product of two graphs. We prove that if $G$ and $H$ are two connected graphs having at least two vertices then (a) $χ_{lid}(G \square H) \leq χ(G) χ(H)-1$ and (b) $χ_{lid}(G \times H) \leq χ(G) χ(H)$. Here $G \square H$ and $G \times H$ denote the Cartesian and tensor products of $G$ and $H$ respectively. We determine the lid-chromatic number of $C_m \square P_n$, $C_m \square C_n$, $P_m \times P_n$, $C_m \times P_n$ and $C_m \times C_n$, where $C_m$ and $P_n$ denote a cycle and a path on $m$ and $n$ vertices respectively.

math.CO↗

arXiv2023

Star Coloring of Tensor Product of Two Graphs

A star coloring of a graph $G$ is a proper vertex coloring such that no path on four vertices is bicolored. The smallest integer $k$ for which $G$ admits a star coloring with $k$ colors is called the star chromatic number of $G$, denoted as $χ_s(G)$. In this paper, we study the star coloring of tensor product of two graphs and obtain the following results. 1. We give an upper bound on the star chromatic number of the tensor product of two arbitrary graphs. 2. We determine the exact value of the star chromatic number of tensor product two paths. 3. We show that the star chromatic number of tensor product of two cycles is five, except for $C_3 \times C_3$ and $C_3 \times C_5$. 4. We give tight bounds for the star chromatic number of tensor product of a cycle and a path.

math.CO↗

arXiv2023

Interplay of nonlocality and incompatibility breaking qubit channels

Incompatibility and nonlocality are not only of foundational interest but also act as important resources for quantum information theory. In the Clauser-Horne-Shimony-Holt (CHSH) scenario, the incompatibility of a pair of observables is known to be equivalent to Bell nonlocality. Here, we investigate these notions in the context of qubit channels. The Bell-CHSH inequality has a greater perspective--compared to any genuine tripartite nonlocality scenario--while determining the interplay between nonlocality breaking qubit channels and incompatibility breaking qubit channels. In the Bell-CHSH scenario, we prove that if the conjugate of a channel is incompatibility breaking, then the channel is itself nonlocality breaking and vice versa. However, this equivalence is not straightforwardly generalized to multipartite systems, due to the absence of an equivalence relation between incompatibility and nonlocality in the multipartite scenario. We investigate this relation in the tripartite scenario by considering some well-known states like Greenberger-Horne-Zeilinger and $W$ states and using the notion of Mermin and Svetlichny nonlocality. By subjecting the parties in question to unital qubit channels, we identify the range of state and channel parameters for which incompatibility coexists with nonlocality. Further, we identify the set of unital qubit channels that is Mermin or Svetlichny nonlocality breaking irrespective of the input state.

quant-ph↗

arXiv2021

$\mathcal{PT}$ symmetric evolution, coherence and violation of Leggett-Garg inequalities

We report an unusual buildup of the quantum coherence in a qubit subjected to non-Hermitian evolution generated by a Parity-Time ($\mathcal{PT}$) symmetric Hamiltonian, which is reinterpreted as a Hermitian system in a higher dimensional space using Naimark dilation. The coherence is found to be maximum about the exceptional points (EPs), i.e., the points of coalescence of the eigenvalues as well as the eigenvectors. The nontrivial physics about EPs has been observed in various systems, particularly in photonic systems. As a consequence of enhancement in coherence, the various formulations of Leggett-Garg inequality tests show maximal violation about the EPs.

quant-ph↗

arXiv2020

Quantum violation of variants of LGIs upto algebraic maximum for qubit system

In 1985, Leggett and Garg formulated a class of inequalities for testing the compatibility between macrorealism and quantum mechanics. In this paper, we point out that based on the same assumptions of macrorealism that are used in the derivation of Leggett-Garg inequalities (LGIs) , there is a scope of formulating another class of inequalities different from standard LGIs. By considering the three-time measurement scenario in a dichotomic system, we first propose an interesting variant of standard LGIs and show that its quantum violation is larger than the standard LGI. By extending this formulation to $n$-time measurement scenario, we found that the quantum violations of variants of LGIs for a \emph{qubit} system increase with $n$, and for a sufficiently large $n$ algebraic maximum can be reached. Further, we compare the quantum violations of our formulated LGIs with the standard LGIs and no-signaling in time formulation of macrorealism.

quant-ph↗

arXiv2020

Probing inequivalent forms of Legget-Garg inequality in subatomic systems

We study various formulations of Leggett-Garg inequality (LGI), specifically, the Wigner and Clauser-Horne forms of LGI, in the context of subatomic systems, in particular, three flavor neutrino as well as meson systems. The optimal forms of various LGIs for either neutrinos or mesons are seen to depend on measurement settings. For the neutrinos, some of these inequalities can be written completely in terms of experimentally measurable probabilities. Hence, the Wigner and Clauser-Horne forms of LGI are found to be more suitable as compared to the standard LGI from the experimental point of view for the neutrino system. Further, these inequalities exhibit maximum quantum violation around the energies roughly corresponding to the maximum neutrino flux. The Leggett-Garg type inequality is seen to be more suited for the meson dynamics. The meson system being inherently a decaying system, allows one to see the effect of decoherence on the extent of violation of various inequalities. Decoherence is observed to reduce the degree of violation, and hence the nonclassical nature of the system.

hep-ph↗

arXiv2019

Macrorealistic inequalities stronger than the standard Leggett-Garg inequalities

In two-party, two-input and two-output measurement scenario only relevant Bell's inequality is the Clauser-Horne-Shimony-Holt (CHSH) form. They also provide the necessary and sufficient conditions for local realism. Any other form, such as, Clauser-Horne and Wigner forms reduce to the CHSH one. Standard Leggett-Garg inequalities are often considered to be the temporal analog of CHSH inequalities. But, they do not provide the necessary and sufficient conditions for macrorealism. There is thus scope of formulating new macrorealist inequalities different and stronger than the standard Leggett-Garg inequalities for testing compatibility between the macrorealism and quantum theory. In this paper, we propose three different classes of macrorealistic inequalities in three-time scenario; (i) The ones equivalent to standard Leggett-Garg inequalities in both macrorealist model and in quantum theory. (ii) A class of inequalities which are equivalent to the standard ones in macrorealist model but inequivalent and stronger in quantum theory (iii) Another class of inequalities which are inquivalent to the all formulations of Leggett-Garg inequalities both in macrorealist model and in quantum theory. This class of macrorealist inequalities reveals the incompatibility between macrorealism and quantum theory for specific cases even when any other formulation of Leggett-Garg inequalities fail to do so. We extend the formulations of the class (ii) inequalities to the four-time and two-time measurement scenario. Further, we provide a brief discussion about the alternate formulation of macrorealism which was derived based on the no-signaling in time conditions.

quant-ph↗

arXiv2017

Probing various formulations of macrorealism for unsharp quantum measurements

Standard Leggett and Garg inequalities (SLGIs) were formulated for testing the incompatibility between the classical worldview of macrorealism and quantum mechanics. In recent times, various other formulations, such as Wigner form of LGIs (WLGIs), entropic LGIs (ELGIs) and the no-signaling in time (NSIT) condition have also been proposed. It is also recently argued that no set of SLGIs can provide the necessary and sufficient conditions for macrorealism but a suitable conjunction of NSIT conditions provides the same. In this paper, we first provide a comparative study of the various formulations of LGIs for testing macrorealism pertaining to the two different unsharp measurements. While the violations of WLGIs are more robust than SLGIs and ELGIs for spin-POVMs, here we demonstrate that for the case of biased POVMs, the quantum violations of both SLGIs and ELGIs provide the same robustness as WLGIs. Importantly, the violations of all formulations of LGIs can be achieved for \textit{any non-zero value} of unsharpness parameter. We have also studied the connection between LGIs and NSIT conditions. Further, we investigate the role of the joint measurability of the POVMs in the violation of LGIs and found that there is no generic connection.

quant-ph↗

arXiv2017

Inequivalent Leggett-Garg inequalities

It remains an open question how realist view of macroscopic world emerges from quantum formalism. For testing the macrorealism in quantum domain, an interesting approach was put forward by Leggett and Garg in $1985$, by formulating a suitable inequality valid for any macrorealistic theory. Recently, by following the Wigner idea of local realist inequality, a probabilistic version of standard Leggett-Garg inequalities have also been proposed. While the Wigner form of local realist inequalities are equivalent to the two-party, two-measurements and two outcomes CHSH inequalities, in this paper we provide a generic proof to demonstrate that the Wigner form of Leggett-Garg inequalities are not only inequivalent to the standard ones but also stronger than the later. This is demonstrated by quantifying the amount of disturbance caused by a prior measurement to the subsequent measurements. In this connection, the relation between LGIs and another formulation of macrorealism known as no-signaling in time is examined.

quant-ph↗