Ermal Rrapaj

dblp:308/2432 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
4since 2021 · last 2026
0000-0002-3222-7010ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 3 · 3 since 2021Artificial intelligence and machine learning · 1 · 1 since 2021Software engineering, systems software and programming languages · 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
2 papers
Quantum computing and quantum information · 100%
Artificial intelligence
1 paper
Language models and text generation · 87% Trustworthy machine learning · 13%
Software engineering, system software, and programming languages
1 paper
Compilers and program optimization · 100%

Topics — the 6 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Quantum computing and quantum information
quantum simulation
1.922026
QTurbo: A Robust and Efficient Compiler for Analog Quantum Simulation · ASPLOS (1) 2026
HATT: Hamiltonian Adaptive Ternary Tree for Optimizing Fermion-to-Qubit Mapping · HPCA 2025
Compilers and program optimization › domain-specific compilation
quantum compilation
1.012026
QTurbo: A Robust and Efficient Compiler for Analog Quantum Simulation · ASPLOS (1) 2026
Natural language and speech › Language models and text generation
large language model evaluation
0.912025
Model Consistency as a Cheap yet Predictive Proxy for LLM Elo Scores · EMNLP 2025
Natural language and speech › Language models and text generation › large language model evaluation
model consistency
0.912025
Model Consistency as a Cheap yet Predictive Proxy for LLM Elo Scores · EMNLP 2025
Quantum computing and quantum information
quantum circuit compilation
0.912025
HATT: Hamiltonian Adaptive Ternary Tree for Optimizing Fermion-to-Qubit Mapping · HPCA 2025
Quantum computing and quantum information
quantum circuit optimization
0.312025
HATT: Hamiltonian Adaptive Ternary Tree for Optimizing Fermion-to-Qubit Mapping · HPCA 2025

Methods — techniques the papers use, named apart from their topics

ternary tree mapping · 0.9consistency measurement · 0.9bottom-up construction · 0.9LLM-as-judge · 0.9
YearPublicationVenuePosition
2026 QTurbo: A Robust and Efficient Compiler for Analog Quantum Simulation
abstract
Analog quantum simulation leverages native hardware dynamics to emulate complex quantum systems with great efficiency by bypassing the quantum circuit abstraction. However, conventional compilation methods for analog simulators are typically labor-intensive, prone to errors, and computationally demanding. This paper introduces QTurbo, a powerful analog quantum simulation compiler designed to significantly enhance compilation efficiency and optimize hardware execution time. By generating precise and noise-resilient pulse schedules, our approach ensures greater accuracy and reliability, outperforming the existing state-of-the-art approach.
Junyu Zhou 0005, Yuhao Liu 0017, Shize Che, Anupam Mitra, Efekan Kökcü, Ermal Rrapaj, Costin Iancu, Gushu Li
ASPLOS (1)6
2025 Model Consistency as a Cheap yet Predictive Proxy for LLM Elo Scores
abstract
New large language models (LLMs) are being released every day.Some perform significantly better or worse than expected given their parameter count.Therefore, there is a need for a method to independently evaluate models.The current best way to evaluate a model is to measure its Elo score by comparing it to other models in a series of contests-an expensive operation since humans are ideally required to compare LLM outputs.We observe that when an LLM is asked to judge such contests, the consistency with which it selects a model as the best in a matchup produces a metric that is 91% correlated with its own human-produced Elo score.This provides a simple proxy for Elo scores that can be computed cheaply, without any human data or prior knowledge.
Ashwin Ramaswamy, Nestor Demeure, Ermal Rrapaj
EMNLP3
2025 HATT: Hamiltonian Adaptive Ternary Tree for Optimizing Fermion-to-Qubit Mapping
abstract
This paper introduces the Hamiltonian-Adaptive Ternary Tree (HATT) framework to compile optimized Fermion-to-qubit mapping for specific Fermionic Hamiltonians. In the simulation of Fermionic quantum systems, efficient Fermion-toqubit mapping plays a critical role in transforming the Fermionic system into a qubit system. HATT utilizes ternary tree mapping and a bottom-up construction procedure to generate Hamiltonian aware Fermion-to-qubit mapping to reduce the Pauli weight of the qubit Hamiltonian, resulting in lower quantum simulation circuit overhead. Additionally, our optimizations retain the important vacuum state preservation property in our Fermion-toqubit mapping and reduce the complexity of our algorithm from $O\left(N^{4}\right)$ to $O\left(N^{3}\right)$. Evaluations on various Fermionic systems demonstrate $5 \sim 25 \%$ reduction in Pauli weight, gate count, and circuit depth, alongside excellent scalability to larger systems. Experiments on the Ionq device also show the advantages of HATT in noise resistance in quantum simulations.
Yuhao Liu 0017, Kevin Yao, Jonathan Hong, Julien Froustey, Ermal Rrapaj, Costin Iancu, Gushu Li, Yunong Shi
HPCA5
2025 A Global Perspective on Supercomputer Power Provisioning: Case Studies from United States and Europe
abstract
Electrical provisioning in high performance computing is transitioning from simple nameplate Thermal Design Power (TDP) models to more nuanced approaches based on expected electrical load.This paper captures current power
Tapasya Patki, Barry Rountree, Torsten Wilde, Andrea Bartolini, Stephanie Brink, Esa Heiskanen, Sachin Idgunji, Matthias Maiterth, James H. Rogers, Ermal Rrapaj, Ralf Schneider, Woong Shin, Kathleen Shoga, Christian Simmendinger, Nicholas J. Wright, Zhengji Zhao
ICS10