Efficient computation of zero-dimensional Gro¨bner bases by change of ordering
Journal of Symbolic Computation
The MAGMA algebra system I: the user language
Journal of Symbolic Computation - Special issue on computational algebra and number theory: proceedings of the first MAGMA conference
Modular algorithms for computing Gröbner bases
Journal of Symbolic Computation
A theoretical basis for the reduction of polynomials to canonical forms
ACM SIGSAM Bulletin
P-adic reconstruction of rational numbers
ACM SIGSAM Bulletin
Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra, 3/e (Undergraduate Texts in Mathematics)
On Weyl-Heisenberg orbits of equiangular lines
Journal of Algebraic Combinatorics: An International Journal
The monomial representations of the Clifford group
Quantum Information & Computation
Unit time-phase signal sets: Bounds and constructions
Cryptography and Communications
Galois automorphisms of a symmetric measurement
Quantum Information & Computation
Systems of imprimitivity for the clifford group
Quantum Information & Computation
| Hi-index | 0.00 |
We consider the problem of finding equiangular lines in complex space, i. e., sets of unit vectors such that the modulus of the inner product between any two vectors is constant. We focus on the case of d 2 such vectors in a space of dimension d which corresponds to so-called SIC-POVMs. We discuss how symmetries can be used to simplify the problem and how the corresponding system of polynomial equations can be solved using techniques of modular computation.