Related papers: Comment on "Maximum likelihood reconstruction of C…
The hypothesis of a real Cabibbo-Kobayashi-Maskawa matrix has been considered and found to be disfavoured by present measurements even when neglecting results from CP violation in neutral Kaon decay. This result contradicts statements…
The attempt to equate operator quantum error correction (quant-ph/0504189v1) with the quantum computer condition (quant-ph/0507141) in version two of quant-ph/0504189 is shown to be invalid.
Assuming a cloning oracle, satisfiability, which is an NP complete problem, is shown to belong to $BPP^C$ and $BQP^C$ (depending on the ability of the oracle C to clone either a binary random variable or a qubit). The same result is…
We examine the sensitivity of several solutions of the strong-CP problem to violations of global symmetries by Planck scale physics. We find that the Peccei-Quinn solution is extremely sensitive to U(1)_PQ violating operators of dimension…
We introduce "CP trajectory diagram in bi-probability space" as a powerful tool for pictorial representation of the genuine CP and the matter effects in neutrino oscillations. Existence of the correlated ambiguity in a determination of CP…
This paper considers pairs of optimization problems that are defined from a single input and for which it is desired to find a good approximation to either one of the problems. In many instances, it is possible to efficiently find an…
Conformal Prediction (CP) allows to perform rigorous uncertainty quantification by constructing a prediction set $C(X)$ satisfying $\mathbb{P}(Y \in C(X))\geq 1-\alpha$ for a user-chosen $\alpha \in [0,1]$ by relying on calibration data…
Measuring phases in the Cabibbo-Kobayashi-Maskawa matrix through CP asymmetries in B decays is a major goal of current and future experiments. Methods based on charge-conjugation and isospin symmetries involve very little theoretical…
We focus on rational solutions or nearly-feasible rational solutions that serve as certificates of feasibility for polynomial optimization problems. We show that, under some separability conditions, certain cubic polynomially constrained…
Fundamental errors exist in the above-mentioned article, which attempts to justify previous erroneous claims concerning signature change. In the simplest example, the authors' proposed ``solutions'' do not satisfy the relevant equation, as…
The error bound property for a solution set defined by a set-valued mapping refers to an inequality that bounds the distance between vectors closed to a solution of the given set by a residual function. The error bound property is a…
A recent paper of Trandafir and Cabello [Phys. Rev. A, 111, 022408 (2025)] contains a number of errors, inconsistencies, and inefficiencies. They are too numerous to be listed here, so we identify and discuss them in the main body of the…
We address the problem of finding optimal CPTP (completely positive, trace preserving) maps between a set of binary pure states and another set of binary generic mixed state in a two dimensional space. The necessary and sufficient…
This paper has two agendas. Firstly, we exhibit new results for coverage processes. Let $p(n,m,\alpha)$ be the probability that $n$ spherical caps of angular radius $\alpha$ in $S^m$ do not cover the whole sphere $S^m$. We give an exact…
In this work, some counterexamples are given to refute some results reported in the paper by Guo and Li [8] (J Optim Theory Appl 162,(2014), 821-844). We correct the faulty in some of their theorems and we present alternative proofs.…
Results of analysis of correctness and limitations of the classical Coupled Cavity Model are presented in the paper. It is shown that in the case of an infinite chain of resonators, there are spurious solutions of the characteristic…
Operation management problems (such as Production Planning and Scheduling) are represented and formulated as optimization models. The resolution of such optimization models leads to solutions which have to be operated in an organization.…
Computing the conditional mode of a distribution, better known as the $\mathit{maximum\ a\ posteriori}$ (MAP) assignment, is a fundamental task in probabilistic inference. However, MAP estimation is generally intractable, and remains hard…
In this talk we review the limitations of including meson loops as perturbative corrections in a solvable quark model. We first discuss meson-meson scattering within a formalism which treats confined quark pairs and mesons on an equal…
Reparameterizing a probabilisitic system is common advice for improving the performance of a statistical algorithm like Markov chain Monte Carlo, even though in theory such reparameterizations should leave the system, and the performance of…