Related papers: qFunctions -- A Mathematica package for $q$-series…
The q-fermion numbers emerging from the q-fermion oscillator algebra are used to reproduce the q-fermionic Stirling and Bell numbers. New recurrence relations for the expansion coefficients in the 'anti-normal ordering' of the q-fermion…
We present a number of quantum computing patterns that build on top of fundamental algorithms, that can be applied to solving concrete, NP-hard problems. In particular, we introduce the concept of a quantum dictionary as a summation of…
We introduce a novel scheme of quantum recursive programming, in which large unitary transformations, i.e. quantum gates, can be recursively defined using quantum case statements, which are quantum counterparts of conditionals and case…
Graphical calculi are vital tools for representing and reasoning about quantum circuits and processes. Some are not only graphically intuitive but also logically complete. The best known of these is the ZX-calculus, which is an industry…
Q-systems are unitary versions of Frobenius algebra objects which appeared in the theory of subfactors. In recent joint work with R. Hern\'andez Palomares and C. Jones, the authors defined a notion of Q-system completion for C*/W*…
We introduce a family of polynomials in $q^2$ and four variables associated with the quantized algebra of functions $A_q(C_2)$. A new formula is presented for the recent solution of the 3D reflection equation in terms of these polynomials…
Quantum programs are notoriously difficult to code and verify due to unintuitive quantum knowledge associated with quantum programming. Automated tools relieving the tedium and errors associated with low-level quantum details would hence be…
I consider the expansion of transcendental functions in a small parameter around rational numbers. This includes in particular the expansion around half-integer values. I present algorithms which are suitable for an implementation within a…
We introduce SP$\mathbb{Q}$R, a new Mathematica package for the division and elimination of variables from polynomial systems. SP$\mathbb{Q}$R works by sampling and reconstructing results over finite fields, in an analogous manner to many…
We use generating functions to express orthogonality relations in the form of $q$-beta integrals. The integrand of such a $q$-beta integral is then used as a weight function for a new set of orthogonal or biorthogonal
We present QCommute, a software tool implemented in C++ for symbolic computation of nested commutators between a Hamiltonian and local observables in quantum many-body spin-1/2 systems on one-, two-, and three-dimensional hypercubic…
This paper introduces the FermiFab toolbox for many-particle quantum systems. It is mainly concerned with the representation of (symbolic) fermionic wavefunctions and the calculation of corresponding reduced density matrices (RDMs). The…
Incremental quantum circuit simulation has emerged as an important tool for simulation-driven quantum applications, such as circuit synthesis, verification, and analysis. When a small portion of the circuit is modified, the simulator must…
In this paper, we obtain a q-exponential generating function for inversions on parking functions via symmetric function theory and also through a direct bijection to rooted labeled forests. We then apply these techniques to unit interval…
This paper builds and extends on the authors' previous work related to the algorithmic tool, Cylindrical Algebraic Decomposition (CAD), and one of its core applications, Real Quantifier Elimination (QE). These topics are at the heart of…
The idea of using unfolding as a way of computing a program semantics has been applied successfully to logic programs and has shown itself a powerful tool that provides concrete, implementable results, as its outcome is actually source…
In this article, we discuss how a kind of hybrid computation, which employs symbolic, numeric, classic, and quantum algorithms, allows us to conduct Hartree-Fock electronic structure computation of molecules. In the proposed algorithm, we…
For some research questions that involve Spin(p, q) representation theory, using symbolic algebra based techniques might be an attractive option for simplifying and manipulating expressions. Yet, for some such problems, especially as they…
Fermionic formulas in combinatorial Bethe ansatz consist of sums of products of q-binomial coefficients. There exist refinements without a sum that are known to yield partition functions of box-ball systems with a prescribed soliton…
Integral representations of two $q$-difference operators are provided in terms of special functions arising in the theory of asymptotic solutions to $q$-difference equations in the complex domain. Both representations are unified through…