◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Martin Ekerå

8 papers hereh-index 101.1k citations13 works total

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

author position
  • sole author4
  • first author3
  • last author1

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

fields
  • cs.CR5
  • quant-ph3

identity via Semantic Scholar / OpenAlex

activity
20172024
most citedHow to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits

702 citations · 789 across the 8 of their papers we have counts for

collaborators
Showing 2019Show all

2 papers · 1 filter

quant-ph2019★ 702 cited

How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits

Craig Gidney, Martin Ekerå

We significantly reduce the cost of factoring integers and computing discrete logarithms in finite fields on a quantum computer by combining techniques from Shor 1994, Griffiths-Ni…

cs.CR2019★ 2 cited

Revisiting Shor's quantum algorithm for computing general discrete logarithms

Martin Ekerå

We heuristically show that Shor's algorithm for computing general discrete logarithms achieves an expected success probability of approximately 60% to 82% in a single run when modi…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.