419 citations
- Massachusetts Institute of TechnologyUS181 papers
- Vilnius UniversityLT180 papers
- Boğaziçi UniversityTR178 papers
- Deutsches Elektronen-Synchrotron DESYDE178 papers
- University of Nebraska–LincolnUS178 papers
- Bulgarian Academy of SciencesBG176 papers
- Sofia University "St. Kliment Ohridski"BG175 papers
- University of BristolGB175 papers
- University of HelsinkiFI175 papers
- University of AntwerpBE174 papers
- University of BelgradeRS174 papers
- University of Notre DameUS174 papers
5 papers · 2 filters
On the Complexity of Solving Subtraction Games
Kamil Khadiev, Dmitry Kravchenko
We study algorithms for solving Subtraction games, which sometimes are referred to as one-heap Nim games. We describe a quantum algorithm which is applicable to any game on DAG, an…
Lackadaisical quantum walks with multiple marked vertices
Nikolajs Nahimovs
The concept of lackadaisical quantum walk -- quantum walk with self loops -- was first introduced for discrete-time quantum walk on one-dimensional line. Later it was successfully…
Quantum Speedups for Exponential-Time Dynamic Programming Algorithms
Andris Ambainis, Kaspars Balodis, Jānis Iraids +3
In this paper we study quantum algorithms for NP-complete problems whose best classical algorithm is an exponential time application of dynamic programming. We introduce the path i…
On Interchangeability of Probe-Object Roles in Quantum-Quantum Interaction-Free Measurement
Stanislav Filatov, Marcis Auzinsh
In this paper we examine Interaction-free measurement (IFM) where both the probe and the object are quantum particles. We argue that in this case the description of the measurement…
Hyperfine level structure in nitrogen-vacancy centers near the ground-state level anticrossing
Marcis Auzinsh, Andris Berzins, Dmitry Budker +6
Energy levels of nitrogen-vacancy centers in diamond were investigated using optically detected magnetic-resonance spectroscopy near the electronic ground-state level anticrossing…