Jānis Iraids

Jānis Iraids

Auto-generated profile, based on publicly available information

Jānis Iraids

Faculty of Computing University of Latvia Raiņa bulvāris 19 LV-1586 Rīga Latvia

Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
16 June 2015
Verified
Book Chapter
Closed access
PDF file
JČJuris Čerņenoks
Juris Čerņenoks
JIJānis Iraids
Jānis Iraids
MOMārtiņš Opmanis
Mārtiņš Opmanis
RORihards Opmanis
Rihards Opmanis
KPKārlis Podnieks
Kārlis Podnieks

11 January 2017
Verified
Book Chapter
Closed access
PDF file
AAAndris Ambainis
Andris Ambainis
JIJānis Iraids
Jānis Iraids
DNDaniel Nagaj
Daniel Nagaj

1 January 2013
Verified
Book Chapter
Closed access
PDF file
AAAndris Ambainis
Andris Ambainis
JIJānis Iraids
Jānis Iraids
DKDmitry Kravchenko
Dmitry Kravchenko
MVMadars Virza
Madars Virza

1 January 2012 in Lecture Notes in Computer Science
Verified
Book Chapter
Closed access
PDF file
EKElina Kalnina
Elina Kalnina
AKAudris Kalnins
Audris Kalnins
ASAgris Sostaks
Agris Sostaks
ECEdgars Celms
Edgars Celms
JIJanis Iraids
Janis Iraids

1 January 2010
Verified
Conference Paper
Closed access
EKElina Kalnina
Elina Kalnina
AKAudris Kalnins
Audris Kalnins
ECEdgars Celms
Edgars Celms
Agris ŠostaksAgris Šostaks
Agris Šostaks
JIJanis Iraids
Janis Iraids

24 January 2017 in arXiv
Verified
Preprint
Open access
PDF file
AAAndris Ambainis
Andris Ambainis
JIJanis Iraids
Janis Iraids
We study the computation complexity of Boolean functions in the quantum black box model. In this model our task is to compute a function $f:\{0,1\}\to\{0,1\}$ on an input $x\in\{0,1\}^n$ that can be accessed by querying the black box. Quantum algorithms are inherently probabilistic; we are interested in the lowest possible probability that the algorithm outputs incorrect answer (the error probability) for a fixed number of queries. We show that the lowest possible error probability for $AND_n$ and $EQUALITY_{n+1}$ is $1/2-n/(n^2+1)$.