EDBT 2026 Demo / reviewers in the wild / expert
Taylor Lee Patti
dblp:180/0160
· DBLP profile ↗
2ranked-venue papers
1as first author
2since 2021 · last 2025
0000-0002-4242-6072ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 2 · 1 first-author · 2 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 · 53% High-performance computing · 20% Parallel and multicore computing · 20% |
Topics — the 4 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 circuit simulation |
0.9 | 1 | 2025 | Augmenting Simulated Noisy Quantum Data Collection by Orders of Magnitude Using Pre-Trajectory Sampling with Batched Execution · SC 2025 |
Emerging computing paradigms
quantum computing |
0.9 | 1 | 2025 | Augmenting Simulated Noisy Quantum Data Collection by Orders of Magnitude Using Pre-Trajectory Sampling with Batched Execution · SC 2025 |
High-performance computing › sparse linear algebra
sparse matrix computation |
0.7 | 1 | 2023 | Legate Sparse: Distributed Sparse Computing in Python · SC 2023 |
GPUs and heterogeneous computing
multi-GPU computing |
0.2 | 1 | 2023 | Legate Sparse: Distributed Sparse Computing in Python · SC 2023 |
Methods — techniques the papers use, named apart from their topics
tensor network simulation · 0.9pre-trajectory sampling · 0.9batched execution · 0.9static and dynamic distribution techniques · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Augmenting Simulated Noisy Quantum Data Collection by Orders of Magnitude Using Pre-Trajectory Sampling with Batched ExecutionabstractClassically simulating quantum systems is challenging, as even noiseless n-qubit quantum states scale as 2n. The complexity of noisy quantum systems is even greater, requiring 2n × 2n-dimensional density matrices. Various approximations reduce density matrix overhead, including quantum trajectory-based methods, which instead use an ensemble of m ≪ 2n noisy states. While this method is dramatically more efficient, current implementations use unoptimized sampling, redundant state preparation, and single-shot data collection. In this manuscript, we present the Pre-Trajectory Sampling technique, increasing the efficiency and utility of trajectory simulations by tailoring error types, batching sampling without redundant computation, and collecting error information. We demonstrate the effectiveness of our method with both a mature statevector simulation of a 35-qubit quantum error-correction code and a preliminary tensor network simulation of 85 qubits, yielding speedups of up to 106x and 16x, as well as generating massive datasets of one trillion and one million shots, respectively. Taylor Lee Patti, Thien Nguyen 0001, Justin Lietz, Alex McCaskey, Brucek Khailany |
SC | 1 |
| 2023 | Legate Sparse: Distributed Sparse Computing in PythonabstractThe sparse module of the popular SciPy Python library is widely used across applications in scientific computing, data analysis and machine learning. The standard implementation of SciPy is restricted to a single CPU and cannot take advantage of modern distributed and accelerated computing resources. We introduce Legate Sparse, a system that transparently distributes and accelerates unmodified sparse matrix-based SciPy programs across clusters of CPUs and GPUs, and composes with cuNumeric, a distributed NumPy library. Legate Sparse uses a combination of static and dynamic techniques to efficiently compose independently written sparse and dense array programming libraries, providing a unified Python interface for distributed sparse and dense array computations. We show that Legate Sparse is competitive with single-GPU libraries like CuPy and achieves 65% of the performance of PETSc on up to 1280 CPU cores and 192 GPUs of the Summit supercomputer, while offering the productivity benefits of idiomatic SciPy and NumPy. Rohan Yadav, Wonchan Lee, Melih Elibol, Manolis Papadakis, Taylor Lee Patti, Michael Garland, Alex Aiken, Fredrik Kjolstad, Michael Bauer 0001 |
SC | 5 |