Demo Data from EDBT 2026 / reviewers in the wild / expert
Natalia Nottingham
dblp:339/0377
· DBLP profile ↗
3ranked-venue papers
0as first author
3since 2021 · last 2026
0000-0003-3824-074XORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 2 · 2 since 2021Software engineering, systems software and programming languages · 2 · 2 since 2021Theory 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.
| Computer architecture, parallel and distributed computing, and storage systems
2 papers |
Emerging computing paradigms · 100% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Emerging computing paradigms › quantum computer architecture
quantum compilation |
1.3 | 2 | 2023 | Dancing the Quantum Waltz: Compiling Three-Qubit Gates on Four Level Architectures · ISCA 2023 Qompress: Efficient Compilation for Ququarts Exploiting Partial and Mixed Radix Operations for Communication Reduction · ASPLOS (2) 2023 |
Emerging computing paradigms
quantum computer architecture |
1.3 | 2 | 2023 | Dancing the Quantum Waltz: Compiling Three-Qubit Gates on Four Level Architectures · ISCA 2023 Qompress: Efficient Compilation for Ququarts Exploiting Partial and Mixed Radix Operations for Communication Reduction · ASPLOS (2) 2023 |
Emerging computing paradigms › quantum control
quantum optimal control |
0.7 | 1 | 2023 | Qompress: Efficient Compilation for Ququarts Exploiting Partial and Mixed Radix Operations for Communication Reduction · ASPLOS (2) 2023 |
Emerging computing paradigms
quantum computing |
0.2 | 1 | 2023 | Dancing the Quantum Waltz: Compiling Three-Qubit Gates on Four Level Architectures · ISCA 2023 |
Emerging computing paradigms › quantum computing
superconducting qubit |
0.2 | 1 | 2023 | Dancing the Quantum Waltz: Compiling Three-Qubit Gates on Four Level Architectures · ISCA 2023 |
Methods — techniques the papers use, named apart from their topics
qubit encoding · 0.7qubit compression · 0.7quantum optimal control · 0.7gate decomposition · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | qSIEVE: Efficient qLDPC Memory via Systolic Movement in Atom ArraysabstractAs quantum machines have scaled up in their number of qubits, significant research has turned towards increasing their fidelity with quantum error correction codes. Although promising results have been shown with the surface code, which only requires near-neighbor connections between qubits, the high qubit overhead of such local codes promises to be problematic. Consequently, recent work has explored non-local quantum LDPC (qLDPC) codes, which have good asymptotic encoding rates. Despite theoretical progress, hardware implementations of these codes have been a longstanding challenge. At the experimental level, demonstrations of movement based communication on atom arrays suggest this is a powerful new primitive to achieve non-local connectivity. Leveraging this, we present a protocol for implementing non-local qLDPC codes in hardware. Our protocol, qSIEVE, is a co-design of such codes with movement in atom arrays. qSIEVE defines a restricted family of qLDPC codes that can be implemented efficiently with systolic movement. We then quantify the utility of qSIEVE in the context of a complete fault tolerant architecture. We compare the cost of implementing benchmark programs in a standard, surface code only architecture and a mixed architecture where data is stored in qLDPC memory with qSIEVE and loaded to surface codes for computation. Joshua Viszlai, Willers Yang, Sophia Fuhui Lin, Junyu Liu, Natalia Nottingham, Jonathan M. Baker, Fred Chong |
ACM Trans. Quantum Comput. | 5 |
| 2023 | Qompress: Efficient Compilation for Ququarts Exploiting Partial and Mixed Radix Operations for Communication ReductionabstractQuantum computing is in an era of limited resources. Current hardware lacks high fidelity gates, long coherence times, and the number of computational units required to perform meaningful computation. Contemporary quantum devices typically use a binary system, where each qubit exists in a superposition of the 0 and 1 states. However, it is often possible to access the 2 or even 3 states in the same physical unit by manipulating the system in different ways. In this work, we consider automatically encoding two qubits into one four-state ququart via a compression scheme. We use quantum optimal control to design efficient proof-of-concept gates that fully replicate standard qubit computation on these encoded qubits. Andrew Litteken, Lennart Maximilian Seifert, Jason Chadwick, Natalia Nottingham, Fred Chong, Jonathan M. Baker |
ASPLOS (2) | 4 |
| 2023 | Dancing the Quantum Waltz: Compiling Three-Qubit Gates on Four Level ArchitecturesabstractSuperconducting quantum devices are a leading technology for quantum computation, but they face several challenges. Gate errors, coherence errors and a lack of connectivity all contribute to low fidelity results. In particular, connectivity restrictions enforce a gate set that requires three-qubit gates to be decomposed into one- or two-qubit gates. This substantially increases the number of two-qubit gates that need to be executed. However, many quantum devices have access to higher energy levels. We can expand the qubit abstraction of |0〉 and |1〉 to a ququart which has access to the |2〉 and |3〉 state, but with shorter coherence times. This allows for two qubits to be encoded in one ququart, enabling increased virtual connectivity between physical units from two adjacent qubits to four fully connected qubits. This connectivity scheme allows us to more efficiently execute three-qubit gates natively between two physical devices. Andrew Litteken, Lennart Maximilian Seifert, Jason Chadwick, Natalia Nottingham, Tanay Roy, David I. Schuster, Fred Chong, Jonathan M. Baker |
ISCA | 4 |