activity
20132026
most citedA Framework of Constructions of Minimal Storage Regenerating Codes with the Optimal Access/Update Property

49 citations · 99 across the 14 of their papers we have counts for

collaborators

14 papers

quant-ph2026

Fine-Tuning Large Language Models for Quantum Reasoning

Katherine Ip, Casey R. Myers, Udaya Parampalli +2

Large language models (LLMs) exhibit abilities beyond natural language modelling and text generation. Recent advances in their reasoning capabilities have spurred interest in apply…

quant-ph2026

A System Aware Resource Allocation for Distributed Workflows in Quantum Computing Environments

Abhishek Sawaika, Udaya Parampalli, Rajkumar Buyya

Rapid advancements in cloud based platforms providing access to quantum computing capabilities have opened up several challenges for efficient usage of these highly delicate and co…

cs.AI2026

MADQRL: Distributed Quantum Reinforcement Learning Framework for Multi-Agent Environments

Abhishek Sawaika, Samuel Yen-Chi Chen, Udaya Parampalli +1

Reinforcement learning (RL) is one of the most practical ways to learn from real-life use-cases. Motivated from the cognitive methods used by humans makes it a widely acceptable st…

quant-ph2026

Encoding Matters: Benchmarking Binary and D-ary Representations for Quantum Combinatorial Optimization

Shashank Sanjay Bhat, Peiyong Wang, Joseph West +1

Combinatorial optimization problems are typically formulated using Quadratic Unconstrained Binary Optimization (QUBO), where constraints are enforced through penalty terms that int…

quant-ph2025

Benchmarking Swarm Optimization Algorithms for Parameter Initialization in the Quantum Approximate Optimization Algorithm

Shashank Sanjay Bhat, Peiyong Wang, Udaya Parampalli

The Quantum Approximate Optimization Algorithm (QAOA) is a prominent variational algorithm for solving combinatorial optimization problems such as the Max Cut problem. A key challe…

cs.LG2024★ 1 cited

Computable Model-Independent Bounds for Adversarial Quantum Machine Learning

Bacui Li, Tansu Alpcan, Chandra Thapa +1

By leveraging the principles of quantum mechanics, QML opens doors to novel approaches in machine learning and offers potential speedup. However, machine learning models are well-d…

quant-ph2024★ 9 cited

Quantum Hamiltonian Embedding of Images for Data Reuploading Classifiers

Peiyong Wang, Casey R. Myers, Lloyd C. L. Hollenberg +1

When applying quantum computing to machine learning tasks, one of the first considerations is the design of the quantum machine learning model itself. Conventionally, the design of…

quant-ph2023★ 2 cited

Impact of Data Augmentation on QCNNs

Leting Zhouli, Peiyong Wang, Udaya Parampalli

In recent years, Classical Convolutional Neural Networks (CNNs) have been applied for image recognition successfully. Quantum Convolutional Neural Networks (QCNNs) are proposed as…

cs.IT2023

Two-Dimensional Z-Complementary Array Quads with Low Column Sequence PMEPRs

Shibsankar Das, Adrish Banerjee, Udaya Parampalli

In this paper, we first propose a new design strategy of 2D -complementary array quads (2D-ZCAQs) with feasible array sizes. A 2D-ZCAQ consists of four distinct unimodular array…

quant-ph2022★ 21 cited

Automated Quantum Circuit Design with Nested Monte Carlo Tree Search

Pei-Yong Wang, Muhammad Usman, Udaya Parampalli +2

Quantum algorithms based on variational approaches are one of the most promising methods to construct quantum solutions and have found a myriad of applications in the last few year…

cs.IT2016★ 3 cited

Improved Upper Bounds on Systematic-Length for Linear Minimum Storage Regenerating Codes

Kun Huang, Udaya Parampalli, Ming Xian

In this paper, we revisit the problem of finding the longest systematic-length for a linear minimum storage regenerating (MSR) code with optimal repair of only systematic part,…

cs.IT2015★ 10 cited

Security Concerns in Minimum Storage Cooperative Regenerating Codes

Kun Huang, Udaya Parampalli, Ming Xian

Here, we revisit the problem of exploring the secrecy capacity of minimum storage cooperative regenerating (MSCR) codes under the -eavesdropper model, where the eavesd…

cs.IT2015★ 4 cited

On Secrecy Capacity of Minimum Storage Regenerating Codes

Kun Huang, Udaya Parampalli, Ming Xian

In this paper, we revisit the problem of characterizing the secrecy capacity of minimum storage regenerating (MSR) codes under the passive -eavesdropper model, where the…

cs.IT2013★ 49 cited

A Framework of Constructions of Minimal Storage Regenerating Codes with the Optimal Access/Update Property

Jie Li, Xiaohu Tang, Udaya Parampalli

In this paper, we present a generic framework for constructing systematic minimum storage regenerating codes with two parity nodes based on the invariant subspace technique. Codes…