Nikolajs Nahimovs

According to our database, Nikolajs Nahimovs authored at least 11 papers between 2009 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2021

Upperbounds on the probability of finding marked connected components using quantum walks.

Adam Glos, Nikolajs Nahimovs, Konstantin Balakirev, Kamil Khadiev

Quantum Inf. Process., 2021

2020

Lackadaisical quantum walks on triangular and honeycomb 2D grids.

Nikolajs Nahimovs

CoRR, 2020

2019

Lackadaisical Quantum Walks with Multiple Marked Vertices.

Nikolajs Nahimovs

Proceedings of the SOFSEM 2019: Theory and Practice of Computer Science, 2019

2018

Quantum Walks on Two-Dimensional Grids with Multiple Marked Locations.

Nikolajs Nahimovs, Alexander Rivosh

Int. J. Found. Comput. Sci., 2018

Grover's Search with Faults on Some Marked Elements.

Dmitry Kravchenko, Nikolajs Nahimovs, Alexander Rivosh

Int. J. Found. Comput. Sci., 2018

2017

Adjacent Vertices Can Be Hard to Find by Quantum Walks.

Nikolajs Nahimovs, Raqueline A. M. Santos

Proceedings of the SOFSEM 2017: Theory and Practice of Computer Science, 2017

2015

Exceptional Configurations of Quantum Walks with Grover's Coin.

Nikolajs Nahimovs, Alexander Rivosh

Proceedings of the Mathematical and Engineering Methods in Computer Science, 2015

2012

Search by Quantum Walks on Two-Dimensional Grid without Amplitude Amplification.

Andris Ambainis, Arturs Backurs, Nikolajs Nahimovs, Raitis Ozols, Alexander Rivosh

Proceedings of the Theory of Quantum Computation, 2012

Grover's Algorithm with Errors.

Andris Ambainis, Arturs Backurs, Nikolajs Nahimovs, Alexander Rivosh

Proceedings of the Mathematical and Engineering Methods in Computer Science, 2012

2010

Nonlocal Quantum XOR Games for Large Number of Players.

Andris Ambainis, Dmitry Kravchenko, Nikolajs Nahimovs, Alexander Rivosh

Proceedings of the Theory and Applications of Models of Computation, 7th Annual Conference, 2010

2009

Improved constructions of quantum automata.

Andris Ambainis, Nikolajs Nahimovs

Theor. Comput. Sci., 2009