EDBT 2026 Demo / reviewers in the wild / expert
Masih Mozakka
dblp:376/5135
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2025
—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.
| Theoretical computer science
1 paper |
Quantum computing and quantum information · 75% Mathematical optimization · 25% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Mathematical optimization
gradient estimation |
0.9 | 1 | 2025 | Hadamard Test is Sufficient for Efficient Quantum Gradient Estimation with Lie Algebraic Symmetries · NeurIPS 2025 |
Quantum computing and quantum information › quantum machine learning
parameterized quantum circuit |
0.9 | 1 | 2025 | Hadamard Test is Sufficient for Efficient Quantum Gradient Estimation with Lie Algebraic Symmetries · NeurIPS 2025 |
Quantum computing and quantum information
quantum algorithms |
0.9 | 1 | 2025 | Hadamard Test is Sufficient for Efficient Quantum Gradient Estimation with Lie Algebraic Symmetries · NeurIPS 2025 |
Quantum computing and quantum information
quantum machine learning |
0.9 | 1 | 2025 | Hadamard Test is Sufficient for Efficient Quantum Gradient Estimation with Lie Algebraic Symmetries · NeurIPS 2025 |
Methods — techniques the papers use, named apart from their topics
shadow tomography · 0.9lie algebraic methods · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Hadamard Test is Sufficient for Efficient Quantum Gradient Estimation with Lie Algebraic SymmetriesabstractGradient estimation is a central challenge in training parameterized quantum circuits ( PQCs) for hybrid quantum-classical optimization and learning problems. This difficulty arises from several factors, including the exponential dimensionality of the Hilbert spaces and the information loss in quantum measurements. Existing estimators, such as finite difference and the parameter shift rule, often fail to adequately address these challenges for certain classes of PQCs. In this work, we propose a novel gradient estimation framework that leverages the underlying Lie algebraic structure of PQCs, combined with the Hadamard test. By analyzing the differential of the matrix exponential in Lie algebras, we derive an expression for the gradient as a linear combination of expectation values obtained via Hadamard tests. The coefficients in this decomposition depend solely on the circuit's parameterization and can be computed efficiently. Also, these expectation values can be estimated using state-of-the-art shadow tomography techniques. Our approach enables efficient gradient estimation, requiring a number of measurement shots that scales logarithmically with the number of parameters, and with polynomial classical and quantum time. This is an exponential reduction in the measurement cost and a polynomial speed-up in time compared to existing works. Mohsen Heidari, Masih Mozakka, Wojciech Szpankowski |
NeurIPS | 2 |