Related papers: Optimally generating $\mathfrak{su}(2^N)$ using Pa…

Parametrized and random unitary (or orthogonal) $n$-qubit circuits play a central role in quantum information. As such, one could naturally assume that circuits implementing symplectic transformations would attract similar attention.…

Two different algorithms are presented for generating a quantum circuit realization of a matrix representing a permutation on $2^n$ letters. All circuits involve $n$ qubits and only use multi--controlled Toffoli gates. The first algorithm…

A connected Lie group G is generated by its two 1-parametric subgroups exp(tX), exp(tY) if and only if the Lie algebra of G is generated by {X, Y}. We consider decompositions of elements of G into a product of such exponentials with times t…

We study compositions of a positive integer $n$ in which the occurrence of even parts larger than a fixed threshold $k$ is controlled. More precisely, for each composition $m=(m_1,\dots,m_r)$ we consider the number of even parts strictly…

The decomposition of a square matrix into a sum of Pauli strings is a classical pre-processing step required to realize many quantum algorithms. Such a decomposition requires significant computational resources for large matrices. We…

Unit commitment is an important optimization problem in power system operations, classified as NP-hard. This paper presents a hybrid quantum-classical method for the unit commitment problem with time-dependent constraints, where decisions…

The most efficient known quantum circuits for preparing unitary coupled cluster states and applying Trotter steps of the arbitrary basis electronic structure Hamiltonian involve interleaved sequences of fermionic Gaussian circuits and Ising…

The generating function for $p_N(n)$, the number of partitions of $n$ into at most $N$ parts, may be written as a product of $N$ factors. We find the behavior of coefficients in the partial fraction decomposition of this product as $N \to…

Lexicographically minimal string rotation is a fundamental problem in string processing that has recently garnered significant attention in quantum computing. Near-optimal quantum algorithms have been proposed for solving this problem,…

The process of reconstructing quantum states from experimental measurements, accomplished through quantum state tomography (QST), plays a crucial role in verifying and benchmarking quantum devices. A key challenge of QST is to find out how…

Qudits with local dimension $d>2$ can have unique structure and uses that qubits ($d=2$) cannot. Qudit Pauli operators provide a very useful basis of the space of qudit states and operators. We study the structure of the qudit Pauli group…

Unitary operation is an essential step for quantum information processing. We first propose an iterative procedure for decomposing a general unitary operation without resorting to controlled-NOT gate and single-qubit rotation library. Based…

In this study, we analyze the Rademacher complexity $ \mathcal{R}_{M} $ of a parameterized unitary whose generators are chosen from $ n $-qubit Pauli strings. Although generalization bounds for quantum machine learning models have been…

We present a randomised variant of an algorithm of Lucchini and Thakkar for finding a smallest sized generating set in a finite group, which has polynomial time expected running time in finite permutation groups.

When an informationally incomplete set of observables is considered there are several solutions to the quantum state reconstruction problem using von Neumann measurements. The set of solutions are known as Pauli partners, which are not easy…

The norm kernel of the generator-coordinate method is shown to be a symmetric kernel of an integral equation with eigenfunctions defined in the Fock--Bargmann space and forming a complete set of orthonormalized states (classified with the…

We construct a new family of permutationally invariant codes that correct $t$ Pauli errors for any $t\ge 1$. We also show that codes in the new family correct quantum deletion errors as well as spontaneous decay errors. Our construction…

Building on work of Hardy and Ramanujan, Rademacher proved a well-known formula for the values of the ordinary partition function $p(n)$. More recently, Bruinier and Ono obtained an algebraic formula for these values. Here we study the…

This paper collects miscellaneous results about the group SU(1,1) that are helpful in applications in quantum optics. Moreover, we derive two new results, the first is about the approximability of SU(1,1) elements by a finite set of…

The paper considers the problem of finding the largest possible set P(n), a subset of the set N of the natural numbers, with the property that a number is in P(n) if and only if it is a sum of n distinct naturals all in P(n) or none in…