Demo Data from EDBT 2026 / reviewers in the wild / expert
Hiteshvi Manish Solanki
dblp:295/7102
· DBLP profile ↗
2ranked-venue papers
2as first author
1since 2021 · last 2023
0000-0002-5207-7830ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 1 · 1 first-author · 1 since 2021Theory of computation · 1 · 1 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Theoretical computer science
1 paper |
Quantum computing and quantum information · 50% Coding theory · 50% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory › error-correcting codes › decoding › channel decoding
erasure decoding |
0.7 | 1 | 2023 | Decoding Topological Subsystem Color Codes Over the Erasure Channel Using Gauge Fixing · IEEE Trans. Commun. 2023 |
Quantum computing and quantum information
quantum error correction |
0.7 | 1 | 2023 | Decoding Topological Subsystem Color Codes Over the Erasure Channel Using Gauge Fixing · IEEE Trans. Commun. 2023 |
Methods — techniques the papers use, named apart from their topics
syndrome measurement · 0.7mapping to topological color codes · 0.7gauge fixing · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | Decoding Topological Subsystem Color Codes Over the Erasure Channel Using Gauge FixingabstractTopological 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. Hiteshvi Manish Solanki, Pradeep Kiran Sarvepalli |
IEEE Trans. Commun. | 1 |
| 2020 | Correcting Erasures with Topological Subsystem Color CodesabstractQubit loss is one of the forms of noise encountered in some quantum technologies. Such noise is modeled using the quantum erasure channel. Unlike the depolarizing noise, it is much more tractable, yet the performance of many quantum codes over the erasure channel has not been studied as extensively. In this paper, we study the performance of topological subsystem color codes (TSCCs) over the quantum erasure channel. It is the first such study of TSCCs over the erasure channel. We propose multiple decoding algorithms for TSCC and obtain the highest threshold of about 9.7% for the subsystem color code derived from the square octagon lattice. Hiteshvi Manish Solanki, Pradeep Kiran Sarvepalli |
ITW | 1 |