◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

V. Nesme

2 papers hereh-index 12765 citations27 works total

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

author position
  • middle author2

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

fields
  • quant-ph2

identity via Semantic Scholar / OpenAlex

most citedA quantum lower bound for the query complexity of Simon's problem

7 citations · 9 across the 2 of their papers we have counts for

collaborators

2 papers

quant-ph2007★ 2 cited

One-dimensional quantum cellular automata over finite, unbounded configurations

Pablo Arrighi, Vincent Nesme, Reinhard Werner

One-dimensional quantum cellular automata (QCA) consist in a line of identical, finite dimensional quantum systems. These evolve in discrete time steps according to a local, shift-…

quant-ph2005★ 7 cited

A quantum lower bound for the query complexity of Simon's problem

Pascal Koiran, Vincent Nesme, Natacha Portier

Simon in his FOCS'94 paper was the first to show an exponential gap between classical and quantum computation. The problem he dealt with is now part of a well-studied class of prob…

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