◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

P. Koiran

3 papers hereh-index 292.8k citations118 works total

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

author position
  • sole author1
  • first author1
  • middle author1

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

fields
  • quant-ph2
  • math.LO1

identity via Semantic Scholar / OpenAlex

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

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

collaborators
Showing 2003Show all

1 paper · 1 filter

quant-ph2003★ 1 cited

Decidable and undecidable problems about quantum automata

Vincent D. Blondel, Emmanuel Jeandel, Pascal Koiran +1

We study the following decision problem: is the language recognized by a quantum finite automaton empty or non-empty? We prove that this problem is decidable or undecidable dependi…

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