Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.

Virgile Guemard

dblp:376/5516 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2025
0000-0002-8981-2181ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 1 · 1 first-author · 1 since 2021

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 · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Quantum computing and quantum information › quantum error correction
CSS codes
0.912025
Lifts of Quantum CSS Codes · IEEE Trans. Inf. Theory 2025
Quantum computing and quantum information › quantum error correction
hypergraph product codes
0.912025
Lifts of Quantum CSS Codes · IEEE Trans. Inf. Theory 2025
Quantum computing and quantum information › quantum error correction
quantum code
0.912025
Lifts of Quantum CSS Codes · IEEE Trans. Inf. Theory 2025

Methods — techniques the papers use, named apart from their topics

tanner cone-complex · 0.9covering spaces · 0.9
YearPublicationVenuePosition
2025 Lifts of Quantum CSS Codes
abstract
We propose a notion of lift for quantum CSS codes, inspired by the geometrical construction of Freedman and Hastings. It is based on the existence of a canonical complex associated to any CSS code, that we introduce under the name of Tanner cone-complex, and over which we generate covering spaces. As a first application, we describe the classification of lifts of hypergraph product codes (HPC) and demonstrate the equivalence with the lifted product code (LPC) of Panteleev and Kalachev, including when the linear codes, factors of the HPC, are Tanner codes. As a second application, we report several new non-product constructions of quantum CSS codes, and we apply the prescription to generate their lifts which, for certain selected covering maps, are codes with improved relative parameters compared to the initial one.
Virgile Guemard
IEEE Trans. Inf. Theory1