Complete List of Authors: Bagaria, Anurag; Goethe-Universität Frankfurt am Main, Institut für Biophysikalische Chemie Jaravine, Victor; Goethe-Universität Frankfurt am Main, Institut für Biophysikalische Chemie Huang, Yuanpeng; Rutgers University, Department of Molecular Biology and Biochemistry Montelione, Gaetano; Rutgers University, Department of Molecular Biology and Biochemistry Güntert, P...

Yana V. Izdebskaya,* Anton S. Desyatnikov, Gaetano Assanto, and Yuri S. Kivshar Nonlinear Physics Center, Research School of Physics and Engineering, The Australian National University, Canberra ACT 0200, Australia Department of Physics, Taurida National University, Simferopol 95007, Ukraine Nonlinear Optics and OptoElectronics Lab, University of Rome “Roma Tre,” Rome 00146, Italy *Correspondin...

Kalyan Das, Rong Xiao, Elisabet Wahlberg, Fred Hsu, Cheryl H. Arrowsmith, Gaetano T. Montelione* and Edward Arnold* Center for Advanced Biotechnology and Medicine, Piscataway, New Jersey Department of Chemistry, Rutgers University, Piscataway, New Jersey Department of Molecular Biology and Biochemistry, Rutgers University, Piscataway, New Jersey Ontario Cancer Institute and Department of Medica...

Odoardo Picciolini ([email protected]) Chiara Squarza ([email protected]) Camilla Fontana ([email protected]) Maria Lorella Giannì ([email protected]) Ivan Cortinovis ([email protected]) Silvana Gangi ([email protected]) Laura Gardon ([email protected]) Gisella Presezzi ([email protected]) Monica Fumagalli ...

Citation: Lauriola M, Mosca O, Trentini C, Foschi R, Tambelli R and Carleton RN (2018) The Intolerance of Uncertainty Inventory: Validity and Comparison of Scoring Methods to Assess Individuals Screening Positive for Anxiety and Depression. Front. Psychol. 9:388. doi: 10.3389/fpsyg.2018.00388 The Intolerance of Uncertainty Inventory: Validity and Comparison of Scoring Methods to Assess Individu...

Cheung and Mosca [1] gave an efficient quantum algorithm for decomposing finite abelian groups in a unique-encoding group model. We present another efficient quantum algorithm for this problem in a more general model, the black-box group model, where each group element is not necessarily uniquely encoded.

We study the quantum summation (QS) algorithm of Brassard, Høyer, Mosca and Tapp, see [1], that approximates the arithmetic mean of a Boolean function defined on N elements. We improve error bounds presented in [1] in the worst-probabilistic setting, and present new error bounds in the average-probabilistic setting. In particular, in the worst-probabilistic setting, we prove that the error of t...