Demo Data from EDBT 2026 / reviewers in the wild / expert
Máté Farkas
dblp:203/4427
· DBLP profile ↗
1ranked-venue papers
1as first author
1since 2021 · last 2023
0000-0002-2682-8215ORCID · 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
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Quantum computing and quantum information
quantum communication |
0.7 | 1 | 2023 | Mutually Unbiased Measurements, Hadamard Matrices, and Superdense Coding · IEEE Trans. Inf. Theory 2023 |
Quantum computing and quantum information › quantum communication
superdense coding |
0.7 | 1 | 2023 | Mutually Unbiased Measurements, Hadamard Matrices, and Superdense Coding · IEEE Trans. Inf. Theory 2023 |
Quantum computing and quantum information › quantum measurement
mutually unbiased bases |
0.2 | 1 | 2023 | Mutually Unbiased Measurements, Hadamard Matrices, and Superdense Coding · IEEE Trans. Inf. Theory 2023 |
Methods — techniques the papers use, named apart from their topics
quaternionic hadamard matrices · 0.7hadamard matrix · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | Mutually Unbiased Measurements, Hadamard Matrices, and Superdense CodingabstractMutually unbiased bases (MUBs) are highly symmetric bases on complex Hilbert spaces, and the corresponding rank-1 projective measurements are ubiquitous in quantum information theory. In this work, we study a recently introduced generalisation of MUBs called mutually unbiased measurements (MUMs). These measurements inherit the essential property of complementarity from MUBs, but the Hilbert space dimension is no longer required to match the number of outcomes. This operational complementarity property renders MUMs highly useful for device-independent quantum information processing. It has been shown that MUMs are strictly more general than MUBs. In this work we provide a complete proof of the characterisation of MUMs that are direct sums of MUBs. We then construct new examples of MUMs that are not direct sums of MUBs. A crucial technical tool for this construction is a correspondence with quaternionic Hadamard matrices, which allows us to map known examples of such matrices to MUMs that are not direct sums of MUBs. Furthermore, we show that—in stark contrast with MUBs—the number of MUMs for a fixed outcome number is unbounded. Next, we focus on the use of MUMs in quantum communication. We demonstrate how any pair of MUMs with$d$outcomes defines a$d$-dimensional superdense coding protocol. Using MUMs that are not direct sums of MUBs, we disprove a recent conjecture due to Nayak and Yuen on the rigidity of superdense coding, for infinitely many dimensions. The superdense coding protocols arising in the refutation reveal how shared entanglement may be used in a manner heretofore unknown. Máté Farkas, Jedrzej Kaniewski, Ashwin Nayak 0001 |
IEEE Trans. Inf. Theory | 1 |