EDBT 2026 Demo / reviewers in the wild / expert
Piotr Dulian
dblp:363/4473
· DBLP profile ↗
1ranked-venue papers
1as first author
1since 2021 · last 2024
0009-0006-7312-2844ORCID · 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 · 33% Information theory · 33% Graph algorithms and graph theory · 33% |
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 gates |
0.8 | 1 | 2024 | A Random Matrix Model for Random Approximate t-Designs · IEEE Trans. Inf. Theory 2024 |
Information theory › probability theory
random matrix theory |
0.8 | 1 | 2024 | A Random Matrix Model for Random Approximate t-Designs · IEEE Trans. Inf. Theory 2024 |
Graph algorithms and graph theory › spectral graph theory
spectral gap |
0.8 | 1 | 2024 | A Random Matrix Model for Random Approximate t-Designs · IEEE Trans. Inf. Theory 2024 |
Methods — techniques the papers use, named apart from their topics
random matrix ensembles · 0.8ginibre ensemble · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | A Random Matrix Model for Random Approximate t-DesignsabstractFor a Haar random set$\mathcal {S}\subset U(d)$of quantum gates we consider the uniform measure$\nu_{\mathcal {S}}$whose support is given by$\mathcal {S}$. The measure$\nu _{\mathcal {S}}$can be regarded as a$\delta (\nu _{\mathcal {S}},t)$-approximate$t$-design,$t\in \mathbb {Z}_{+}$. We propose a random matrix model that aims to describe the probability distribution of$\delta (\nu _{\mathcal {S}},t)$for any$t$. Our model is given by a block diagonal matrix whose blocks are independent, given by Gaussian or Ginibre ensembles, and their number, size and type is determined by$t$. We prove that, the operator norm of this matrix,$\delta ({t})$, is the random variable to which$\sqrt {|\mathcal {S}|}\delta (\nu _{\mathcal {S}},t)$converges in distribution when the number of elements in$\mathcal {S}$grows to infinity. Moreover, we characterize our model giving explicit bounds on the tail probabilities$\mathbb {P}(\delta (t)>2+\epsilon)$, for any$\epsilon >0$. We also show that our model satisfies the so-called spectral gap conjecture, i.e. we prove that with the probability 1 there is$t\in \mathbb {Z}_{+}$such that$\sup _{k\in \mathbb {Z}_{+}}\delta (k)=\delta (t)$. Numerical simulations give convincing evidence that the proposed model is actually almost exact for any cardinality of$\mathcal {S}$. The heuristic explanation of this phenomenon, that we provide, leads us to conjecture that the tail probabilities$\mathbb {P}(\sqrt {\mathcal {S}}\delta (\nu _{\mathcal {S}},t)>2+\epsilon)$are bounded from above by the tail probabilities$\mathbb {P}(\delta (t)>2+\epsilon)$of our random matrix model. In particular our conjecture implies that a Haar random set$\mathcal {S}\subset U(d)$satisfies the spectral gap conjecture with the probability 1. Piotr Dulian, Adam Sawicki |
IEEE Trans. Inf. Theory | 1 |