相关论文: Fast and accurate evaluation of Wigner 3j, 6j, and…
We present an efficient quantum algorithm for estimating Gauss sums over finite fields and finite rings. This is a natural problem as the description of a Gauss sum can be done without reference to a black box function. With a reduction…
We represent both the states and the evolution of a quantum computer in phase space using the discrete Wigner function. We study properties of the phase space representation of quantum algorithms: apart from analyzing important examples,…
The $6j$-symbols for representations of the $\mathrm{SU}(2)$ quantum group are given by Hahn-Exton $q$-Bessel functions. This interpretation leads to several summation identities for the $q$-Bessel functions. Multivariate $q$-Bessel…
We compute the third order moments of a complex Wigner matrix. We provide a formula for the third order moments $\alpha_{m_1,m_2,m_3}$ in terms of quotient graphs $T_{m_1,m_2,m_3}^{\pi}$ where $\pi$ is the Kreweras complement of a…
Modern cryptography is largely based on complexity assumptions, for example, the ubiquitous RSA is based on the supposed complexity of the prime factorization problem. Thus, it is of fundamental importance to understand how a quantum…
The road to computing on quantum devices has been accelerated by the promises that come from using Shor's algorithm to reduce the complexity of prime factorization. However, this promise hast not yet been realized due to noisy qubits and…
In this paper, we introduce a novel quantum algorithm for the factorization of composite odd numbers. This work makes two significant contributions. First, we present a new improvement to the classical Fermat method, fourfold reducing the…
Whether for fundamental studies or nuclear data evaluations, first-principle calculations of atomic nuclei constitute the path forward. Today, performing \textit{ab initio} calculations (a) of heavy nuclei, (b) of doubly open-shell nuclei…
Since simulating quantum computers requires exponentially more classical resources, efficient algorithms are extremely helpful. We analyze algorithms that create single qubit and specific controlled qubit matrix representations of gates.…
The quantum Fourier transform (QFT) has been implemented on a three bit nuclear magnetic resonance (NMR) quantum computer, providing a first step towards the realization of Shor's factoring and other quantum algorithms. Implementation of…
Quantum computing is a promising new area of computing with quantum algorithms offering a potential speedup over classical algorithms if fault tolerant quantum computers can be built. One of the first applications of the classical computer…
We investigate the simulation of fermionic systems on a quantum computer. We show in detail how quantum computers avoid the dynamical sign problem present in classical simulations of these systems, therefore reducing a problem believed to…
For the general operator product algebra coefficients derived by Cremmer Roussel Schnittger and the present author with (positive integer) screening numbers, the coupling constants determine the factors additional to the quantum group 6j…
The quantum Fourier transform (QFT), a quantum analog of the classical Fourier transform, has been shown to be a powerful tool in developing quantum algorithms. However, in classical computing there is another class of unitary transforms,…
A compression algorithm is introduced for multi-determinant wave functions which can greatly reduce the number of determinants that need to be evaluated in quantum Monte Carlo calculations. We have devised an algorithm with three levels of…
The Tamm structures show high quality (Q) factor property with simple photonic Bragg reflectors composed of alternative high/low refractive index layers and metal reflectors. However, the Q-factor of Tamm structures is inherently limited by…
Tensor factorization with hard and/or soft constraints has played an important role in signal processing and data analysis. However, existing algorithms for constrained tensor factorization have two drawbacks: (i) they require…
We study different techniques that allow us to gain complete knowledge about an unknown quantum state, e.g. to perform full tomography of this state. We focus on two apparently simple cases, full tomography of one and two qubit systems. We…
We present the first complete derivation of the well-known asymptotic expansion of the SU(2) 6j symbol using a coherent state approach, in particular we succeed in computing the determinant of the Hessian matrix. To do so, we smear the…
We test iterative algorithms, MR, QMR$\gamma_5$ and BiCG$\gamma_5$, to compare their efficiency in matrix inversion with multi-quarks (shifted matrices) within one iteration process. Our results on the 8^3 x 12 and 16^3 x 24 show that MR…