arXiv subjects

Abhisek Panda

Publications and source records attributed to Abhisek Panda.

7 recordsLinked to original sources

arXiv2026

Violation of Bell Monogamy Relations

The entangled multipartite systems, specially in pure states, exhibit the phenomenon of entanglement monogamy. Such systems also display the phenomenon of Bell nonlocality. Like entanglement monogamy relations, there are Bell monogamy relations. These relations suggest a sharing of nonlocality across the subsystems. The nonlocality, as characterized by Bell inequalities, of one subsystem limits the nonlocality exhibited by another subsystem. We show that the Bell monogamy relations can be violated by using local filtering operations. We consider permutation-symmetric multipartite pure states, in particular $W$ states, to demonstrate the violation.

quant-ph↗

arXiv2023

ConstMig: Enabling Secure Live Migration of Large Intel SGX-based applications

Cloud service providers are adopting Trusted Execution Environments (TEEs) to provide hardware-guaranteed security to applications running on remote, untrusted data centers. However, migrating such applications still relies on the decade-old stop-and-copy method, which introduces large downtimes. Modern live-migration approaches such as pre-copy and post-copy do not work for TEE-based applications due to hardware-enforced restrictions. We propose ConstMig, a near-zero-downtime live-migration mechanism for large memory-footprint TEE-based applications. ConstMig is fully compatible with containers, virtual machines (VMs), and microVMs. Our prototype, built on Intel SGX, achieves near-zero downtime irrespective of enclave size and requires no additional hardware support. ConstMig reduces total downtime by 77 - 96% for a suite of SGX applications with multi-gigabyte memory footprints compared to state-of-the-art TEE-based migration solutions such as MigSGX.

cs.CR↗

arXiv2023

Non-Ideal Measurement Heat Engines

We discuss the role of non-ideal measurements within the context of measurement engines by contrasting examples of measurement engines which have the same work output but with varying amounts of entanglement. Accounting for the cost of resetting, correlating the engine to a pointer state and also the cost of cooling the pointer state, we show that for a given work output, thermally correlated engines can outperform corresponding entanglement engines. We also show that the optimal efficiency of the thermally correlated measurement engine is achieved with a higher temperature pointer than the pointer temperature of the optimal entanglement engine.

quant-ph↗

arXiv2023

Metrology in the Presence of Thermodynamically Consistent Measurements

Thermodynamically consistent measurements can either preserve statistics (unbiased) or preserve marginal states (non-invasive) but not both. Here we show the existence of metrological tasks which unequally favor each of the aforementioned measurement types. We consider two different metrology tasks, namely weak value amplification technique and repeated metrology without resetting. We observe that unbiased measurement is better than non-invasive measurement for the former and the converse is true for the latter. We provide finite temperature simulations of transmon sensors which estimate how much cooling, a resource for realistic measurements, is required to perform these metrology tasks.

quant-ph↗

arXiv2023

FaaSched: A Jitter-Aware Serverless Scheduler

Serverless computing systems are becoming very popular. Large corporations such as Netflix, Airbnb, and Coca-Cola use such systems for running their websites and IT systems. The advantages of such systems include superior support for auto-scaling, load balancing, and fast distributed processing. These are multi-QoS systems where different classes of applications have different latency and jitter (variation in the latency) requirements: we consider a mix of latency-sensitive (LS) and latency-desirable (LD) applications. Ensuring proper schedulability and QoS enforcement of LS applications is non-trivial. We need to minimize the jitter without increasing the response latency of LS applications, and we also need to keep the degradation of the response latency of LD applications in check. This is the first paper in this domain that achieves a trade-off between the jitter suffered by LS applications and the response latency of LD applications. We minimize the former with a bound on the latter using a reinforcement learning (RL) based scheme. To design such an RL scheme, we performed detailed characterization studies to find the input variables of interest, defined novel state representations, and proposed a bespoke reward function that allows us to achieve this trade-off. For an aggressive use case comprising five popular LS and LD applications each, we show a reduction in response time variance and mean latency of 50.31% and 27.4%, respectively, for LS applications. The mean degradation in the execution latency of LD applications was limited to 19.88%.

cs.DC↗

arXiv2022

A Comprehensive Benchmark Suite for Intel SGX

Trusted execution environments (TEEs) such as \intelsgx facilitate the secure execution of an application on untrusted machines. Sadly, such environments suffer from serious limitations and performance overheads in terms of writing back data to the main memory, their interaction with the OS, and the ability to issue I/O instructions. There is thus a plethora of work that focuses on improving the performance of such environments -- this necessitates the need for a standard, widely accepted benchmark suite (something similar to SPEC and PARSEC). To the best of our knowledge, such a suite does not exist. Our suite, SGXGauge, contains a diverse set of workloads such as blockchain codes, secure machine learning algorithms, lightweight web servers, secure key-value stores, etc. We thoroughly characterizes the behavior of the benchmark suite on a native platform and on a platform that uses a library OS-based shimming layer (GrapheneSGX). We observe that the most important metrics of interest are performance counters related to paging, memory, and TLB accesses. There is an abrupt change in performance when the memory footprint starts to exceed the size of the EPC size in Intel SGX, and the library OS does not add a significant overhead (~ +- 10%).

cs.CR↗

arXiv2021

Order from chaos in quantum walks on cyclic graphs

It has been shown classically that combining two chaotic random walks can yield an ordered(periodic) walk. Our aim in this paper is to find a quantum analog for this rather counter-intuitive result. We study chaotic and periodic nature of cyclic quantum walks and focus on a unique situation wherein a periodic quantum walk on a 3-cycle graph is generated via a deterministic combination of two chaotic quantum walks on the same graph. We extend our results to even-numbered cyclic graphs, specifically a 4-cycle graph too. Our results will be relevant in quantum cryptography and quantum chaos control.

quant-ph↗