635 citations · 1.7k across the 19 of their papers we have counts for
19 papers
Shor's algorithm with fewer (pure) qubits
Christof Zalka
In this note we consider optimised circuits for implementing Shor's quantum factoring algorithm. First I give a circuit for which none of the about 2n qubits need to be initialised…
Thresholds for Linear Optics Quantum Computing with Photon Loss at the Detectors
Marcus Silva, Martin Roetteler, Christof Zalka
We calculate the error threshold for the linear optics quantum computing proposal by Knill, Laflamme and Milburn [Nature 409, pp. 46--52 (2001)] under an error model where photon d…
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…
Comment on "Probabilistic Quantum Memories"
T. Brun, H. Klauck, A. Nayak +2
This is a comment on two wrong Phys. Rev. Letters papers by C.A. Trugenberger. Trugenberger claimed that quantum registers could be used as exponentially large "associative" memori…
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…