  An implementation method of a gate in a quantum computer is studied in terms
of a finite number of steps evolving in time according to a finite number of
basic Hamiltonians, which are controlled by on-off switches. As a working
example, the case of a particular implementation of the two qubit computer
employing a simple system of two coupled Josephson junctions is considered. The
binary values of the switches together with the time durations of the steps
constitute the quantum machine language of the system.
