Related papers: Comment on "Maximum likelihood reconstruction of C…
I discuss several aspects of CP non-invariance in the strongly interacting theory of quarks and gluons. I use a simple effective Lagrangian technique to map out the region of quark masses where CP symmetry is spontaneously broken. I then…
The perturbative QCD corrections to the semileptonic decay width of the tau lepton are evaluated in the next-next-to-leading order from the contour integral representation in various renormalization schemes, using numerical solution of the…
In response to M. Campisi's comment [arXiv: 1310.5556] on our recent work [Phys. Rev. E 88, 042126 (2013)], we first point out that the distribution used by Campisi is not the correct escort distribution and further provide arguments…
The violation of Bell, CHSH and CH inequalities indicates only that the assumption of "conterfactual definiteness" and/or the probabilistic models used in proofs were incorrect. In this paper we discuss in detail an intimate relation…
Quantum Monte Carlo methods are sophisticated numerical techniques for simulating interacting quantum systems. In some cases, however, they suffer from the notorious "sign problem" and become too inefficient to be useful. A recent…
We argue that the claim given in quant-ph/9801014 is untenable. The fallacy in the proof is a misinterpretation of the no-cloning theorem, which does not allow quantum jumps, specifically measurements.
Among the parameters of QCD is one that results in CP violation when non-vanishing. This is closely related to possible quark mass terms. It is conventionally interpreted in terms of gauge field topology or alternatively in terms of phases…
Recently, Ai, Cruz, Garbrecht, and Tamarit (arXiv:2001.07152, arXiv:2404.16026, arXiv:2511.04216) claimed that the strong CP problem can be avoided by adopting a particular order of limits in the Euclidean path integral, in which the…
Graph matching is one of the most important problems in graph theory and combinatorial optimization, with many applications in various domains. Although meta-heuristic algorithms have had good performance on many NP-Hard and NP-Complete…
Quantitative magnetic resonance imaging (qMRI) requires multi-phase acqui-sition, often relying on reduced data sampling and reconstruction algorithms to accelerate scans, which inherently poses an ill-posed inverse problem. While many…
Contrary to an assumption made by Bojanczyk, Higham, and Patel [SIAM J. Matrix Anal. Appl., 24(4):914-931, 2003], a perturbation bound for indefinite least square problems is capable of arbitrarily large overestimates for all perturbations…
We show that the set of not-completely-positive (NCP) maps is unbounded, unless further assumptions are made. This is done by first proposing a reasonable definition of a valid NCP map, which is nontrivial because NCP maps may lack a full…
CP asymmetries in $B^0(t)\to \pi^+ \pi^-$ are studied by relating this process in broken flavor SU(3) with $B^+\to K^0\pi^+$ and $B^0\to K^+\pi^-$. Using two different scenarios for SU(3) breaking, we show that the range of values of the…
The purpose of this note is to highlight and address inaccuracies in the convergence guarantees of SCvx, a nonconvex trajectory optimization algorithm proposed by Mao et al. (arXiv:1804.06539), and make connections to relevant prior work.…
In this letter we will dicuss the possibility of a resummation procedure in order to cure the UV/IR-mixing problem of noncommutative field theories. The method is presented for a scalar phi^4 theory on Euclidean space. Finally, we sketch…
Coverage criteria play a central role in assessing test adequacy in classical software, yet their effectiveness for quantum programs remains poorly understood and largely unexplored. In this paper, we propose six quantum-tailored criteria -…
Executing quantum circuits on currently available quantum computers requires compiling them to a representation that conforms to all restrictions imposed by the targeted architecture. Due to the limited connectivity of the devices' physical…
In this paper, we focus on the problem of conformal prediction with conditional guarantees. Prior work has shown that it is impossible to construct nontrivial prediction sets with full conditional coverage guarantees. A wealth of research…
A attempt at a quantum algorithm for solving NP problems is presented. Now withdrawn because some crucial operators were not unitary.
In continuous-variable tomography, with finite data and limited computation resources, reconstruction of a quantum state of light is performed on a finite-dimensional subspace. No systematic method was ever developed to assign such a…