Searcharxiv⌕ Search

arXiv subjects

Manish K. Gupta

Publications and source records attributed to Manish K. Gupta.

At least 19 recordsLinked to original sources
arXiv2025

Explainable Quantum Machine Learning for Multispectral Images Segmentation: Case Study

The emergence of Big Data changed how we approach information systems engineering. Nowadays, when we can use remote sensing techniques for Big Data acquisition, the issues such data introduce are as important as ever. One of those concerns is the processing of the data. Classical methods often fail to address that problem or are incapable of processing the data in a reasonable time. With that in mind information system engineers are required to investigate different approaches to the data processing. The recent advancements in noisy intermediate-scale quantum (NISQ) devices implementation allow us to investigate their application to real-life computational problem. This field of study is called quantum (information) systems engineering and usually focuses on technical problems with the contemporary devices. However, hardware challenges are not the only ones that hinder our quantum computation capabilities. Software limitations are the other, less explored side of this medal. Using multispectral image segmentation as a task example, we investigated how difficult it is to run a hybrid quantum-classical model on a real, publicly available quantum device. To quantify how and explain why the performance of our model changed when ran on a real device, we propose new explainability metrics. These metrics introduce new meaning to the explainable quantum machine learning; the explanation of the performance issue comes from the quantum device behavior. We also analyzed the expected money costs of running similar experiment on contemporary quantum devices using standard market prices.

quant-ph↗
arXiv2024

Polarization-Entanglement Dynamics in Optical Fibers: Mitigating Decay in the Non-Markovian Regime with Dynamical Decoupling

Future distributed quantum systems and networks are likely to rely, at least in part, on the existing fiber infrastructure for entanglement distribution; hence, a precise understanding of the adverse effects of imperfections in optical fibers on entanglement is essential to their operation. Here, we consider maximally entangled polarization qubits and study the decay of the entanglement caused by spatial fluctuations in the refractive index of optical fibers. We study this entanglement dynamics using the spin-boson model and numerically solve our system of equations using the hierarchical equations of motion (HEOM) formalism. We show that within the range of practically relevant system parameters, our developed model exhibits both Markovian and non-Markovian entanglement decay behavior. Further, to counter the observed entanglement decay, we propose the implementation of dynamical decoupling in optical fibers using spaced half waveplates. In particular, we numerically model the time-dependent Hamiltonians of the Carr-Purcell-Meiboom-Gill and Uhrig dynamical decoupling schemes and show a reduced rate of entanglement decay even with sparsely spaced half waveplates along the length of optical fiber. Finally, we evaluate the performance of these two schemes in multiple system configurations.

quant-ph↗
arXiv2024

On Naisargik Images of Varshamov-Tenengolts and Helberg Codes

The VT and Helberg codes, both in binary and non-binary forms, stand as elegant solutions for rectifying insertion and deletion errors. In this paper we consider the quaternary versions of these codes. It is well known that many optimal binary non-linear codes like Kerdock and Prepreta can be depicted as Gray images (isometry) of codes defined over $\mathbb{Z}_4$. Thus a natural question arises: Can we find similar maps between quaternary and binary spaces which gives interesting properties when applied to the VT and Helberg codes. We found several such maps called Naisargik (natural) maps and we study the images of quaternary VT and Helberg codes under these maps. Naisargik and inverse Naisargik images gives interesting error-correcting properties for VT and Helberg codes. If two Naisargik images of VT code generates an intersecting one deletion sphere, then the images holds the same weights. A quaternary Helberg code designed to correct $s$ deletions can effectively rectify $s+1$ deletion errors when considering its Naisargik image, and $s$-deletion correcting binary Helberg code can corrects $\lfloor\frac{s}{2}\rfloor$ errors with inverse Naisargik image.

cs.IT↗
arXiv2024

A Bird-Eye view on DNA Storage Simulators

In the current world due to the huge demand for storage, DNA-based storage solution sounds quite promising because of their longevity, low power consumption, and high capacity. However in real life storing data in the form of DNA is quite expensive, and challenging. Therefore researchers and developers develop such kind of software that helps simulate real-life DNA storage without worrying about the cost. This paper aims to review some of the software that performs DNA storage simulations in different domains. The paper also explains the core concepts such as synthesis, sequencing, clustering, reconstruction, GC window, K-mer window, etc and some overview on existing algorithms. Further, we present 3 different softwares on the basis of domain, implementation techniques, and customer/commercial usability.

cs.IT↗
arXiv2021

Cyclic and Quasi-Cyclic DNA Codes

In this paper, we discuss DNA codes that are cyclic or quasi-cyclic over $\Z_{4}+ω\Z_{4}$, where $ω^{2}=2+2ω$ along with methods to construct these with combinatorial constraints. We also generalize results obtained for the ring $\Z_{4}+ω\Z_{4}$, where $ω^{2}=2+2ω$, and some other rings to the sixteen rings $R_θ=\Z_{4}+ω\Z_{4}$, where $ω^{2}=θ\in \Z_{4}+ω\Z_{4}$, using the generalized Gau map and Gau distance in \cite{3}. We determine a relationship between the Gau distance and Hamming distance for linear codes over the sixteen rings $R_θ$ which enables us to attain an upper boundary for the Gau distance of free codes that are self-dual over the rings $R_θ$.

cs.IT↗
arXiv2019

BacSoft: A Tool to Archive Data on Bacteria

Recently, DNA data storage systems have attracted many researchers worldwide. Motivated by the success stories of such systems, in this work we propose a software called BacSoft to clone the data in a bacterial plasmid by using the concept of genetic engineering. We consider the encoding schemes such that it satisfies constraints significant for bacterial data storage.

cs.ET↗
arXiv2018

Superposition of causal order as a metrological resource for quantum thermometry

We propose a novel approach to qubit thermometry using a quantum switch, that introduces an indefinite causal order in the probe-bath interaction, to significantly enhance the thermometric precision. The resulting qubit probe shows improved precision in both low and high temperature regimes when compared to optimal qubit probes studied previously. It even performs better than a Harmonic oscillator probe, in spite of having only two energy levels rather than an infinite number of energy levels as that in a harmonic oscillator. We thereby show unambiguously that quantum resources such as the quantum switch can significantly improve equilibrium thermometry. We also derive a new form of thermodynamic uncertainty relation that is tighter and depends on the energy gap of the probe. The present work may pave the way for using indefinite causal order as a metrological resource.

quant-ph↗
arXiv2018

High precision Optical AC Magnetometry using Dynamical Decoupling

We propose a magnetometer for the precise measurement of AC magnetic fields that uses a Terbium-doped optical fiber with half-waveplates built into it at specified distances. Our scheme uses an open-loop quantum control technique called dynamical decoupling to reduce the noise floor and thus increase the sensitivity. We show that dynamical decoupling is extremely effective in preserving the photon state evolution due to the external AC magnetic field from random birefringence in the fiber, even when accounting for errors in pulse timing. Hence we achieve high sensitivity. For a given inter-waveplate distance, the minimum detectable field is inversely proportional to fiber length, as is the bandwidth of detectable frequencies.

quant-ph↗
arXiv2018

On DNA Codes using the Ring Z4 + wZ4

In this work, we study the DNA codes from the ring R = Z4 + wZ4, where w^2 = 2+2w with 16 elements. We establish a one to one correspondence between the elements of the ring R and all the DNA codewords of length 2 by defining a distance-preserving Gau map phi. Using this map, we give several new classes of the DNA codes which satisfies reverse and reverse complement constraints. Some of the constructed DNA codes are optimal.

cs.IT↗
arXiv2017

Monogamy of Quantum Privacy

Quantum mechanics ensures that the information stored in a quantum state is secure and the ability to send private information through a quantum channel is at least as great as the coherent information. We derive trade-off relations between quantum privacy, information gain by Eve and the disturbance caused by Eve to the quantum state that is being sent through a noisy channel. For tripartite quantum states, we show that monogamy of privacy exists in the case of a single sender and multiple receivers. When Alice prepares a tripartite entangled state and shares it with Bob and Charlie through two different noisy quantum channels, we prove that if the minimally guaranteed quantum privacy between Alice and Bob is positive, then the privacy of information between Alice and Charlie has to be negative. Thus, quantum privacy for more than two parties respects mutual exclusiveness. Then, we prove a monogamy relation for the minimally guaranteed quantum privacy for tripartite systems. We also prove a trade-off relation between the entanglement of formation across one partition and the quantum privacy along another partition. Our results show that quantum privacy cannot be freely shared among multiple parties and can have implication in future quantum networks.

quant-ph↗
arXiv2017

3DNA Printer: A Tool for Automated DNA Origami

In the last two decades, DNA self-assembly has grown into a major area of research attracting people from diverse background. It has numerous potential applications such as targeted drug delivery, artificial photosynthesis etc. In the last decade, another area received wide attention known as DNA origami, where using M13 virus and carefully designed staple strands one can fold the DNA into desired 2-D and 3-D shapes. In 2016, a group of researchers at MIT have developed an automated DNA nanostructures strategy and an open source software 'daedalus' based on MATLAB for developing the nanostructures. In this work, we present a truly open source software '3dnaprinter' based on Java (without MATLAB) that can do the same work.

cs.ET↗
arXiv2016

On Some Universally Good Fractional Repetition Codes

Data storage in Distributed Storage Systems (DSSs) is a multidimensional optimization problem. Using network coding, one wants to provide reliability, scalability, security, reduced storage overhead, reduced bandwidth for repair and minimal disk I/O etc. in such systems. Regenerating codes have been used to optimize some of these parameters, where a file can be reconstructed by contacting any k nodes in the system and in case of node failure it can be repaired by using any d nodes in the system. This was further generalized to Fractional repetition (FR) codes (a smart replication of encoded packets) on n nodes which also provides optimized disk I/O and where a node failure can be repaired by contacting some specific set of nodes in the system. Several constructions of FR codes using graphs and combinatorial designs are known. In particular, some constructions of codes for heterogeneous DSSs are given using partial regular graph (where number of packets on each node is different) and ring construction. In this work, we show that the codes constructed using the partial regular graph are universally good code. Further, we found several universally good codes using ring construction and t-construction.

cs.IT↗
arXiv2016

On Optimal Heterogeneous Regenerating Codes

Heterogeneous Distributed Storage Systems (DSSs) are close to the real world applications for data storage. Each node of the considered DSS, may store different number of packets and each having different repair bandwidth with uniform repair traffic. For such heterogeneous DSS, a failed node can be repaired with the help of some specific nodes. In this work, a family of codes based on graph theory, is constructed which achieves the fundamental bound on file size for the particular heterogeneous DSS.

cs.IT↗
arXiv2016

The Art of DNA Strings: Sixteen Years of DNA Coding Theory

The idea of computing with DNA was given by Tom Head in 1987, however in 1994 in a seminal paper, the actual successful experiment for DNA computing was performed by Adleman. The heart of the DNA computing is the DNA hybridization, however, it is also the source of errors. Thus the success of the DNA computing depends on the error control techniques. The classical coding theory techniques have provided foundation for the current information and communication technology (ICT). Thus it is natural to expect that coding theory will be the foundational subject for the DNA computing paradigm. For the successful experiments with DNA computing usually we design DNA strings which are sufficiently dissimilar. This leads to the construction of a large set of DNA strings which satisfy certain combinatorial and thermodynamic constraints. Over the last 16 years, many approaches such as combinatorial, algebraic, computational have been used to construct such DNA strings. In this work, we survey this interesting area of DNA coding theory by providing key ideas of the area and current known results.

cs.IT↗
arXiv2016

Quantum enhanced spectroscopy with entangled multi-photon states

Traditionally, spectroscopy is performed by examining the position of absorption lines. However, at frequencies near the transition frequency, additional information can be obtained from the phase shift. In this work we consider the information about the transition frequency obtained from both the absorption and the phase shift, as quantified by the Fisher information in an interferometric measurement. We examine the use of multiple single-photon states, NOON states, and numerically optimized states that are entangled and have multiple photons. We find the optimized states that improve over the standard quantum limit set by independent single photons for some atom number densities.

quant-ph↗
arXiv2015

Single-photon orbital angular momentum qudit states in fiber - Limits to Dephasing correction via dynamical decoupling

We analytically derive a decoherence model for orbital angular momentum states of a photon in a multimode optical fiber and show that rate of decoherence scales exponentially with $l^2$, where $l$ is the azimuthal mode order.~We also show numerically that for large values of $l$ the orbital angular momentum photon state completely dephases.~However for lower values of $l$ the decoherence can be minimized by using dynamical decoupling to allow for qudit high-bandwidth quantum communication and similar applications. \end{abstract}

quant-ph↗
arXiv2015

Generating Binary Optimal Codes Using Heterogeneous Parallel Computing

Generation of optimal codes is a well known problem in coding theory. Many computational approaches exist in the literature for finding record breaking codes. However generating codes with long lengths $n$ using serial algorithms is computationally very expensive, for example the worst case time complexity of a Greedy algorithm is $\mathcal{O}(n\; 4^n)$. In order to improve the efficiency of generating codes with long lengths, we propose and investigate some parallel algorithms using General Purpose Graphic Processing Units (GPGPU). This paper considers the implementation of parallel Greedy algorithm using GPGPU-CUDA (Computed Unified Device Architecture) framework and discusses various optimization techniques to accelerate the GPU code. The performance achieved for optimized parallel implementations is more than two to three orders of magnitude faster than that of serial implementation and shows a great potential of GPGPU in the field of coding theory applications.

cs.IT↗