Related papers: How to efficiently select an arbitrary Clifford gr…
We formulate a Boolean algebra in the set of idempotents of Clifford algebra Cl($R^{n,n}$) and within this frame we examine different formulations of the Boolean Satisfiability Problem in Clifford algebra. Exploiting the isomorphism between…
One of the primary objectives in the field of quantum state learning is to develop algorithms that are time-efficient for learning states generated from quantum circuits. Earlier investigations have demonstrated time-efficient algorithms…
Extraspecial groups form a remarkable subclass of p-groups. They are also present in quantum information theory, in particular in quantum error correction. We give here a polynomial time quantum algorithm for finding hidden subgroups in…
We consider several subgroup-related algorithmic questions in groups, modeled after the classic computational lattice problems, and study their computational complexity. We find polynomial time solutions to problems like finding a subgroup…
A positive integer is expressed as a sum of squares of positive integers in a unique way applying a special technique. The expression, thus obtained is resolved into two factors using the concept of the Clifford algebra. This technique is…
It is the prevailing belief that quantum error correcting techniques will be required to build a utility-scale quantum computer able to perform computations that are out of reach of classical computers. The QECCs that have been most…
Explorable heap selection is the problem of selecting the $n$th smallest value in a binary heap. The key values can only be accessed by traversing through the underlying infinite binary tree, and the complexity of the algorithm is measured…
Prompted by a recent demonstration that the structure of a single quark-lepton generation may be understood via a Dirac-like linearization of the form p^2+x^2, we analyze the corresponding Clifford algebra in some detail. After classifying…
The main component of (constructive) recognition algorithms for black box groups of Lie type in computational group theory is the construction of unipotent elements. In the existing algorithms unipotent elements are found by random search…
Unitary $k$-designs are finite ensembles of unitary matrices that approximate the Haar distribution over unitary matrices. Several ensembles are known to be 2-designs, including the uniform distribution over the Clifford group, but no…
We present a quantum algorithm for estimating the matrix determinant based on quantum spectral sampling. The algorithm estimates the logarithm of the determinant of an $n \times n$ positive sparse matrix to an accuracy $\epsilon$ in time…
Unit group computations are a cryptographic primitive for which one has a fast quantum algorithm, but the required number of qubits is $\tilde O(m^5)$. In this work we propose a modification of the algorithm for which the number of qubits…
In this paper we prove isomorphisms between 5 Lie groups (of arbitrary dimension and fixed signatures) in Clifford algebra and classical matrix Lie groups - symplectic, orthogonal and linear groups. Also we obtain isomorphisms of…
Based on a presentation of $\mathcal{C}_n$ and the help of [GAP], we construct the character table of the Clifford group $\mathcal{C}_n$ for $n=1,2,3$. As an application, we can efficiently decompose the (higher power of) tensor product of…
One of the main goals of these notes is to explain how rotations in reals^n are induced by the action of a certain group, Spin(n), on reals^n, in a way that generalizes the action of the unit complex numbers, U(1), on reals^2, and the…
One learned from Gottesman-Knill theorem that the Clifford model of quantum computing \cite{Clark07} may be generated from a few quantum gates, the Hadamard, Phase and Controlled-Z gates, and efficiently simulated on a classical computer.…
In this paper, we make the case that Clifford algebra is the natural framework for root systems and reflection groups, as well as related groups such as the conformal and modular groups: The metric that exists on these spaces can always be…
Efficiently calculating the low-lying eigenvalues of Hamiltonians, written as sums of Pauli operators, is a fundamental challenge in quantum computing. While various methods have been proposed to reduce the complexity of quantum circuits…
An algorithm is presented allowing the construction of fast Fourier transforms for any solvable group on a classical computer. The special structure of the recursion formula being the core of this algorithm makes it a good starting point to…
{\sc CLIFFORD} is a Maple package for computations in Clifford algebras $\cl (B)$ of an arbitrary symbolic or numeric bilinear form B. In particular, B may have a non-trivial antisymmetric part. It is well known that the symmetric part g of…