Related papers: An algorithm for computing the global basis of an …
A quantum algorithm for computing the determinant of a unitary matrix $U\in U(N)$ is given. The algorithm requires no preparation of eigenstates of $U$ and estimates the phase of the determinant to $t$ binary digits accuracy with…
For a prime $p$, the OM algorithm finds the $p$-adic factorization of an irreducible polynomial $f\in\mathbb{Z}[x]$ in polynomial time. This may be applied to construct $p$-integral bases in the number field $K$ defined by $f$. In this…
Let $K$ be an algebraically closed field of characteristic $p\geqslant 0$ and let $Y=\mbox{Spin}_{2n+1}(K)$ $(n\geqslant 3)$ be a simply connected simple algebraic group of type $B_n$ over $K.$ Also let $X$ be the subgroup of type $D_n,$…
We use one photon to simulate an n-qubit quantum system for the first time. We propose a new scheme to realize universal quantum computation in polynomial time O(n^5). A generating set of gates can be realized with high accuracy in the lab.…
We present a novel $\mathcal{N} = 2 $ $\mathbb{Z}_2^2$-graded supersymmetric quantum mechanics ($\mathbb{Z}_2^2$-SQM) which has different features from those introduced so far. It is a two-dimensional (two-particle) system and is the first…
The canonical duality theory has provided with a unified analytic solution to a range of discrete and continuous problems in global optimization, which can transform a nonconvex primal problem to a concave maximization dual problem over a…
The decomposition of arbitrary unitary transformations into sequences of simpler, physically realizable operations is a foundational problem in quantum information science, quantum control, and linear optics. We establish a 1D Quantum Field…
We present a generic algorithm for computing discrete logarithms in a finite abelian p-group H, improving the Pohlig-Hellman algorithm and its generalization to noncyclic groups by Teske. We then give a direct method to compute a basis for…
We study the moduli space of minimal surfaces of general type with $K_S^2 = 1$ and $p_g = 2$ and show that it is irreducible, has dimension $28$ and admits a compactification which is unirational.
We introduce an approach for estimating the expectation values of arbitrary $n$-qubit matrices $M \in \mathbb{C}^{2^n\times 2^n}$ on a quantum computer. In contrast to conventional methods like the Pauli decomposition that utilize $4^n$…
To each associative unitary finite-dimensional algebra over a normal base, we associative a canonical multiplicative function called its determinant. We give various properties of this construction, as well as applications to the topology…
We give an algorithm that, for a given value of the geometric genus $p_g,$ computes all regular product-quotient surfaces with abelian group that have at most canonical singularities and have canonical system with at most isolated base…
Using the previous obtained universal $R$-matrix for the quantized nontwisted affine Lie algebras $U_q(A_1^{(1)})$ and $U_q(A_2^{(1)})$, we determine the explicitly spectral-dependent universal $R$-matrix for the corresponding quantum Lie…
The unextendible orthogonal matrices (UPBs) can be used for various problems in quantum information. We provide an algorithm to check if two UPBs are non-equivalent to each other. We give a method to construct UPBs and we apply this method…
The zero modes of the chiral SU(n) WZNW model give rise to an intertwining quantum matrix algebra A generated by an n x n matrix a=(a^i_\alpha) (with noncommuting entries) and by rational functions of n commuting elements q^{p_i}. We study…
By combining well-known techniques from both noncommutative algebra and computational commutative algebra, we observe that an algorithmic approach can be applied to the study of irreducible representations of finitely presented algebras. In…
The quantum $\alpha$-determinant is defined as a parametric deformation of the quantum determinant. We investigate the cyclic $\mathcal{U}_q(\mathfrak{sl}_2)$-submodules of the quantum matrix algebra $\mathcal{A}_q(\mathrm{Mat}_2)$…
The representation theory of a 3-dimensional Sklyanin algebra $S$ depends on its (noncommutative projective algebro-) geometric data: an elliptic curve $E$ in $\mathbb{P}^2$, and an automorphism $\sigma$ of $E$ given by translation by a…
Linear programming (polynomial) techniques are used to obtain lower and upper bounds for the potential energy of spherical designs. This approach gives unified bounds that are valid for a large class of potential functions. Our lower bounds…
Computing modular coincidences can show whether a given substitution system, which is supported on a point lattice in R^d, consists of model sets or not. We prove the computatibility of this problem and determine an upper bound for the…