232 citations
- Helmholtz-Zentrum Dresden-RossendorfDE7 papers
- Physikalisch-Technische BundesanstaltDE6 papers
- Technische Universität BraunschweigDE4 papers
- St Petersburg UniversityRU3 papers
- Institute of Semiconductor PhysicsRU2 papers
- Leibniz University HannoverDE2 papers
- Radboud University NijmegenNL2 papers
- Université Paris-SudFR2 papers
- University of CambridgeGB2 papers
- University of RostockDE2 papers
- University of WaterlooCA2 papers
- Aristotle University of ThessalonikiGR1 paper
5 papers · 1 filter
Goldstone mode singularities in O(n) models
J. Kaupuzs, R. V. N. Melnik, J. Rimsans
Monte Carlo (MC) analysis of the Goldstone mode singularities for the transverse and the longitudinal correlation functions, behaving as G_{\perp}(k) \simeq ak^{-λ_{\perp}} and G_{…
Ab initio modelling of UN grain boundary interfaces
Eugene A. Kotomin, Yuri F. Zhukovkii, Dmitry Bocharov +1
The uranium mononitride (UN) is a material considered as a promising candidate for Generation-IV nuclear reactor fuels. Unfortunately, oxygen in air affects UN fuel performance and…
Counting statistics for electron capture in a dynamic quantum dot
Lukas Fricke, Michael Wulf, Bernd Kaestner +10
We report non-invasive single-charge detection of the full probability distribution of the initialization of a quantum dot with electrons for rapid decoupling from an ele…
Optimal quantum query bounds for almost all Boolean functions
Andris Ambainis, Arturs Backurs, Juris Smotrovs +1
We show that almost all n-bit Boolean functions have bounded-error quantum query complexity at least n/2, up to lower-order terms. This improves over an earlier n/4 lower bound of…
One-counter verifiers for decidable languages
Abuzer Yakaryilmaz
Condon and Lipton (FOCS 1989) showed that the class of languages having a space-bounded interactive proof system (IPS) is a proper subset of decidable languages, where the verifier…