相关论文: Quantum Circuit for Calculating Mobius-like Transf…
The ability to implement the Quantum Fourier Transform (QFT) efficiently on a quantum computer facilitates the advantages offered by a variety of fundamental quantum algorithms, such as those for integer factoring, computing discrete…
In general, a quantum circuit is constructed with elementary gates, such as one-qubit gates and CNOT gates. It is possible, however, to speed up the execution time of a given circuit by merging those elementary gates together into larger…
We present a classically solvable model that leads to optimized low-depth quantum circuits leveraging separable pair approximations. The obtained circuits are well suited as a baseline circuit for emerging quantum hardware and can, in the…
In this paper, we present quantum algorithms for a class of highly-oscillatory transport equations, which arise in semiclassical computation of surface hopping problems and other related non-adiabatic quantum dynamics, based on the…
Quantum data loading plays a central role in quantum algorithms and quantum information processing. Many quantum algorithms hinge on the ability to prepare arbitrary superposition states as a subroutine, with claims of exponential speedups…
The Box-Muller transform is a widely used method to generate Gaussian samples from uniform samples. Quantum amplitude encoding methods encode the multi-variate normal distribution in the amplitudes of a quantum state. This work presents the…
The translation of Grover's search algorithm from its standard version, designed for implementation on a single quantum system amenable to projective measurements, into one suitable for an ensemble of quantum computers, whose outputs are…
We construct an efficient quantum algorithm to compute the quantum Schur-Weyl transform for any value of the quantum parameter $q \in [0,\infty]$. Our algorithm is a $q$-deformation of the Bacon-Chuang-Harrow algorithm, in the sense that it…
We present an algorithm turning any term of a linear quantum $\lambda$-calculus into a quantum circuit. The essential ingredient behind the proposed algorithm is Girard's geometry of interaction, which, differently from its well-known uses…
We show that several quantum circuit families can be simulated efficiently classically if it is promised that their output distribution is approximately sparse i.e. the distribution is close to one where only a polynomially small, a priori…
We propose an implementation of a quantum walk on a circle on an optomechanical system by encoding the walker on the phase space of a radiation field and the coin on a two-level state of a mechanical resonator. The dynamics of the system is…
While thousands of experimental physicists and chemists are currently trying to build scalable quantum computers, it appears that simulation of quantum computation will be at least as critical as circuit simulation in classical VLSI design.…
Building on the established methods for superconducting circuit quantization, we present a new theoretical framework for approximate numerical simulation of Josephson quantum circuits. Simulations based on this framework provide access to a…
Fundamental matrix operations and solving linear systems of equations are ubiquitous in scientific investigations. Using the "Sender-Receiver" model, we propose quantum algorithms for matrix operations such as matrix-vector product,…
The Schur basis on n d-dimensional quantum systems is a generalization of the total angular momentum basis that is useful for exploiting symmetry under permutations or collective unitary rotations. We present efficient (size…
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…
The Quantum Fourier Transform (QFT) is a fundamental component of many quantum computing algorithms. In this paper, we present an alternative method for factoring this transformation. Inspired by this approach, we introduce a new quantum…
In this work, we describe examples for calculating the 1-D circular convolution of signals represented by 3-qubit superpositions. The case is considered, when the discrete Fourier transform of one of the signals is known and calculated in…
Various algorithms have been developed to simulate quantum circuits on classical hardware. Among the most prominent are approaches based on \emph{stabilizer decompositions} and \emph{tensor network contraction}. In this work, we present a…
This study presents a quantum circuit for estimating the pi value using arithmetic circuits and by quantum amplitude estimation. We review two types of quantum multipliers and propose quantum squaring circuits based on the multiplier as…