Zobrazeno 1 - 10
of 1 095
pro vyhledávání: '"Sarvepalli A"'
Coded caching is a technique for achieving increased throughput in cached networks during peak hours. Placement delivery arrays (PDAs) capture both placement and delivery scheme requirements in coded caching in a single array. Lifting is a method of
Externí odkaz:
http://arxiv.org/abs/2305.06352
Recently, a class of quantum secret sharing schemes called communication efficient quantum threshold secret sharing schemes (CE-QTS) was introduced. These schemes reduced the communication cost during secret recovery. In this paper, we introduce a ge
Externí odkaz:
http://arxiv.org/abs/2211.06910
Publikováno v:
In Computers and Fluids 15 November 2024 284
Topological 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
Externí odkaz:
http://arxiv.org/abs/2111.14594
Publikováno v:
Phys. Rev. A 105, 022621 (2022)
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. T
Externí odkaz:
http://arxiv.org/abs/2110.08680
Autor:
Mowoh, Daniel Praise M., Cole, Rachel, Sarvepalli, Shravan, Grover, Karan, Abbas, Mujjahid, Khaitan, Leena
Publikováno v:
In Surgery April 2024 175(4):943-946
Autor:
Grzywacz, Vincent P., Lehrberg, Anna V., Quinn, Thomas J., Zureick, Andrew H., Sarvepalli, Neha, Oliver, Lauren N., Dekhne, Nayana S., Dilworth, Joshua T.
Publikováno v:
In Clinical Breast Cancer April 2024 24(3):227-236
Publikováno v:
Phys. Rev. A 104, 012603 (2021)
Twists are defects in the lattice that can be used to perform encoded computations. Three basic types of twists can be introduced in color codes, namely, twists that permute color, charge of anyons and domino twists that permute the charge label of a
Externí odkaz:
http://arxiv.org/abs/2104.03669
In this paper we study the problem of private information retrieval where a user seeks to retrieve one of the $F$ files from a cluster of $N$ non-colluding servers without revealing the identity of the requested file. In our setting the servers are s
Externí odkaz:
http://arxiv.org/abs/2103.09804
A $((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 informa
Externí odkaz:
http://arxiv.org/abs/2101.12419