Search
Search results
-
Postdoctoral position in theory of quantum computing
... 2014 Employer web page: http://home.lu.lv/~ambainis Applications are invited for a postdoctoral position ...
Position - Ambainis - 26/10/2015 - 17:06
-
Postdoctoral positions in Quantum Algorithms and Theory of Quantum Computing
... contact data of possible references) to Andris Ambainis ( ambainis@lu.lv ). Applications received by January 30, 2016 will receive ...
Position - Ambainis - 22/12/2015 - 13:42 - 0 comments
-
Postdoctoral positions in quantum computing/quantum information at the University of Latvia
... Employer web page: http://home.lanet.lv/~ambainis/ Applications are invited for postdoctoral positions ...
Position - Ambainis - 26/10/2015 - 17:06
-
Postdoctoral positions at the University of Latvia
... Employer web page: http://home.lanet.lv/~ambainis/ Applications are invited for postdoctoral positions ...
Position - Ambainis - 26/10/2015 - 17:06
-
Postdoc position at the Centre for Quantum Computer Science, University of Latvia
... contact data of possible references) to Andris Ambainis ( ambainis@lu.lv ), by September 1, 2020. Submitted 4 years 4 ...
Position - Ambainis - 01/08/2020 - 20:27 - 0 comments
-
Postdoctoral position at Centre for Quantum Computer Science, University of Latvia
... contact data of possible references) to Andris Ambainis ( ambainis@lu.lv ), by May 5, 2019. Submitted 5 years 7 ...
Position - Ambainis - 22/04/2019 - 06:14 - 0 comments
-
Ph.D. student position at Centre for Quantum Computer Science, University of Latvia
... contact data of possible references) to Andris Ambainis ( ambainis@lu.lv ), by May 10, 2019. Submitted 5 years 7 ...
Position - Ambainis - 11/04/2019 - 15:09 - 0 comments
-
Postdoc position in quantum algorithms
... contact data of possible references) to Andris Ambainis ( ambainis@lu.lv ), by March 1, 2022. Late applications may be considered if ...
Position - Ambainis - 28/02/2022 - 11:11 - 0 comments
-
Strong coin tossing
... for example #Mochon2 for the best bias to date). Moreover, Ambainis has shown that a protocol with bias \epsilon>0 must have a number of rounds that grows as \Omega(\log\log\frac{1}{\epsilon}) #Ambainis . If one extends the scenario to allow for relativistic ...
Wiki article - Anonymous (not verified) - 26/10/2015 - 17:56 - 0 comments
-
Quantum algorithms and complexity group at the University of Latvia
Submitted by: Submitted 9 years 11 months ago by Ambainis . 615 reads Research type: Theory Web page: http://home.lu.lv/~df/quantum/ The group is interested in a variety of...
Research group - Ambainis - 22/12/2015 - 13:32 - 0 comments