Demo Data from VLDB 2026 / reviewers in the wild / expert
Thiago Melo D. Azevedo
dblp:340/4125
· DBLP profile ↗
2ranked-venue papers
0as first author
2since 2021 · last 2025
0000-0002-1068-1618ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 2 · 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
1 paper |
Emerging computing paradigms · 100% | |
| Theoretical computer science
1 paper |
Quantum computing and quantum information · 100% |
Topics — the 5 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 compilation |
0.9 | 1 | 2025 | Linear Decomposition of Approximate Multicontrolled Single Qubit Gates · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2025 |
Emerging computing paradigms
quantum computer architecture |
0.9 | 1 | 2025 | Linear Decomposition of Approximate Multicontrolled Single Qubit Gates · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2025 |
Quantum computing and quantum information
quantum circuit synthesis |
0.8 | 1 | 2024 | Circuit Decomposition of Multicontrolled Special Unitary Single-Qubit Gates · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2024 |
Quantum computing and quantum information › quantum computing
quantum state preparation |
0.8 | 1 | 2024 | Circuit Decomposition of Multicontrolled Special Unitary Single-Qubit Gates · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2024 |
Emerging computing paradigms › quantum computer architecture › quantum circuit optimization
quantum gate optimization |
0.3 | 1 | 2025 | Linear Decomposition of Approximate Multicontrolled Single Qubit Gates · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2025 |
Methods — techniques the papers use, named apart from their topics
optimization · 0.9linear decomposition · 0.9SU(2) gate decomposition · 0.8CNOT gate decomposition · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Linear Decomposition of Approximate Multicontrolled Single Qubit GatesabstractWe provide a method for compiling approximate multicontrolled single qubit gates into quantum circuits. Without ancilla qubits, the total number of elementary gates to decompose an n-qubit multicontrolled gate is proportional to 32n elementary operations. The proposed decomposition depends on an optimization technique that minimizes the CNOT gate count for multitarget and multicontrolled CNOT and SU(2) gates. We also provide an approximate decomposition with ancilla qubits with lower-circuit complexity. Computational experiments show the reduction of CNOT gates when multicontrolled U(2) gates are applied. As multicontrolled single-qubit gates serve as fundamental components of quantum algorithms, the proposed decomposition offers a comprehensive solution that can significantly decrease the count of elementary operations employed in quantum computing applications. Jefferson D. S. Silva, Thiago Melo D. Azevedo, Israel F. Araujo, Adenilton J. da Silva |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. | 2 |
| 2024 | Circuit Decomposition of Multicontrolled Special Unitary Single-Qubit GatesabstractMulticontrolled unitary gates have been a subject of interest in quantum computing since their conception and are widely used in quantum algorithms. The current state-of-the-art approach to implementing$n$-qubit multicontrolled gates with a single target without relying on auxiliary qubits or approximate results involves the use of a quadratic number of single-qubit and CNOT gates. However, linear solutions are possible for the case where the controlled gate is special unitary, SU(2). The decomposition of an$n$-qubit multicontrolled SU(2) gate requires a circuit with a number of CNOT gates proportional to$28n$. In this work, we present a new decomposition of$n$-qubit multicontrolled SU(2) gates that require a circuit with a number of CNOT gates proportional to$20n$and proportional to$16n$if the SU(2) gate has at least one real-valued diagonal. The proposed algorithms produce the most efficient known circuits and improve the existing algorithm by reducing the number of CNOT gates and the overall circuit depth. As an application, we show the use of this decomposition for sparse quantum state preparation. Our results are further validated by demonstrating a proof of principle on a quantum device accessed through quantum cloud services. Rafaella F. Vale, Thiago Melo D. Azevedo, Ismael C. S. Araujo, Israel F. Araujo, Adenilton J. da Silva |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. | 2 |