17 citations · 31 across the 4 of their papers we have counts for
8 papers · 1 filter
Implementing high dimensional unitary representations of SU(2) on a Quantum Computer
Christof Zalka
In this note we consider a system with a large angular momentum l whose state we can store using some log_2(l) qubits. The problem then is how to carry out spatial rotations of the…
Introduction to Quantum Computers and Quantum Algorithms
Christof Zalka
This is a short introduction to Quantum Computing intended for physicists. The basic idea of a quantum computer is introduced. Then we concentrate on Shor's integer factoring algor…
Exact quantum Fourier transforms and discrete logarithm algorithms
Michele Mosca, Christof Zalka
We show how the quantum fast Fourier transform (QFFT) can be made exact for arbitrary orders (first for large primes). For most quantum algorithms only the quantum Fourier transfor…
Shor's discrete logarithm quantum algorithm for elliptic curves
John Proos, Christof Zalka
We show in some detail how to implement Shor's efficient quantum algorithm for discrete logarithms for the particular case of elliptic curve groups. It turns out that for this prob…
Comment on "Stable Quantum Computation of Unstable Classical Chaos"
Christof Zalka
This is a 1-page comment on a wrong paper that recently appeared in PRL (Phys. Rev. Lett. 86 (23), 5393 (2001), also quant-ph/0101004). The authors claim to have shown that using a…
A Grover-based quantum search of optimal order for an unknown number of marked elements
Christof Zalka
We want to find a marked element out of a black box containing N elements. When the number of marked elements is known this can be done elegantly with Grover's algorithm, a variant…