Demo Data from EDBT 2026 / reviewers in the wild / expert
Ren-Chu Wang
dblp:318/2739
· DBLP profile ↗
2ranked-venue papers
0as first author
2since 2021 · last 2024
0009-0005-7118-5131ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 1 · 1 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
1 paper |
Electronic design automation · 100% | |
| Theoretical computer science
1 paper |
Mathematical optimization · 100% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Electronic design automation › physical design › placement
circuit placement |
0.6 | 1 | 2022 | Flexible chip placement via reinforcement learning: late breaking results · DAC 2022 |
Electronic design automation › physical design › placement › module placement
macro placement |
0.6 | 1 | 2022 | Flexible chip placement via reinforcement learning: late breaking results · DAC 2022 |
Electronic design automation
physical design |
0.6 | 1 | 2022 | Flexible chip placement via reinforcement learning: late breaking results · DAC 2022 |
Mathematical optimization
multi-objective optimization |
0.2 | 1 | 2022 | Flexible chip placement via reinforcement learning: late breaking results · DAC 2022 |
Mathematical optimization › multi-objective optimization
pareto front |
0.2 | 1 | 2022 | Flexible chip placement via reinforcement learning: late breaking results · DAC 2022 |
Methods — techniques the papers use, named apart from their topics
reinforcement learning · 1.1multi-objective reinforcement learning · 1.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Robust Qubit Mapping Algorithm via Double-Source Optimal Routing on Large Quantum CircuitsabstractQubit mapping is a critical aspect of implementing quantum circuits on real hardware devices. Currently, the existing algorithms for qubit mapping encounter difficulties when dealing with larger circuit sizes involving hundreds of qubits. In this article, we introduce an innovative qubit mapping algorithm, Duostra, tailored to address the challenge of implementing large-scale quantum circuits on real hardware devices with limited connectivity. Duostra operates by efficiently determining optimal paths for double-qubit gates and inserting SWAP gates accordingly to implement the double-qubit operations on real devices. Together with two heuristic scheduling algorithms, Limitedly Exhaustive Search and Shortest-Path Estimation, it yields results of good quality within a reasonable runtime, thereby striving toward achieving quantum advantage. Experimental results showcase our algorithm’s superiority, especially for large circuits beyond the NISQ era. For example, on large circuits with more than 50 qubits, we can reduce the mapping cost on an average 21.75% over the virtual best results among QMAP, t \(|ket\rangle\) , Qiskit, and SABRE. Besides, for mid-size circuits such as the SABRE-large benchmark, we improve the mapping costs by 4.5%, 5.2%, 16.3%, 20.7%, and 25.7%, when compared to QMAP, TOQM, t \(|ket\rangle\) , Qiskit, and SABRE, respectively. Chin-Yi Cheng, Chien-Yi Yang, Yi-Hsiang Kuo, Ren-Chu Wang, Hao-Chung Cheng 0001, Chung-Yang Huang |
ACM Trans. Quantum Comput. | 4 |
| 2022 | Flexible chip placement via reinforcement learning: late breaking resultsabstractRecently, successful applications of reinforcement learning to chip placement have emerged. Pretrained models are necessary to improve efficiency and effectiveness. Currently, the weights of objective metrics (e.g., wirelength, congestion, and timing) are fixed during pretraining. However, fixed-weighed models cannot generate the diversity of placements required for engineers to accommodate changing requirements as they arise. This paper proposes flexible multiple-objective reinforcement learning (MORL) to support objective functions with inference-time variable weights using just a single pretrained model. Our macro placement results show that MORL can generate the Pareto frontier of multiple objectives effectively. Fu-Chieh Chang 0001, Yu-Wei Tseng, Ya-Wen Yu, Ssu-Rui Lee, Alexandru Cioba, I-Lun Tseng, Da-Shan Shiu, Jhih-Wei Hsu, Cheng-Yuan Wang, Chien-Yi Yang, Ren-Chu Wang, Yao-Wen Chang, Tai-Chen Chen, Tung-Chieh Chen |
DAC | 11 |