Options
Pradeep Sarvepalli
Loading...
Preferred name
Pradeep Sarvepalli
Official Name
Pradeep Sarvepalli
Alternative Name
Sarvepalli, P.
Sarvepalli, Pradeep Kiran
Sarvepalli, Pradeep
Sarvepalli, Pradeep K.
Main Affiliation
ORCID
Scopus Author ID
Google Scholar ID
17 results
Now showing 1 - 10 of 17
- PublicationCommunication efficient quantum secret sharing(11-11-2019)
;Senthoor, KaushikA quantum secret sharing scheme is a cryptographic protocol by which a dealer can share a secret among a group of n players so that only certain subsets of players can recover the secret by collaboration. In this paper we propose communication efficient quantum threshold secret sharing schemes. They minimize the amount of quantum communication required to reconstruct the secret when more than the necessary number of players collaborate. They are based on a class of staircase codes proposed by Bitar and El Rouayheb. In a standard ((k,n)) quantum threshold scheme, any subset of k or more players can recover the secret. The quantum communication cost for reconstruction in such schemes is k qudits for each secret qudit. Using the proposed construction, any subset of d≥k players can also collaborate to recover the secret with a communication cost of d qudits for d-k+1 secret qudits. In other words, for the proposed schemes the quantum communication cost is only dd-k+1 qudits for every secret qudit. For d>k, proposed schemes are communication efficient with respect to standard schemes; and when d=2k-1, the quantum communication cost is reduced by a factor O(k). Further, when n=2k-1, the proposed schemes have optimal communication cost for secret reconstruction. - PublicationErasure decoding of two-dimensional color codes(14-10-2019)
;Aloshious, Arun B.The quantum erasure channel models phenomena such as loss or leakage of qubits. Using quantum codes, we can recover from such errors. In this paper, we are interested in studying the performance of two-dimensional color codes over the quantum erasure channel. Our approach makes use of the local equivalence between color codes and surface codes. We propose a variety of decoding algorithms for color codes over the erasure channel. First, we propose algorithms that decode by projecting the erasures on the color to surface codes. Then, instead of directly decoding on the color code or on the equivalent copies of surface codes, we decode jointly on the color code and the equivalent surface codes. We observe a threshold of 44.3% for the color code on the square octagonal lattice. - PublicationLatency Optimal Storage and Scheduling of Replicated Fragments for Memory Constrained Servers(01-06-2022)
;Jinan, Rooji ;Badita, Ajay; Parag, ParimalWe consider the setting of a distributed storage system where a single file is subdivided into smaller fragments of same size which are then replicated with a common replication factor across servers of identical cache size. An incoming file download request is sent to all the servers, and the download is completed whenever the request gathers all the fragments. At each server, we are interested in determining the set of fragments to be stored, and the sequence in which fragments should be accessed, such that the mean file download time for a request is minimized. We model the fragment download time as an exponential random variable independent and identically distributed for all fragments across all servers, and show that the mean file download time can be lower bounded in terms of the expected number of useful servers summed over all distinct fragment downloads. We present deterministic storage schemes that attempt to maximize the number of useful servers. We show that finding the optimal sequence of accessing the fragments is a Markov decision problem, whose complexity grows exponentially with the number of fragments. We propose heuristic algorithms that determine the sequence of access to the fragments which are empirically shown to perform well. - PublicationDecoding Topological Subsystem Color Codes Over the Erasure Channel Using Gauge Fixing(01-07-2023)
;Solanki, Hiteshvi ManishTopological subsystem color codes (TSCCs) are an important class of topological subsystem codes that allow for syndrome measurement with only 2-body measurements. It is expected that such low complexity measurements can help in fault tolerance. While TSCCs have been studied over depolarizing noise model, their performance over the erasure channel has not been studied as much. Recently, we proposed erasure decoders for TSCCs and reported a threshold of 9.7%. In this paper, we continue our study of TSCCS over the erasure channel. We propose two erasure decoders for topological subsystem color codes. These decoders employ a mapping of the TSCCs to topological color codes (TCCs). In addition, these decoders use the technique of gauge fixing, where some of the gauge operators of the subsystem code are promoted to stabilizers. We perform gauge fixing using 4-body and 8-body gauge operators. With partial gauge fixing, we obtained a threshold of 17.7% on a TSCC derived from the square octagon lattice. Using an order maximal gauge fixing decoder we were able to improve the threshold to 44%. The performance of the order maximal gauge fixing decoder can be further improved to close to 50% in conjunction with an optimal erasure decoder for topolological color codes. We also study the correctability of erasures on the subsystem codes. - PublicationQuantum computation with charge-and-color-permuting twists in qudit color codes(01-02-2022)
;Gowda, Manoj G.Twists are defects in the lattice which can be utilized to perform computations on encoded data. Twists have been studied in various classes of topological codes like qubit and qudit surface codes, qubit color codes, and qubit subsystem color codes. They are known to exhibit projective non-Abelian statistics, which is exploited to perform encoded gates. In this paper, we initiate the study of twists in qudit color codes over the odd prime alphabet. Specifically, we present a systematic construction of twists in qudit color codes that permute both charge and color of the excitations. We also present a mapping between generalized Pauli operators and strings in the lattice. Making use of the construction, we give protocols to implement generalized Clifford gates using charge-and-color-permuting twists. - PublicationLocal equivalence of qudit color codes and toric codes(29-07-2019)
;Aloshious, Arun B.In this paper, we study nonbinary toric codes and color codes. While the relationships between the qubit color codes and toric codes have been studied extensively from various perspectives, similar studies for qudit toric codes and color codes are missing. We show that just as in the binary case, qudit color codes can be mapped to qudit toric codes. Qudit color codes are known to have the capability for implementing the generalized Clifford group transversally. The proposed mapping of qudit color codes to toric codes would allow us to port the computational capabilities of the qudit color codes to qudit toric codes. Another application would be to decode qudit color codes via qudit toric codes. Along the way, we show an important structural result for higher-dimensional qudit toric codes. Specifically, we show that the toric codes over prime power dimension can be viewed as a direct sum of copies of codes over the prime dimension. This result simplifies the study of codes over prime power dimension by reducing them to the study of codes over the prime dimension. Furthermore, we provide explicit circuits for the transformation between qudit color codes and toric codes. - PublicationLifting Constructions of PDAs for Coded Caching With Linear Subpacketization(01-12-2022)
;Aravind, V. R.; Coded caching is a technique where multicasting and coding opportunities are utilized to achieve better rate-memory tradeoff in cached networks. A crucial parameter in coded caching is subpacketization, which is the number of parts a file is to be split into for coding purposes. The Maddah-Ali-Niesen scheme has order-optimal rate, but the subpacketization is exponential in the number of users for certain memory regimes. In contrast, coded caching schemes designed using placement delivery arrays (PDAs) can have linear subpacketization with a penalty in rate. In this work, we propose several constructions of efficient PDAs through lifting, where a base PDA is expanded by replacing each entry by another PDA. By proposing and using the notion of Blackburn-compatibility of PDAs, we provide multiple lifting constructions with increasing coding gains. We compare the constructed coded caching schemes with other existing schemes for moderately high number of users and show that the proposed constructions are versatile and achieve a good rate-memory tradeoff at low subpacketizations. - PublicationQuantum computation with generalized dislocation codes(29-10-2020)
;Gowda, Manoj G.In this paper, we study quantum computing with twists. Twists are yet another form of defects in a lattice. They arise from dislocations in the lattice and can be used to encode and process quantum information. Surface codes with twists are also called dislocation codes. Hastings and Geller showed that dislocation codes could provide gains in space-time complexity of quantum computation. In this paper, we undertake a detailed study of generalized dislocation codes. We develop the theory of qubit dislocation codes over arbitrary four-valent and bicolorable lattices. We give a construction to introduce twists in such lattices and also study the structure of logical operators. We then study dislocation codes over odd prime dimensions in square lattices. Using the theory developed, we present protocols for implementing a universal gate set in qubit dislocation codes. We also show how to implement the generalized Clifford group in qudit dislocation codes in odd prime dimensions. - PublicationTheory of Communication Efficient Quantum Secret Sharing(01-05-2022)
;Senthoor, KaushikA ((k,n)) quantum threshold secret sharing (QTS) scheme is a quantum cryptographic protocol for sharing a quantum secret among n parties such that the secret can be recovered by any k or more parties while k-1 or fewer parties have no information about the secret. Despite extensive research on these schemes, there has been very little study on optimizing the quantum communication cost during recovery. Recently, we initiated the study of communication efficient quantum threshold secret sharing (CE-QTS) schemes. These schemes reduce the communication complexity in QTS schemes by accessing d > k parties for recovery; here d is fixed ahead of encoding the secret. In contrast to the standard QTS schemes which require k qudits for recovering each qudit in the secret, these schemes have a lower communication cost of d/d-k+1. In this paper, we further develop the theory of communication efficient quantum threshold schemes. Here, we propose universal CE-QTS schemes which reduce the communication cost for all d > k simultaneously. We provide a framework based on ramp quantum secret sharing to construct CE-QTS and universal CE-QTS schemes. We give another construction for universal CE-QTS schemes based on Staircase codes. We derived a lower bound on communication complexity and show that our constructions are optimal. Finally, an information theoretic model is developed to analyse CE-QTS schemes and the lower bound on communication complexity is proved again using this model. - PublicationAlgorithms for Change Detection with Sparse Signals(01-01-2020)
;Jain, Aditi; ; Kannu, Arun PachaiWe consider the change detection problem where the pre-change observation vectors are purely noise and the post-change observation vectors are noise-corrupted compressive measurements of sparse signals with a common support, measured using a sensing matrix. In general, post-change probability density function (pdf) of the observations depends on parameters such as the support and variances of the sparse signal. When these parameters are unknown, we propose two approaches. In the first approach, we approximate the post-change pdf based on the known parameters such as mutual coherence of the sensing matrix and bounds on the signal variances. In the second approach, we parameterize the post-change pdf with an unknown parameter and try to estimate this parameter using two different methods, stochastic gradient descent and generalized likelihood ratio. In both these approaches, we employ the conventional cumulative sum (CUSUM) algorithm with various decision statistics such as the energy of the observations, correlation values with columns of the sensing matrix and the maximum value of such correlations. We analytically characterize the worst case detection delay and average run length to false alarm performance of pdf-Approximation based approach. We also numerically study the performance and offer insights on the relevance of various decision statistics in different signal to noise ratio (SNR) regimes. We also address the problem of designing sensing matrices with small mutual coherence by using designs from quantum information theory. One such design using equi-Angular lines has an additional structure which allows exact characterization of the post-change pdf of the correlation values, even when the support set of the sparse signal is unknown. We apply our detection algorithms with sensing matrix designed from equi-Angular lines to a massive random access problem and show their superior performance over conventional Gold codes.