VLDB 2026 Research / reviewers in the wild / expert
Onur Danaci
dblp:260/0069
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2024
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 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 |
Emerging computing paradigms · 100% | |
| Artificial intelligence
1 paper |
Reinforcement learning · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Emerging computing paradigms › quantum computer architecture
quantum architecture search |
0.8 | 1 | 2024 | Curriculum reinforcement learning for quantum architecture search under hardware errors · ICLR 2024 |
Emerging computing paradigms
quantum computer architecture |
0.8 | 1 | 2024 | Curriculum reinforcement learning for quantum architecture search under hardware errors · ICLR 2024 |
Emerging computing paradigms › quantum computing
variational quantum algorithm |
0.8 | 1 | 2024 | Curriculum reinforcement learning for quantum architecture search under hardware errors · ICLR 2024 |
Machine learning › Reinforcement learning
curriculum reinforcement learning |
0.2 | 1 | 2024 | Curriculum reinforcement learning for quantum architecture search under hardware errors · ICLR 2024 |
Methods — techniques the papers use, named apart from their topics
simultaneous perturbation stochastic approximation · 1.5pauli-transfer matrix formalism · 1.5curriculum reinforcement learning · 1.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Curriculum reinforcement learning for quantum architecture search under hardware errorsabstractThe key challenge in the noisy intermediate-scale quantum era is finding useful circuits compatible with current device limitations.
Variational quantum algorithms (VQAs) offer a potential solution by fixing the circuit architecture and optimizing individual gate parameters in an external loop. However, parameter optimization can become intractable, and the overall performance of the algorithm depends heavily on the initially chosen circuit architecture. Several quantum architecture search (QAS) algorithms have been developed to design useful circuit architectures automatically. In the case of parameter optimization alone, noise effects have been observed to dramatically influence the performance of the optimizer and final outcomes, which is a key line of study. However, the effects of noise on the architecture search, which could be just as critical, are poorly understood. This work addresses this gap by introducing a curriculum-based reinforcement learning QAS (CRLQAS) algorithm designed to tackle challenges in realistic VQA deployment. The algorithm incorporates (i) a 3D architecture encoding and restrictions on environment dynamics to explore the search space of possible circuits efficiently, (ii) an episode halting scheme to steer the agent to find shorter circuits, and (iii) a novel variant of simultaneous perturbation stochastic approximation as an optimizer for faster convergence. To facilitate studies, we developed an optimized simulator for our algorithm, significantly improving computational efficiency in simulating noisy quantum circuits by employing the Pauli-transfer matrix formalism in the Pauli-Liouville basis. Numerical experiments focusing on quantum chemistry tasks demonstrate that CRLQAS outperforms existing QAS algorithms across several metrics in both noiseless and noisy environments. Yash J. Patel, Akash Kundu, Mateusz Ostaszewski, Xavier Bonet-Monroig, Vedran Dunjko, Onur Danaci |
ICLR | 6 |