EDBT 2026 Demo / reviewers in the wild / expert
Uttam Singh
dblp:310/1778
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2023
—ORCID · unresolved
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 · 67% Computational complexity · 33% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computational complexity › relativization
oracle separation |
0.7 | 1 | 2023 | Quantum Depth in the Random Oracle Model · STOC 2023 |
Quantum computing and quantum information
quantum circuit complexity |
0.7 | 1 | 2023 | Quantum Depth in the Random Oracle Model · STOC 2023 |
Quantum computing and quantum information › quantum circuit complexity
shallow quantum circuits |
0.7 | 1 | 2023 | Quantum Depth in the Random Oracle Model · STOC 2023 |
Methods — techniques the papers use, named apart from their topics
quantum circuit simulation · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | Quantum Depth in the Random Oracle ModelabstractWe give a comprehensive characterisation of the computational power of shallow quantum circuits combined with classical computation. Specifically, for classes of search problems, we show that the following statements hold, relative to a random oracle: Atul Singh Arora, Andrea Coladangelo, Matthew Coudron, Alexandru Gheorghiu, Uttam Singh, Hendrik Waldner |
STOC | 5 |