Related papers: Comment on ``Polynomial-Time Simulation of Pairing…
This is a review of the theoretical aspects of the supersymmetric extension of the Standard Model of particle physics, extracted from Chapter 87 of the 2026 Review of Particle Physics, F. Takahashi et al. (Particle Data Group), Int. J. Mod.…
Comment on K.J Thomas et al., Phys. Rev. Lett. 77, 135-138 (1996).
We review our recent work addressing various theoretical issues in spin-based quantum dot quantum computation and quantum information processing. In particular, we summarize our calculation of electron exchange interaction in two-electron…
Comment on paper by A. Zvyagin, Phys. Rev. B 64, R060405 (2001).
Lecture notes on quantum machine learning for computer scientists.
This work provides a mathematical derivation of a quasi-stationary model for multimode parametric down-conversion, which was presented in [Gatti et al., Sci. Rep. 13, 16786] with heuristic arguments. The model is here derived from the 3D+1…
Holonomies are of great interest to quantum computation and simulation. The geometrical nature of these entities offers increased stability to quantum gates. Furthermore, symmetries of particle physics are naturally reflected in holonomies,…
Rejoinder to "The Essential Role of Pair Matching in Cluster-Randomized Experiments, with Application to the Mexican Universal Health Insurance Evaluation" [arXiv:0910.3752]
We compare the results of our two papers with the results of the paper Aratyn H., Gomes J.F., Zimerman A.H., Higher order Painlev\'e equations and their symmetries via reductions of a class of integrable models, J. Phys. A: Math. Theor., V.…
This text is a summary (in french) of recent works in collaboration with Mathieu Lewin, on the modelling of polarons in quantum crystals.
Some formulas and speculations are presented relative to integrable systems and quantum mechanics.
Book review of Stochastic Chemical Kinetics. Theory and (Mostly) Systems Biological Applications, P. Erdi, G. Lente. Springer (2014)
I study the class of problems efficiently solvable by a quantum computer, given the ability to "postselect" on the outcomes of measurements. I prove that this class coincides with a classical complexity class called PP, or Probabilistic…
Accurately predicting response properties of molecules such as the dynamic polarizability and hyperpolarizability using quantum mechanics has been a long-standing challenge with widespread applications in material and drug design. Classical…
This article gives an elementary introduction to quantum computing. It is a draft for a book chapter of the "Handbook of Nature-Inspired and Innovative Computing", Eds. A. Zomaya, G.J. Milburn, J. Dongarra, D. Bader, R. Brent, M.…
In this paper we introduce a novel notion of probabilistic bisimulation for quantum processes and prove that it is congruent with respect to various process algebra combinators including parallel composition even when both classical and…
We present a computer simulation model of Wheeler's delayed choice experiment that is a one-to-one copy of an experiment reported recently (V. Jacques {\sl et al.}, Science 315, 966 (2007)). The model is solely based on experimental facts,…
This reply addresses concerns expressed in a comment (arXiv:2508.16689v1) on arXiv:submit/6841332 [physics.gen-ph] 29 Sep 2025 the paper given in the title (arXiv:2501.02022v2), hereafter referred to as the paper.
This is a Comment on the Article ``Aging, phase ordering and conformal invariance'' by M.Henkel, M.Pleimling, C.Godr\`eche and J.M.Luck [Phys.Rev.Lett. 87, 265701 (2001)].
Quantum computers are appealing for their ability to solve some tasks much faster than their classical counterparts. It was shown in [Aspuru-Guzik et al., Science 309, 1704 (2005)] that they, if available, would be able to perform the full…