It is shown that Deutsch’s algorithm and the Deutsch-Jozsa algorithm for two and three qubits can be efficiently implemented on a classical computer. This is done by analysing the structure of the oracles contained in these algorithms, followed by an implementation in the toy theory proposed by Robert W. Spekkens which uses 2 classical bits to simulate a qubit. Further discussion is given about how to analyse, and possible implementations, of the Deutsch-Jozsa for higher number of qubits in the toy theory.
The family of
n-bit Toffoli gates, with the two-bit Toffoli gate as the figurehead, are of great interest in quantum information as they can be used as universal gates and in quantum error correction, among other things. We present a single-step implementation of arbitrary
n-bit Toffoli gates (up to a local change of basis), based on resonantly driving a single qubit that has a strong Ising coupling to
n other qubits. The setup in the two-qubit case turns out to be identical to the universal Barenco gate. The gate time and error are, in theory, independent of the number of control qubits, scaling better than conventional circuit decompositions. We note that our assumptions, namely, strongly coupling
n+1 qubits and a driving frequency that scales with
n, may break down for large systems. Still, our protocol could enhance the capabilities of intermediate-scale quantum computers, and we discuss the prospects of implementing our protocol on trapped ions, Rydberg atoms, and superconducting circuits. Simulations of the latter platform show that the Toffoli gate with two control bits attains fidelities of above 0.98 even in the presence of decoherence. We also show how similar ideas can be used to make a series of controlled-not gates in a single step. We show how these can speed up the implementation of quantum error correcting codes and we simulate the encoding steps of the three-qubit bit-flip code and the seven-qubit Steane code.
This chapter describes the general case of working with qubits, the number of which can exceed two. It considers the multi-qubit superpositions. Each such superposition possibly describes some physical system of particles that can only be observed in a fixed number of states. The theory and application of multi-qubit superpositions are key to the development of quantum computing and image processing. The chapter also introduces important qubit gates such as Toffoli and Fredkin, demonstrating how classical logic functions can be implemented in quantum circuits. It details elementary operations in multi-qubit systems, starting with three-qubit operations using local gates and control bits. The chapter shows a few 3-qubit gates with one control bits and also gives the symbolic designation of the gates. It also shows 3-qubit gates with 2 control bits.