arXiv subjects

Arijit Mondal

Publications and source records attributed to Arijit Mondal.

8 recordsLinked to original sources

arXiv2024

An Optimized Nearest Neighbor Compliant Quantum Circuit for 5-qubit Code

The five-qubit quantum error correcting code encodes one logical qubit to five physical qubits, and protects the code from a single error. It was one of the first quantum codes to be invented, and various encoding circuits have been proposed for it. In this paper, we propose a systematic procedure for optimization of encoder circuits for stabilizer codes. We start with the systematic construction of an encoder for a five-qubit code, and optimize the circuit in terms of the number of quantum gates. Our method is also applicable to larger stabilizer codes. We further propose nearest neighbor compliant (NNC) circuits for the proposed encoder using a single swap gate, as compared to three swap gates in a prior design.

quant-ph↗

arXiv2023

Quantum Circuits for Stabilizer Error Correcting Codes: A Tutorial

Quantum computers have the potential to provide exponential speedups over their classical counterparts. Quantum principles are being applied to fields such as communications, information processing, and artificial intelligence to achieve quantum advantage. However, quantum bits are extremely noisy and prone to decoherence. Thus, keeping the qubits error free is extremely important toward reliable quantum computing. Quantum error correcting codes have been studied for several decades and methods have been proposed to import classical error correcting codes to the quantum domain. However, circuits for such encoders and decoders haven't been explored in depth. This paper serves as a tutorial on designing and simulating quantum encoder and decoder circuits for stabilizer codes. We present encoding and decoding circuits for five-qubit code and Steane code, along with verification of these circuits using IBM Qiskit. We also provide nearest neighbour compliant encoder and decoder circuits for the five-qubit code.

quant-ph↗

arXiv2023

Systematic Design and Optimization of Quantum Circuits for Stabilizer Codes

Quantum computing is an emerging technology that has the potential to achieve exponential speedups over their classical counterparts. To achieve quantum advantage, quantum principles are being applied to fields such as communications, information processing, and artificial intelligence. However, quantum computers face a fundamental issue since quantum bits are extremely noisy and prone to decoherence. Keeping qubits error free is one of the most important steps towards reliable quantum computing. Different stabilizer codes for quantum error correction have been proposed in past decades and several methods have been proposed to import classical error correcting codes to the quantum domain. However, formal approaches towards the design and optimization of circuits for these quantum encoders and decoders have so far not been proposed. In this paper, we propose a formal algorithm for systematic construction of encoding circuits for general stabilizer codes. This algorithm is used to design encoding and decoding circuits for an eight-qubit code. Next, we propose a systematic method for the optimization of the encoder circuit thus designed. Using the proposed method, we optimize the encoding circuit in terms of the number of 2-qubit gates used. The proposed optimized eight-qubit encoder uses 18 CNOT gates and 4 Hadamard gates, as compared to 14 single qubit gates, 33 2-qubit gates, and 6 CCNOT gates in a prior work. The encoder and decoder circuits are verified using IBM Qiskit. We also present optimized encoder circuits for Steane code and a 13-qubit code in terms of the number of gates used.

quant-ph↗

arXiv2022

Manifestations of the structural origin of supercooled water's anomalies in the heterogeneous relaxation on the potential energy landscape

Liquid water is well-known for its intriguing thermodynamic anomalies in the supercooled state. The phenomenological two-state models - based on the assumption of the existence of two types of competing local states (or, structures) in liquid water - have been extremely successful in describing water's thermodynamic anomalies. However, the precise structural features of these competing local states in liquid water still remain elusive. Here, we have employed a geometrical order parameter-free approach to unambiguously identify the two types of competing local states -- entropically and energetically-favored -- with significantly different structural and energetic features in the TIP4P/2005 liquid water. This identification is based on the heterogeneous structural relaxation of the system in the potential energy landscape (PEL) during the steepest-descent energy minimization. This heterogeneous relaxation is characterized using order parameters inspired by the spin-glass transition in frustrated magnetic systems. We have further established a direct relationship between the population fluctuation of the two states and the anomalous behavior of the heat capacity in supercooled water. The composition-dependent spatial distribution of the entropically-favored local states shows an interesting crossover from a spanning network-like single cluster to the spatially delocalized clusters in the close vicinity of the Widom line. Additionally, this study establishes a direct relationship between the topographic features of the PEL and the water's thermodynamic anomalies in the supercooled state and provides alternate markers (in addition to the locus of maxima of thermodynamic response functions) for the Widom line in the phase plane.

physics.chem-ph↗

arXiv2022

Resisting Adversarial Attacks in Deep Neural Networks using Diverse Decision Boundaries

The security of deep learning (DL) systems is an extremely important field of study as they are being deployed in several applications due to their ever-improving performance to solve challenging tasks. Despite overwhelming promises, the deep learning systems are vulnerable to crafted adversarial examples, which may be imperceptible to the human eye, but can lead the model to misclassify. Protections against adversarial perturbations on ensemble-based techniques have either been shown to be vulnerable to stronger adversaries or shown to lack an end-to-end evaluation. In this paper, we attempt to develop a new ensemble-based solution that constructs defender models with diverse decision boundaries with respect to the original model. The ensemble of classifiers constructed by (1) transformation of the input by a method called Split-and-Shuffle, and (2) restricting the significant features by a method called Contrast-Significant-Features are shown to result in diverse gradients with respect to adversarial attacks, which reduces the chance of transferring adversarial examples from the original to the defender model targeting the same class. We present extensive experimentations using standard image classification datasets, namely MNIST, CIFAR-10 and CIFAR-100 against state-of-the-art adversarial attacks to demonstrate the robustness of the proposed ensemble-based defense. We also evaluate the robustness in the presence of a stronger adversary targeting all the models within the ensemble simultaneously. Results for the overall false positives and false negatives have been furnished to estimate the overall performance of the proposed methodology.

cs.LG↗

arXiv2021

Guardian of the Ensembles: Introducing Pairwise Adversarially Robust Loss for Resisting Adversarial Attacks in DNN Ensembles

Adversarial attacks rely on transferability, where an adversarial example (AE) crafted on a surrogate classifier tends to mislead a target classifier. Recent ensemble methods demonstrate that AEs are less likely to mislead multiple classifiers in an ensemble. This paper proposes a new ensemble training using a Pairwise Adversarially Robust Loss (PARL) that by construction produces an ensemble of classifiers with diverse decision boundaries. PARL utilizes outputs and gradients of each layer with respect to network parameters in every classifier within the ensemble simultaneously. PARL is demonstrated to achieve higher robustness against black-box transfer attacks than previous ensemble methods as well as adversarial training without adversely affecting clean example accuracy. Extensive experiments using standard Resnet20, WideResnet28-10 classifiers demonstrate the robustness of PARL against state-of-the-art adversarial attacks. While maintaining similar clean accuracy and lesser training time, the proposed architecture has a 24.8% increase in robust accuracy ($\epsilon$ = 0.07) from the state-of-the art method.

cs.LG↗

arXiv2021

Correlation between kinetic fragility and Poisson's ratio from analysis of data for soft colloids

We consider the link between fragility and elasticity that follows from analysis of the data for a set of soft-colloid materials consisting of deformable spheres reported by Mattsson et. al., in Nature vol 462, 83 (2009). Fragility index for a soft-colloid is obtained from the density dependence of the long time relaxation near a so-called glass transition point. In addition, we fit data for the high frequency shear modulus for the respective soft-colloid to a corresponding theoretical expression for the same modulus. This expression for the elastic constant is in terms of the corresponding pair correlation function for the liquid treated as of uniform density. The pair correlation function is adjusted through a proper choice of the parameters for the two body interaction potential for the respective soft-colloid material. The nature of correlation between the fragility and Poisson ratio observed for the soft colloids is qualitatively different, as compared to the same for molecular glasses. The observed link between fragility of a metastable liquid and its elastic coefficients is a manifestation of the effects of structure of the fluid on its dynamics.

cond-mat.soft↗

arXiv2015

Approximation of Capacity for ISI Channels with One-bit Output Quantization

Motivated by recent high bandwidth communication systems, Inter-Symbol Interference (ISI) channels with 1-bit quantized output are considered under an average-power-constrained continuous input. While the exact capacity is difficult to characterize, an approximation that matches with the exact channel output up to a probability of error is provided. The approximation does not have additive noise, but constrains the channel output (without noise) to be above a threshold in absolute value. The capacity under the approximation is computed using methods involving standard Gibbs distributions. Markovian achievable schemes approaching the approximate capacity are provided. The methods used over the approximate ISI channel result in ideas for practical coding schemes for ISI channels with 1-bit output quantization.

cs.IT↗