Quantum Fourier transform revisited

The fast Fourier transform (FFT) is one of the most successful numerical algorithms of the 20th century and has found numerous applications in many branches of computational science and engineering. The FFT algorithm can be derived from a particular matrix decomposition of the discrete Fourier transform (DFT) matrix. In this paper, we show that the quantum Fourier transform (QFT) can be derived by further decomposing the diagonal factors of the FFT matrix decomposition into products of matrices with Kronecker product structure. We analyze the implication of this Kronecker product structure on the discrete Fourier transform of rank-1 tensors on a classical computer. We also explain why such a structure can take advantage of an important quantum computer feature that enables the QFT algorithm to attain an exponential speedup on a quantum computer over the FFT algorithm on a classical computer. Further, the connection between the matrix decomposition of the DFT matrix and a quantum circuit is made. We also discuss a natural extension of a radix-2 QFT decomposition to a radix-d QFT decomposition. No prior knowledge of quantum computing is required to understand what is presented in this paper. Yet, we believe this paper may help readers to gain some rudimentary understanding of the nature of quantum computing from a matrix computation point of view

Rounding and Chaining LLL: Finding Faster Small Roots of Univariate Polynomial Congruences

International audienceIn a seminal work at EUROCRYPT '96, Coppersmith showed how to find all small roots of a univariate polynomial congruence in polynomial time: this has found many applications in public-key cryptanalysis and in a few security proofs. However, the running time of the algorithm is a high-degree polynomial, which limits experiments: the bottleneck is an LLL reduction of a high-dimensional matrix with extra-large coefficients. We present in this paper the first significant speedups over Coppersmith's algorithm. The first speedup is based on a special property of the matrices used by Coppersmith's algorithm, which allows us to provably speed up the LLL reduction by rounding, and which can also be used to improve the complexity analysis of Coppersmith's original algorithm. The exact speedup depends on the LLL algorithm used: for instance, the speedup is asymptotically quadratic in the bit-size of the small-root bound if one uses the Nguyen-Stehlé L2 algorithm. The second speedup is heuristic and applies whenever one wants to enlarge the root size of Coppersmith's algorithm by exhaustive search. Instead of performing several LLL reductions independently, we exploit hidden relationships between these matrices so that the LLL reductions can be somewhat chained to decrease the global running time. When both speedups are combined, the new algorithm is in practice hundreds of times faster for typical parameters

Noise Stabilization of Self-Organized Memories

We investigate a nonlinear dynamical system which ``remembers'' preselected values of a system parameter. The deterministic version of the system can encode many parameter values during a transient period, but in the limit of long times, almost all of them are forgotten. Here we show that a certain type of stochastic noise can stabilize multiple memories, enabling many parameter values to be encoded permanently. We present analytic results that provide insight both into the memory formation and into the noise-induced memory stabilization. The relevance of our results to experiments on the charge-density wave material $NbSe_3$ is discussed.Comment: 29 pages, 6 figures, submitted to Physical Review

Alphabetic Minimax Trees of Degree at Most t*

Problems in circuit fan-out reduction motivate the study of constructing various types of weighted trees that are optimal with respect to maximum weighted path length. An upper bound on the maximum weighted path length and an efficient construction algorithm will be presented for trees of degree at most t, along with their implications for circuit fan-out reduction

Second Harmonic Coherent Driving of a Spin Qubit in a Si/SiGe Quantum Dot

We demonstrate coherent driving of a single electron spin using second harmonic excitation in a Si/SiGe quantum dot. Our estimates suggest that the anharmonic dot confining potential combined with a gradient in the transverse magnetic field dominates the second harmonic response. As expected, the Rabi frequency depends quadratically on the driving amplitude and the periodicity with respect to the phase of the drive is twice that of the fundamental harmonic. The maximum Rabi frequency observed for the second harmonic is just a factor of two lower than that achieved for the first harmonic when driving at the same power. Combined with the lower demands on microwave circuitry when operating at half the qubit frequency, these observations indicate that second harmonic driving can be a useful technique for future quantum computation architectures.Comment: 9 pages, 9 figure

Cooling of cryogenic electron bilayers via the Coulomb interaction

Heat dissipation in current-carrying cryogenic nanostructures is problematic because the phonon density of states decreases strongly as energy decreases. We show that the Coulomb interaction can prove a valuable resource for carrier cooling via coupling to a nearby, cold electron reservoir. Specifically, we consider the geometry of an electron bilayer in a silicon-based heterostructure, and analyze the power transfer. We show that across a range of temperatures, separations, and sheet densities, the electron-electron interaction dominates the phonon heat-dissipation modes as the main cooling mechanism. Coulomb cooling is most effective at low densities, when phonon cooling is least effective in silicon, making it especially relevant for experiments attempting to perform coherent manipulations of single spins.Comment: 9 pages, 5 figure

Fast tunnel rates in Si/SiGe one-electron single and double quantum dots

We report the fabrication and measurement of one-electron single and double quantum dots with fast tunnel rates in a Si/SiGe heterostructure. Achieving fast tunnel rates in few-electron dots can be challenging, in part due to the large electron effective mass in Si. Using charge sensing, we identify signatures of tunnel rates in and out of the dot that are fast or slow compared to the measurement rate. Such signatures provide a means to calibrate the absolute electron number and verify single electron occupation. Pulsed gate voltage measurements are used to validate the approach.Comment: 4 pages, double column, 3 figure