85 citations · 446 across the 42 of their papers we have counts for
6 papers · 1 filter
The RQR algorithm
Daan Camps, Thomas Mach, Raf Vandebril +1
Pole-swapping algorithms, generalizations of bulge-chasing algorithms, have been shown to be a viable alternative to the bulge-chasing QZ algorithm for solving the generalized eige…
An Algebraic Quantum Circuit Compression Algorithm for Hamiltonian Simulation
Daan Camps, Efekan Kökcü, Lindsay Bassman +3
Quantum computing is a promising technology that harnesses the peculiarities of quantum mechanics to deliver computational speedups for some problems that are intractable to solve…
Quantum Fourier Transform Revisited
Daan Camps, Roel Van Beeumen, Chao Yang
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 scienc…
On pole-swapping algorithms for the eigenvalue problem
Daan Camps, Thomas Mach, Raf Vandebril +1
Pole-swapping algorithms, which are generalizations of the QZ algorithm for the generalized eigenvalue problem, are studied. A new modular (and therefore more flexible) convergence…
A multishift, multipole rational QZ method with aggressive early deflation
Thijs Steel, Daan Camps, Karl Meerbergen +1
The rational QZ method generalizes the QZ method by implicitly supporting rational subspace iteration. In this paper we extend the rational QZ method by introducing shifts and pole…
A rational QZ method
Daan Camps, Karl Meerbergen, Raf Vandebril
We propose a rational QZ method for the solution of the dense, unsymmetric generalized eigenvalue problem. This generalization of the classical QZ method operates implicitly on a H…