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.

Marcos Curty

dblp:18/8035 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2026
0000-0002-0330-6828ORCID · reported

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

Theory of computation · 1 · 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 · 83% Coding theory · 17%

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

TopicWeightPapersLastEvidence papers
Quantum computing and quantum information › quantum entanglement
entanglement distillation
1.012026
Geometrical Constructions of Purity Testing Protocols and Their Applications to Quantum Communication · IEEE Trans. Inf. Theory 2026
Quantum computing and quantum information
quantum communication
1.012026
Geometrical Constructions of Purity Testing Protocols and Their Applications to Quantum Communication · IEEE Trans. Inf. Theory 2026
Quantum computing and quantum information
quantum error correction
1.012026
Geometrical Constructions of Purity Testing Protocols and Their Applications to Quantum Communication · IEEE Trans. Inf. Theory 2026
Coding theory
error-correcting codes
0.312026
Geometrical Constructions of Purity Testing Protocols and Their Applications to Quantum Communication · IEEE Trans. Inf. Theory 2026
Coding theory › error-correcting codes › block codes
linear code
0.312026
Geometrical Constructions of Purity Testing Protocols and Their Applications to Quantum Communication · IEEE Trans. Inf. Theory 2026

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

geometrical construction · 1.0
YearPublicationVenuePosition
2026 Geometrical Constructions of Purity Testing Protocols and Their Applications to Quantum Communication
abstract
Purity testing protocols (PTPs), also known as Bell state testing protocols, i.e., protocols that decide with high probability whether or not a distributed bipartite quantum state is a tensor product of Bell states, have been proven to be a useful tool in many quantum communication applications. In this paper, we provide geometrical constructions for such protocols that originate directly from classical linear error correcting codes (LECCs), in a way that the properties of the resulting PTP are completely determined from those of the LECC used in the construction. We investigate the implications of our results in various quantum communication tasks, including error detection, entanglement purification for general quantum error models and quantum message authentication.
Róbert Trényi, Simeon Ball, David G. Glynn, Marcos Curty
IEEE Trans. Inf. Theory4