Swaroop Ghosh

Dr. Swaroop Ghosh


Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
23 August 2021 in IEEE Transactions on Quantum Engineering
Verified
Journal Article
Open access
JLJunde Li
Junde Li
RTRasit O. Topaloglu
Rasit O. Topaloglu
SGSwaroop Ghosh
Swaroop Ghosh
Existing drug discovery pipelines take 5–10 years and cost billions of dollars. Computational approaches aim to sample from regions of the whole molecular and solid-state compounds called chemical space, which could be on the order of $10^{60}$ . Deep generative models can model the underlying probability distribution of both the physical structures and property of drugs and relate them nonlinearly. By exploiting patterns in massive datasets, these models can distill salient features that characterize the molecules. Generative adversarial networks (GANs) discover drug candidates by generating molecular structures that obey chemical and physical properties and show affinity toward binding with the receptor for a target disease. However, classical GANs cannot explore certain regions of the chemical space and suffer from training instabilities. The practical utility of such models is limited due to the vast size of the search space, characterized by millions of parameters. A full quantum GAN may require more than 90 qubits even to generate small molecules with up to nine heavy atoms. The proposed quantum GAN with a hybrid generator (QGAN-HG) model is composed of a hybrid quantum generator that supports various number of qubits and quantum circuit layers, and a classical discriminator. The QGAN-HG with less than 20% of the original parameters can learn molecular distributions as efficiently as its classical counterpart. Another extended version of the proposed QGAN-HG, which utilizes multiple quantum subcircuits, considerably accelerates our standard QGAN-HG training process and avoids the potential gradient vanishing issue of deep neural networks.

3 May 2021 in IEEE Journal on Emerging and Selected Topics in Circuits and Systems
Verified
Journal Article
Closed access
KPKoustubh Ramakant Phalak
Koustubh Ramakant Phalak
ASAbdullah Ash Saki
Abdullah Ash Saki
MAMahabubul Alam
Mahabubul Alam
RTRasit Onur Topaloglu
Rasit Onur Topaloglu
SGSwaroop Ghosh
Swaroop Ghosh
Quantum computing is a promising paradigm to solve computationally intractable problems. Various companies such as, IBM, Rigetti and D-Wave offer quantum computers using a cloud-based platform that possess several interesting features namely, (i) quantum hardware with various number of qubits and coupling maps exist at the cloud end that offer different computing capabilities; (ii) multiple hardware with identical coupling maps exist in the suite; (iii) coupling map of larger hardware with more number of qubits can fit the coupling map of many smaller hardware; (iv) the quality of each of the hardware is distinct; (v) user cannot validate the origination of the result obtained from a quantum hardware. In other words, the user relies on the scheduler of the cloud provider to allocate the requested hardware; (vi) the queue of quantum programs at the cloud end is typically long and maximizing the throughput, which is the key to reducing costs and helping the scientific community in their explorations. The above factors motivate a new threat model with following possibilities: (a) in future, less-trustworthy quantum computers from 3rd parties can allocate poor quality hardware to save on cost or towards satisfying their falsely-advertised qubit or quantum hardware specifications; (b) the workload scheduling algorithm could have a bug or malicious code segment which will try to maximize throughput at the cost of allocation to poor fidelity hardware. Such bugs are possible for trustworthy providers; (c) a rogue employee in trusted cloud vendor could try to sabotage the vendor's reputation by degrading the user compute fidelity just by tampering with the scheduling algorithm or rerouting the program; (d) a rogue employee can steal information by redirecting the programs to a 3rd party quantum hardware where they have full control. If the allocated hardware is inferior in quality, the user will suffer from poor quality result or longer convergence time. We propose two flavors of a Quantum Physically Unclonable Function (QuPUF) to address this issue- one based on superposition and another based on decoherence. Our experiments on real quantum hardware reveal that temporal variations in qubit quality can degrade the quality of the proposed QuPUF. We add a parametric rotation to the QuPUF for stability. Experiments on real IBM quantum hardware show that the proposed QuPUF can achieve inter-die Hamming Distance (HD) of 55% and intra-HD as low as 4%, as compared to ideal cases of 50% and 0% respectively. The proposed QuPUFs can also be used as a standalone solution for any other application.

10 September 2020 in IEEE Transactions on Quantum Engineering
Verified
Journal Article
Open access
ASAbdullah Ash Saki
Abdullah Ash Saki
MAMahabubul Alam
Mahabubul Alam
SGSwaroop Ghosh
Swaroop Ghosh
In this article, we present the experimental characterization of crosstalk in quantum information processor using idle tomography and simultaneous randomized benchmarking. We quantify both “quantum” and “classical” crosstalk in the device and analyze quantum circuits considering crosstalk. We show that simulation considering only gate-error deviates from experimental results up to 27%, whereas simulation considering both gate error and crosstalk match the experiments more accurately with an average mismatch as low as 4.52%. This article enables simulation of quantum circuits with experimental crosstalk error rates.

28 August 2023 in Sensors
Verified
Journal Article
Open access
PDF file
KPKoustubh Ramakant Phalak
Koustubh Ramakant Phalak
ACAvimita Chatterjee
Avimita Chatterjee
SGSwaroop Ghosh
Swaroop Ghosh
Quantum Random Access Memory (QRAM) has the potential to revolutionize the area of quantum computing. QRAM uses quantum computing principles to store and modify quantum or classical data efficiently, greatly accelerating a wide range of computer processes. Despite its importance, there is a lack of comprehensive surveys that cover the entire spectrum of QRAM architectures. We fill this gap by providing a comprehensive review of QRAM, emphasizing its significance and viability in existing noisy quantum computers. By drawing comparisons with conventional RAM for ease of understanding, this survey clarifies the fundamental ideas and actions of QRAM. QRAM provides an exponential time advantage compared to its classical counterpart by reading and writing all data at once, which is achieved owing to storage of data in a superposition of states. Overall, we compare six different QRAM technologies in terms of their structure and workings, circuit width and depth, unique qualities, practical implementation, and drawbacks. In general, with the exception of trainable machine learning-based QRAMs, we observe that QRAM has exponential depth/width requirements in terms of the number of qubits/qudits and that most QRAM implementations are practical for superconducting and trapped-ion qubit systems.

14 April 2023 in Science Advances
Verified
Journal Article
Open access
YHYuchen Hou
Yuchen Hou
JLJunde Li
Junde Li
JYJungjin Yoon
Jungjin Yoon
AKAbbey Knoepfel
Abbey Knoepfel
DYDong Yang
Dong Yang
KWKai Wang
Kai Wang
The retina is the essential part of the human visual system that receives light, converts it to neural signal, and transmits to brain for visual recognition. The red, green, and blue (R/G/B) cone retina cells are natural narrowband photodetectors (PDs) sensitive to R/G/B lights. Connecting with these cone cells, a multilayer neuro-network in the retina provides neuromorphic preprocessing before transmitting to brain. Inspired by this sophistication, we develop the narrowband (NB) imaging sensor combining R/G/B perovskite NB sensor array (mimicking the R/G/B photoreceptors) with a neuromorphic algorithm (mimicking the intermediate neural network) for high-fidelity panchromatic imaging. Compared to commercial sensors, we use perovskite “intrinsic” NB PD to exempt the complex optical filter array. In addition, we use an asymmetric device configuration to collect photocurrent without external bias, enabling a power-free photodetection feature. These results display a promising design for efficient and intelligent panchromatic imaging.

5 October 2022 in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Verified
Journal Article
Open access
JLJunde Li
Junde Li
MAMahabubul Alam
Mahabubul Alam
SGSwaroop Ghosh
Swaroop Ghosh
Quantum approximate optimization algorithm (QAOA) is a promising hybrid quantum-classical algorithm for solving combinatorial optimization problems. However, it cannot overcome qubit limitation for large-scale problems. Furthermore, the simulation time of QAOA scales poorly with the problem size. We propose a divide-and-conquer QAOA (DC-QAOA) to address the above challenges for graph maximum cut (MaxCut) problem. The algorithm works by recursively partitioning a larger graph into smaller ones whose MaxCut solutions are obtained with small-size noisy intermediate-scale quantum computers. The overall solution is retrieved from the subsolutions by applying the combination policy of measurement distribution reconstruction (MDR). The solution quality depends on the graph partitioning algorithm and MDR policy. Multiple partitioning and reconstruction methods are proposed and compared. Results are evaluated by metrics, such as quantum program runtime, measurement expectation value (EV), and approximation ratio (AR). The results show that DC-QAOA achieves 97.14% AR (20.32% higher than classical counterpart), and 94.79% EV (15.80% higher than quantum annealing). DC-QAOA solves large-scale graph instances with a polynomial rate or returns unsuccessful partition if graph connectivity requirement is not fulfilled otherwise.