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

A scheme for treating the pairing of nucleons in terms of generators of Quantum Group SU_{q}(2) is presented. The possible applications to nucleon pairs in a single orbit, multishell case, pairing vibrations and superconducting nuclei are…

All-to-all interactions arise naturally in many areas of theoretical physics and across diverse experimental quantum platforms, motivating a systematic study of their information-processing power. Assuming each pair of qubits interacts with…

In the noisy intermediate-scale quantum era, ab initio computation of the electronic structure problems has become one of the major benchmarks for identifying the boundary between classical and quantum computational power. Basis sets play a…

Let k be a positive integer. A sequence s over an n-element alphabet A is called a k-radius sequence if every two symbols from A occur in s at distance of at most k. Let f_k(n) denote the length of a shortest k-radius sequence over A. We…

We present a compact quantum circuit for factoring a large class of integers, including some whose classical hardness is expected to be equivalent to RSA (but not including RSA integers themselves). Most notably, we factor $n$-bit integers…

Determining the quantum circuit complexity of a unitary operation is an important problem in quantum computation. By using the mathematical techniques of Riemannian geometry, we investigate the efficient quantum circuits in quantum…

We study how to generate in minimum time special unitary transformations for a two-level quantum system under the assumptions that: (i) the system is subject to a constant drift, (ii) its dynamics can be affected by three independent,…

Motivated by understanding the power of quantum computation with restricted number of qubits, we give two complete characterizations of unitary quantum space bounded computation. First we show that approximating an element of the inverse of…

Hamiltonian simulation is a key quantum algorithm for modeling complex systems. To implement a Hamiltonian simulation, it is typically decomposed into a list of Pauli strings, each corresponds to an RZ rotation gate with many Clifford…

The numerical performance of algorithms can be studied using test sets or procedures that generate such problems. This paper proposes various methods for generating linear, semidefinite, and second-order cone optimization problems.…

We investigate ancilla-free linear combination of unitaries (LCU) as a framework for approximating complex quantum circuits. This is particularly effective for quantum optimization algorithms, where candidate solutions can be evaluated…

We study the von Neumann algebra generated by q--deformed Gaussian elements l_i+l_i^* where operators l_i fulfill the q--deformed canonical commutation relations l_i l_j^*-q l_j^* l_i=delta_{ij} for -1<q<1. We show that if the number of…

This paper describes a bounded generation result concerning the minimal natural number $K$ such that for $Q(C_2,2R):=\{A\varepsilon_{\phi}(2x)A^{-1}|x\in R,A\in{\rm Sp}_4(R),\phi\in C_2\}$, one has $N_{C_2,2R}=\{X_1\cdots X_K|\forall 1\leq…

The proposal for quantum computing with rare-earth-ion qubits in inorganic crystals makes use of the inhomogeneous broadening of optical transitions in the ions to associate individual qubits with ions responding to radiation in selected…

Any square matrix can be transformed into a doubly stochastic matrix via Sinkhorn scaling with diagonal matrices or completing to a larger dimensional matrix. Standard Birkhoff-von Neumann and Pauli decompositions represent such matrices as…

We provide a new approach for compiling quantum simulation circuits that appear in Trotter, qDRIFT and multi-product formulas to Clifford and non-Clifford operations that can reduce the number of non-Clifford operations by a factor of up to…

Quantum algorithms for simulation of Hamiltonian evolution are often based on product formulae. The fractal methods give a systematic way to find arbitrarily high-order product formulae, but result in a large number of exponentials. On the…

We explicitly compute the optimal cost for a class of example problems in geometric quantum control. These problems are defined by a Cartan decomposition of $su(2^n)$ into orthogonal subspaces $\mathfrak{l}$ and $\mathfrak{p}$ such that…

Important problems across multiple disciplines involve computations on the semiring $(\times, \max)$ (or its equivalents, the negated version $(\times, \min)$), the log-transformed version $(+, \max)$, or the negated log-transformed version…

What makes a class of quantum circuits efficiently classically simulable on average? I present a framework that applies harmonic analysis of groups to circuits with a structure encoded by group parameters. Expanding the circuits in a…