Related papers: Complementary reductions for two qubits
We consider the optimal approximation of arbitrary qubit states with respect to an available states consisting the eigenstates of two of three Pauli matrices, the $B_2$-distance of an arbitrary target state. Both the analytical formulae of…
Quantum computing offers significant potential for solving NP-hard combinatorial (optimization) problems that are beyond the reach of classical computers. One way to tap into this potential is by reformulating combinatorial problems as a…
We determine the minimal number of variables $\Gamma^*(d, K)$ which guarantees a nontrivial solution for every additive form of degree $d=4$ over the four ramified quadratic extensions $\mathbb{Q}_2(\sqrt{2}), \mathbb{Q}_2(\sqrt{10}),…
Pairwise correlation is really an important property for multi-qubit states. For the two-qubit X states extracted from Dicke states and their superposition states, we obtain a compact expression of the quantum discord by numerical check. We…
An important problem in computational arithmetic geometry is to find changes of coordinates to simplify a system of polynomial equations with rational coefficients. This is tackled by a combination of two techniques, called minimisation and…
Compiling a high-level quantum circuit down to a low-level description that can be executed on state-of-the-art quantum computers is a crucial part of the software stack for quantum computing. One step in compiling a quantum circuit to some…
We examine how best to design qubits for use in topological quantum computation. These qubits are topological Hilbert spaces associated with small groups of anyons. Op- erations are performed on these by exchanging the anyons. One might…
Let $a,b$ be elements in a unital C$^*$-algebra with $0\leq a,b\leq 1$. The element $a$ is absolutely compatible with $b$ if $$\vert a - b \vert + \vert 1 - a - b \vert = 1.$$ In this note we find some technical characterizations of…
In this paper, we present the best possible parameters $\alpha_i, \beta_i\ (i=1,2,3)$ and $\alpha_4,\beta_4\in(1/2,1)$ such that the double inequalities \begin{align*}…
Consider the divisor sum $\sum_{n\leq N}\tau(n^2+2bn+c)$ for integers $b$ and $c$ which satisfy certain extra conditions. For this average sum we obtain an explicit upper bound, which is close to the optimal. As an application we improve…
The maximum-cut problem is one of the fundamental problems in combinatorial optimization. With the advent of quantum computers, both the maximum-cut and the equivalent quadratic unconstrained binary optimization problem have experienced…
This paper is a continuation of \ct{cmf16} where an efficient algorithm for computing the maximal eigenpair was introduced first for tridiagonal matrices and then extended to the irreducible matrices with nonnegative off-diagonal elements.…
We study the quadratically regularized optimal transport (QOT) problem for quadratic cost and compactly supported marginals $\mu$ and $\nu$. It has been empirically observed that the optimal coupling $\pi_\epsilon$ for the QOT problem has…
We provide optimal upper bounds on the growth of iterated sumsets $hA=A+\dots+A$ for finite subsets $A$ of abelian semigroups. More precisely, we show that the new upper bounds recently derived from Macaulay's theorem in commutative algebra…
An additive 2-basis with range n is restricted if its largest element is n/2. Among the restricted 2-bases of given length k, the ones that have the greatest range are extremal restricted. We describe an algorithm that finds the extremal…
Determining the maximum number of unit vectors in $\mathbb{R}^r$ with no pairwise inner product exceeding $\alpha$ is a fundamental problem in geometry and coding theory. In 1955, Rankin resolved this problem for all $\alpha \leq 0$ and in…
Marks showed that $\mathbb{F}_2Q_8$, the $\mathbb{F}_2$ group algebra over the quaternion group, is a reversible nonsymmetric ring, then questioned whether or not this ring is minimal with respect to cardinality. In this work, it is shown…
We consider the Unambiguous State Discrimination (USD) of two mixed quantum states. We study the rank and the spectrum of the elements of an optimal USD measurement. This naturally leads to a partial fourth reduction theorem. This theorem…
In preference modelling, it is essential to determine the number of questions and their arrangements to ask from the decision maker. We focus on incomplete pairwise comparison matrices, and provide the optimal filling in patterns, which…
Quantum computational supremacy arguments, which describe a way for a quantum computer to perform a task that cannot also be done by a classical computer, typically require some sort of computational assumption related to the limitations of…