◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

N. Sinitsyn

79 papers hereh-index 316k citations148 works total

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

author position
  • sole author4
  • first author12
  • middle author20
  • last author37

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

fields
  • cond-mat.mes-hall37
  • quant-ph18
  • cond-mat.stat-mech9
  • cond-mat.mtrl-sci2
  • math.DS2
  • math-ph2
same name
  • N. Sinitsyn — 11 papers, h 3

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20002023
most citedUniversal Intrinsic Spin-Hall Effect

2.2k citations · 6.7k across the 78 of their papers we have counts for

collaborators
Showing 2023Show all

4 papers · 1 filter

cond-mat.stat-mech2023★ 2 cited

Nonadiabatic transitions during a passage near a critical point

Nikolai A. Sinitsyn, Vijay Ganesh Sadhasivam, Fumika Suzuki

The passage through a critical point of a many-body quantum system leads to abundant nonadiabatic excitations. Here, we explore a regime, in which the critical point is not crossed…

cond-mat.stat-mech2023

Phase transition in fluctuations of interacting spins at infinite temperature

V. N. Gorshkov, N. A. Sinitsyn, D. Mozyrsky

The high temperature limit of interacting spins is usually not associated with ordering or critical phenomena. Nevertheless, spontaneous fluctuations of a local spin polarization a…

cond-mat.mes-hall2023★ 1 cited

Mesoscopic critical fluctuations

Saikat Banerjee, Nikolai A. Sinitsyn

We investigate magnetic fluctuations of a mesoscopic critical region at the interface induced by smooth time-independent spacial changes of a control parameter across its critical…

quant-ph2023★ 5 cited

Topologically protected Grover's oracle for the partition problem

Nikolai A. Sinitsyn, Bin Yan

The Number Partitioning Problem (NPP) is one of the NP-complete computational problems. Its definite exact solution generally requires a check of all N solution candidates, which…

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