4.5k citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Tel Aviv UniversityIL181 papers
- Boston UniversityUS130 papers
- Weizmann Institute of ScienceIL117 papers
- Ariel UniversityIL101 papers
- Ben-Gurion University of the NegevIL99 papers
- Centre National de la Recherche ScientifiqueFR98 papers
- Hebrew University of JerusalemIL95 papers
- Technion – Israel Institute of TechnologyIL90 papers
- Massachusetts Institute of TechnologyUS82 papers
- Stanford UniversityUS75 papers
- University of CambridgeGB70 papers
- University of Maryland, College ParkUS68 papers
5 papers · 2 filters
Effects of thermal motion on electromagnetically induced absorption
E. Tilchin, O. Firstenberg, A. D. Wilson-Gordon
We describe the effect of thermal motion and buffer-gas collisions on a four-level closed N system interacting with strong pump(s) and a weak probe. This is the simplest system tha…
Semigroup evolution in Wigner Weisskopf pole approximation with Markovian spectral coupling
F. Shikerman, A. Peer, L. P. Horwitz
We establish the relation between the Wigner-Weisskopf theory for the description of an unstable system and the theory of coupling to an environment. According to the Wigner-Weissk…
Transition Decomposition of Quantum Mechanical Evolution
Y. Strauss, J. Silman, S. Machnes +1
We show that the existence of the family of self-adjoint Lyapunov operators introduced in [J. Math. Phys. 51, 022104 (2010)] allows for the decomposition of the state of a quantum…
Study of a self-adjoint operator indicating the direction of time within standard quantum mechanics
Y. Strauss, J. Silman, S. Machnes +1
In [J. Math. Phys. 51 (2010) 022104] a self-adjoint operator was introduced that has the property that it indicates the direction of time within the framework of standard quantum m…
Super-Polynomial Quantum Speed-ups for Boolean Evaluation Trees with Hidden Structure
Bohua Zhan, Shelby Kimmel, Avinatan Hassidim
We give a quantum algorithm for evaluating a class of boolean formulas (such as NAND trees and 3-majority trees) on a restricted set of inputs. Due to the structure of the allowed…