Parts | Days | Selection | Search | Downloads | Help

SYQI: Quantum information processing in condensed media

SYQI 2: Quantum information processing in condensed media II

SYQI 2.4: Talk

Monday, March 24, 2003, 16:45–17:00, HSZ/01

Implementation of quantum algorithms with an arbitrary number of Josephson charge qubits — •Norbert Schuch and Jens Siewert — Institut für Theoretische Physik, Universität Regensburg, 93040 Regensburg

The Deutsch–Jozsa algorithm exhibits all peculiar features of quantum algorithms such as exponential speed-up and presence of entanglement during the computation. Therefore, its implementation may be regarded as a touchstone for the feasibility of quantum computation with a given hardware proposal.

Existing implementations of the Deutsch–Jozsa algorithm do not involve more than three qubits, and require cumbersome classification schemes which cannot be extended naturally to higher qubit numbers.

We present a novel kind of programmable networks which allows for the implementation of all Deutsch oracles on the same footing. As an example we show how the Deutsch–Jozsa algorithm can be implemented for a setup of N Josephson charge qubits. These programmable networks are particularly well suited to overcome hardware-specific constraints and can also be applied to implement Grover’s search algorithm.