researcher

I. Markov

43 papers hereh-index 6816.2k citations335 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position

sole author3
first author7
middle author15
last author18

Across the 43 of 43 papers where every author was matched, so the position is known.

fields

quant-ph26
cs.ET6
cs.LG4
cs.DS3
cs.AI1
cs.CR1

same name

I. Markov — 13 papers, h 22
I. Markov — 5 papers, h 19

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity

20022023

most citedSynthesis of Quantum Logic Circuits

695 citations · 2.6k across the 40 of their papers we have counts for

collaborators

Showing 2013Show all

2 papers · 1 filter

cs.ET2013★ 2 cited

Quantum Circuits for GCD Computation with $O (n lo g n)$ Depth and O(n) Ancillae

Mehdi Saeedi, Igor L. Markov

GCD computations and variants of the Euclidean algorithm enjoy broad uses in both classical and quantum algorithms. In this paper, we propose quantum circuits for GCD computation w…

quant-ph2013★ 34 cited

Faster Quantum Number Factoring via Circuit Synthesis

Igor L. Markov, Mehdi Saeedi

A major obstacle to implementing Shor's quantum number-factoring algorithm is the large size of modular-exponentiation circuits. We reduce this bottleneck by customizing reversible…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore

Search
Researchers
Institutions

Account

Library
Chat

Data

arXiv.org
Semantic Scholar
OpenAlex
Latest RSS

About Contact Privacy Developers llms.txt openapi.json

Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.

Quantum Circuits for GCD Computation with O(nlogn) Depth and O(n) Ancillae

Faster Quantum Number Factoring via Circuit Synthesis

Quantum Circuits for GCD Computation with $O (n lo g n)$ Depth and O(n) Ancillae