◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

N. Nahimovs

11 papers hereh-index 9225 citations18 works total

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

author position
  • sole author2
  • first author5
  • middle author3
  • last author1

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

fields
  • quant-ph11

identity via Semantic Scholar / OpenAlex

activity
20082021
most citedUpperbounds on the probability of finding marked connected components using quantum walks

9 citations · 30 across the 10 of their papers we have counts for

collaborators
Showing 2016 · quant-phShow all

1 paper · 2 filters

quant-ph2016

Adjacent vertices can be hard to find by quantum walks

Nikolajs Nahimovs, Raqueline A. M. Santos

Quantum walks have been useful for designing quantum algorithms that outperform their classical versions for a variety of search problems. Most of the papers, however, consider a s…

◍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.