Related papers: Primitive Quantum Gates for an $SU(2)$ Discrete Su…
We provide two sufficient conditions to guarantee that the round functions of a translation based cipher generate a primitive group. Furthermore, under the same hypotheses, and assuming that a round of the cipher is strongly proper and…
A qubit, or quantum bit, is conventionally defined as "a physical system for storing information that is capable of existing in either of two quantum states or in a superposition of both". In this paper, we examine the simple question of…
We establish and analyse the performance and resource requirements of an end-to-end fault-tolerant quantum algorithm for computing the absorption spectrum and population dynamics of photoexcited pyrazine. The quantum circuit construction…
We show that any quantum circuit of treewidth $t$, built from $r$-qubit gates, requires at least $\Omega(\frac{n^{2}}{2^{O(r\cdot t)}\cdot \log^4 n})$ gates to compute the element distinctness function. Our result generalizes a…
In this paper, we offer and discuss three efficient structural solutions for the hardware-oriented implementation of discrete quaternion Fourier transform basic operations with reduced implementation complexities. The first solution: a…
We present a novel set of reversible modular multipliers applicable to quantum computing, derived from three classical techniques: 1) traditional integer division, 2) Montgomery residue arithmetic, and 3) Barrett reduction. Each multiplier…
We show that many well-known signal transforms allow highly efficient realizations on a quantum computer. We explain some elementary quantum circuits and review the construction of the Quantum Fourier Transform. We derive quantum circuits…
Shadow estimation is a sample-efficient protocol for learning the properties of a quantum system using randomized measurements, but the current understanding of qudit shadow estimation is quite limited compared with the qubit setting. Here…
Atomic Interferometer has two quantum unitary gates that must be realized for quantum sensing purposes from atomic gravimeter and atomic interferometer gyroscope. An optimal cost function which define the distance between two unitary…
We detail a quantum circuit capable of efficiently encoding analytical approximations to gravitational wave signal waveforms of compact binary coalescences into the amplitudes of quantum bits using both quantum arithmetic operations and…
It has been shown that non-stabilizer eigenstates of permutation gates are appropriate for allowing $d$-dimensional universal quantum computing (uqc) based on minimal informationally complete POVMs. The relevant quantum gates may be built…
Consider the universal gate set for quantum computing consisting of the gates X, CX, CCX, omega^dagger H, and S. All of these gates have matrix entries in the ring Z[1/2,i], the smallest subring of the complex numbers containing 1/2 and i.…
In this paper, with the weak cross-Kerr nonlinearity, we first present a special experimental scheme called C-path gate with which the realization of all possible bipartite POVMs of two-photon polarization states can be simpler and nearly…
The most general structure (in matrix form) of a single-qubit gate is presented. Subsequently, used that to obtain a set of conditions for testing (a) whether a given 2-qubit gate is genuinely a 2-qubit gate, i.e., not decomposable into two…
Quantum computing has been attracting tremendous efforts in recent years. One prominent application is to perform quantum simulations of electron correlations in large molecules and solid-state materials, where orbital degrees of freedom…
For a positive integer $m$, a (positive definite integral) quadratic form is called primitively $m$-universal if it primitively represents all quadratic forms of rank $m$. It was proved in arXiv:2202.13573 that there are exactly $107$…
We first review some invariant theoretic results about the finite subgroups of SU(2) in a quick algebraic way by using the McKay correspondence and quantum affine Cartan matrices. By the way it turns out that some parameters (a,b,h;p,q,r)…
Efficient digitization is required for quantum simulations of gauge theories. Schemes based on discrete subgroups use a smaller, fixed number of qubits at the cost of systematic errors. We systematize this approach by deriving the single…
Leakage errors damage a qubit by coupling it to other levels. Over the years, several theoretical approaches to dealing with such errors have been developed based on perturbation arguments. Here we propose a different strategy: we use a…
This study presents a roadmap towards utilizing a single arbitrary gate for universal quantum computing. Since two decades ago, it has been widely accepted that almost any single arbitrary gate with qubit number $>2$ is universal. Utilizing…