Antonio Michele Miti

dblp:415/5706 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2025
0000-0002-8829-1943ORCID · reported

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

Systems, architecture and hardware · 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 · 50% Algorithms and data structures · 50%

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

TopicWeightPapersLastEvidence papers
Algorithms and data structures
modular arithmetic
0.912025
Measurement-based uncomputation of quantum circuits for modular arithmetic · DAC 2025
Quantum computing and quantum information
quantum circuit optimization
0.912025
Measurement-based uncomputation of quantum circuits for modular arithmetic · DAC 2025

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

measurement-based uncomputation · 0.9
YearPublicationVenuePosition
2025 Measurement-based uncomputation of quantum circuits for modular arithmetic
abstract
Measurement-based uncomputation (MBU) is a technique used to perform probabilistic uncomputation of quantum circuits. We formalize this technique for the case of single-qubit registers, and we show applications to modular arithmetic. Using MBU, we reduce Toffoli count and depth by 10% to 15% for modular adders based on the architecture of [1], and by almost 25% for modular adders based on the architecture of [2]. Our results have the potential to improve other circuits for modular arithmetic, such as modular multiplication and modular exponentiation, and can find applications in quantum cryptanalysis.
Alessandro Luongo, Antonio Michele Miti, Varun Narasimhachar, Adithya Sireesh
DAC2