Related papers: Constructing exact symmetric informationally compl…
Test generation and test data selection are difficult tasks for model based testing. Tests for a program can be meld to a test suite. A lot of research is done to quantify the quality and improve a test suite. Code coverage metrics estimate…
We present a conjectured family of SIC-POVMs which have an additional symmetry group whose size is growing with the dimension. The symmetry group is related to Fibonacci numbers, while the dimension is related to Lucas numbers. The…
The problem of constructing maximal equiangular tight frames or SICs was raised by Zauner in 1998. Four years ago it was realized that the problem is closely connected to a major open problem in number theory. We discuss why such a…
Linear exact modeling is a problem coming from system identification: Given a set of observed trajectories, the goal is find a model (usually, a system of partial differential and/or difference equations) that explains the data as precisely…
We study the maximum-confidence (MC) measurement strategy for discriminating among nonorthogonal symmetric qudit states. Restricting to linearly dependent and equally likely pure states, we find the optimal positive operator valued measure…
Quantum computers solve ever more complex tasks using steadily growing system sizes. Characterizing these quantum systems is vital, yet becoming increasingly challenging. The gold-standard is quantum state tomography (QST), capable of fully…
We show that real-value approximations of Kolmogorov-Chaitin (K_m) using the algorithmic Coding theorem as calculated from the output frequency of a large set of small deterministic Turing machines with up to 5 states (and 2 symbols), is in…
SIC-POVMs are configurations of points or rank-one projections arising from the action of a finite Heisenberg group on $\mathbb C^d$. The resulting equations are interpreted in terms of moment maps by focussing attention on the orbit of a…
Exactly solving multi-objective integer programming (MOIP) problems is often a very time consuming process, especially for large and complex problems. Parallel computing has the potential to significantly reduce the time taken to solve such…
A SIC is a maximal equiangular tight frame in a finite dimensional Hilbert space. Given a SIC in dimension $d$, there is good evidence that there always exists an aligned SIC in dimension $d(d-2)$, having predictable symmetries and smaller…
Complex projective t-designs, particularly SICs and full sets of MUBs, play an important role in quantum information. We introduce a generalization which we call conical t-designs. They include arbitrary rank symmetric informationally…
A general framework of Numerical Singular Integrals (NSI) method based on the Integration By Parts (IBP) has been developed for integrals involving singular and nearly singular integrands, or NSI-IBP. Through a general integration by parts…
We present a computational methodology for obtaining rotationally symmetric sets of points satisfying discrete geometric constraints, and demonstrate its applicability by discovering new solutions to some well-known problems in…
Lie symmetry analysis is applied to study the nonlinear rotating shallow water equations. The 9-dimensional Lie algebra of point symmetries admitted by the model is found. It is shown that the rotating shallow water equations are related…
Approximate integer programming is the following: For a convex body $K \subseteq \mathbb{R}^n$, either determine whether $K \cap \mathbb{Z}^n$ is empty, or find an integer point in the convex body scaled by $2$ from its center of gravity…
Accuracy, variationality, and convergence underpin the reliability of modern electronic structure methods, yet definitive benchmarks in the relativistic regime remain elusive due to the absence of numerically exact full configuration…
Recent advances in selected CI, including the adaptive sampling configuration interaction (ASCI) algorithm and its heat bath extension, have made the ASCI approach competitive with the most accurate techniques available, and hence an…
We study a class of countably-infinite-dimensional linear programs (CILPs) whose feasible sets are bounded subsets of appropriately defined spaces of measures. The optimal value, optimal points, and minimal points of these CILPs can be…
Holonomic quantum computation is analyzed from geometrical viewpoint. We develop an optimization scheme in which an arbitrary unitary gate is implemented with a small circle in a complex projective space. Exact solutions for the Hadamard,…
We give a new computational method to obtain symmetries of ordinary differential equations. The proposed approach appears as an extension of a recent algorithm to compute variational symmetries of optimal control problems [Comput. Methods…