arXiv subjects

Sowmitra Das

Publications and source records attributed to Sowmitra Das.

6 recordsLinked to original sources

arXiv2025

Measurement-Assisted Clifford Synthesis

In this letter, we introduce a method to synthesize an $n$-qubit Clifford unitary $C$ from the stabilizer tableau of its inverse $C\dag$, using ancilla qubits and measurements. The procedure uses ancillary $|+\rangle$ states, controlled-Paulis, $X$-basis measurements and single-qubit Pauli corrections on the data qubits (based on the measurement results). This introduces a new normal form for Clifford synthesis, with the number of two-qubit gates required exactly equal to the weight of the stabilizer tableau, and a depth linear in $n$.

quant-ph↗

arXiv2025

Hybrid Quantum-Classical Learning for Multiclass Image Classification

This study explores the challenge of improving multiclass image classification through quantum machine-learning techniques. It explores how the discarded qubit states of Noisy Intermediate-Scale Quantum (NISQ) quantum convolutional neural networks (QCNNs) can be leveraged alongside a classical classifier to improve classification performance. Current QCNNs discard qubit states after pooling; yet, unlike classical pooling, these qubits often remain entangled with the retained ones, meaning valuable correlated information is lost. We experiment with recycling this information and combining it with the conventional measurements from the retained qubits. Accordingly, we propose a hybrid quantum-classical architecture that couples a modified QCNN with fully connected classical layers. Two shallow fully connected (FC) heads separately process measurements from retained and discarded qubits, whose outputs are ensembled before a final classification layer. Joint optimisation with a classical cross-entropy loss allows both quantum and classical parameters to adapt coherently. The method outperforms comparable lightweight models on MNIST, Fashion-MNIST and OrganAMNIST. These results indicate that reusing discarded qubit information is a promising approach for future hybrid quantum-classical models and may extend to tasks beyond image classification.

quant-ph↗

arXiv2024

Purification and correction of quantum channels by commutation-derived quantum filters

Reducing errors is essential for reliable quantum computation. Quantum error mitigation (QEM) and quantum error correction (QEC) are two leading approaches for this task, each with challenges: QEM suffers from high sampling costs and cannot recover states, while QEC incurs large qubit and gate overheads. We combine ideas from both and introduce an information-theoretic device called a quantum filter that can purify or correct quantum channels. We present an explicit construction capable of correcting arbitrary noise in an n-qubit Clifford circuit using 2n ancillary qubits through a commutation-derived error-detection circuit. This scheme can also partially purify noise in non-Clifford gates such as T and CCZ. Unlike QEC, it achieves deterministic error reduction without encoding the input state. Under the assumption of clean ancillas, it overcomes the exponential sampling overhead in QEM using a single query to the channel. We also propose an ancilla-efficient Pauli filter that removes nearly all low-weight erroneous Pauli components in noisy Clifford circuits using only two ancillas. For local depolarizing noise, it achieves a quadratic reduction in average infidelity. Beyond existing QEM methods, our approach enables systematic error correction as the infidelity can be exponentially reduced with each added ancilla. Through numerical simulations under ancilla noise, we identify regimes where quantum filters outperform other techniques, demonstrating their effectiveness as a scalable error-reduction tool for quantum information processing.

quant-ph↗

arXiv2023

Quantumizing Classical Games: An Introduction to Quantum Game Theory

We give a concise and self-contained introduction to the theory of Quantum Games by reviewing the seminal works of Meyer, Eisert-Wilkens-Lewenstein, Marinatto-Weber and Landsburg, which initiated the study of this field. By generalizing this body of work, we formulate a protocol to $\textit{Quantumize}$ any finite classical $n$-player game, and use a novel approach of describing such a Quantum Game in terms of commuting Payoff Operators. We describe what advantages can be gained by players by quantumizing such a game, particularly, what additional Nash Equilibria the players can achieve and the Pareto-Optimality of these additional equilibria.

quant-ph↗

arXiv2021

Design of a Quantum-Repeater using Quantum-Circuits and benchmarking its performance on an IBM Quantum-Computer

Quantum communication relies on the existence of entanglement between two nodes of a network. However, due to its fragile nature, it is nearly impossible to establish entanglement at large distances through the direct transmission of qubits. Quantum repeaters have been proposed to solve this problem, which split-up the network to create small-scale entangled links and then connect them up to create the large-scale link. As researchers race to establish entanglement over larger and larger distances, it becomes essential to gauge the performance and robustness of the different protocols that have been proposed to design a quantum repeater, before deploying them in real life. Currently available noisy quantum computers are ideal for this task, as they can emulate the noisy environment in a quantum communication channel, and provide a measure for how the protocols will perform on real-life hardware. In this paper, we report the circuit-level implementation of the complete architecture of a quantum repeater, and benchmark this protocol on IBM's cloud quantum computer - IBMQ. Our experiments indicate a 26% fidelity of shared bell-pairs for a complete on-chip quantum repeater with a yield of 49%. We also compare these results with simulation data from IBM Qiskit. The results of our experiments provide a quantitative measure for the fidelity of entanglement that currently available repeaters can establish. In addition, the proposed circuit-implementation provides a robust benchmark for state-of-the-art quantum computing hardware.

quant-ph↗

arXiv2019

Application of DenseNet in Camera Model Identification and Post-processing Detection

Camera model identification has earned paramount importance in the field of image forensics with an upsurge of digitally altered images which are constantly being shared through websites, media, and social applications. But, the task of identification becomes quite challenging if metadata are absent from the image and/or if the image has been post-processed. In this paper, we present a DenseNet pipeline to solve the problem of identifying the source camera-model of an image. Our approach is to extract patches of 256*256 from a labeled image dataset and apply augmentations, i.e., Empirical Mode Decomposition (EMD). We use this extended dataset to train a Neural Network with the DenseNet-201 architecture. We concatenate the output features for 3 different sizes (64*64, 128*128, 256*256) and pass them to a secondary network to make the final prediction. This strategy proves to be very robust for identifying the source camera model, even when the original image is post-processed. Our model has been trained and tested on the Forensic Camera-Model Identification Dataset provided for the IEEE Signal Processing (SP) Cup 2018. During testing we achieved an overall accuracy of 98.37%, which is the current state-of-the-art on this dataset using a single model. We used transfer learning and tested our model on the Dresden Database for Camera Model Identification, with an overall test accuracy of over 99% for 19 models. In addition, we demonstrate that the proposed pipeline is suitable for other image-forensic classification tasks, such as, detecting the type of post-processing applied to an image with an accuracy of 96.66% -- which indicates the generality of our approach.

eess.IV↗