Quantum teleportation is a universal computational primitive. This paper presents a method to create various quantum gates by teleporting quantum bits through special entangled states. This allows the construction of a quantum computer using single qubit operations, Bell measurements, and GHZ states. The paper also presents straightforward constructions of a wide variety of fault-tolerant quantum gates. Quantum computers capable of realizing the theoretical promise of algorithms like quantum factoring and quantum search require both a large system with accurate controlled unitary evolution and fault-tolerant procedures to overcome physical imperfections. While many quantum computer designs exist, none are completely satisfactory for near-term implementation. Some universal fault-tolerant protocols are known, but they are complex and require many operations. The paper addresses these issues and shows how a single technique—generalized quantum teleportation—reduces resource requirements for quantum computation and unifies known protocols for fault-tolerant quantum computation. It shows that a quantum computer can be constructed using single qubit operations, Bell-basis measurements, and GHZ states. It also presents straightforward constructions for a new, infinite class of fault-tolerant quantum gates. The paper discusses the power of entangling measurements. While generally considered irreversible, in certain cases, they can be used to preserve quantum information. Quantum teleportation uses measurement to transfer quantum information, and programmable quantum gates can probabilistically transform quantum information. Quantum error correction allows reversing quantum operations. The paper shows how quantum teleportation can be used to transform data into a new state, corresponding to the action of a quantum gate. It demonstrates how a controlled-NOT gate can be deterministically accomplished using quantum teleportation. It also shows how two qubits can be teleported through a CNOT gate. The paper discusses fault-tolerant quantum computation. It shows that any gate U which preserves the Pauli group under conjugation can be used to perform fault-tolerant quantum computation. This set of gates, the Clifford group, plays an important role in quantum error correction. The paper presents a method to perform any gate in the Clifford group using quantum teleportation. The paper also discusses the preparation of ancilla states for fault-tolerant quantum computation. It shows how to prepare the state |Ψ_U^n> fault-tolerantly using measurements and Pauli operations. The paper presents a detailed procedure for fault-tolerant measurement of operators, using cat states to limit error propagation. The paper concludes that quantum teleportation offers a way to relax experimental constraints on realizing quantum computers. It shows that quantum computers can be constructed using linear optical components and that teleportation can be used to perform a wide variety of fault-tolerant quantum gates. The paper also discusses the importance of entangled states in quantum computation and their potential as valuable resources.Quantum teleportation is a universal computational primitive. This paper presents a method to create various quantum gates by teleporting quantum bits through special entangled states. This allows the construction of a quantum computer using single qubit operations, Bell measurements, and GHZ states. The paper also presents straightforward constructions of a wide variety of fault-tolerant quantum gates. Quantum computers capable of realizing the theoretical promise of algorithms like quantum factoring and quantum search require both a large system with accurate controlled unitary evolution and fault-tolerant procedures to overcome physical imperfections. While many quantum computer designs exist, none are completely satisfactory for near-term implementation. Some universal fault-tolerant protocols are known, but they are complex and require many operations. The paper addresses these issues and shows how a single technique—generalized quantum teleportation—reduces resource requirements for quantum computation and unifies known protocols for fault-tolerant quantum computation. It shows that a quantum computer can be constructed using single qubit operations, Bell-basis measurements, and GHZ states. It also presents straightforward constructions for a new, infinite class of fault-tolerant quantum gates. The paper discusses the power of entangling measurements. While generally considered irreversible, in certain cases, they can be used to preserve quantum information. Quantum teleportation uses measurement to transfer quantum information, and programmable quantum gates can probabilistically transform quantum information. Quantum error correction allows reversing quantum operations. The paper shows how quantum teleportation can be used to transform data into a new state, corresponding to the action of a quantum gate. It demonstrates how a controlled-NOT gate can be deterministically accomplished using quantum teleportation. It also shows how two qubits can be teleported through a CNOT gate. The paper discusses fault-tolerant quantum computation. It shows that any gate U which preserves the Pauli group under conjugation can be used to perform fault-tolerant quantum computation. This set of gates, the Clifford group, plays an important role in quantum error correction. The paper presents a method to perform any gate in the Clifford group using quantum teleportation. The paper also discusses the preparation of ancilla states for fault-tolerant quantum computation. It shows how to prepare the state |Ψ_U^n> fault-tolerantly using measurements and Pauli operations. The paper presents a detailed procedure for fault-tolerant measurement of operators, using cat states to limit error propagation. The paper concludes that quantum teleportation offers a way to relax experimental constraints on realizing quantum computers. It shows that quantum computers can be constructed using linear optical components and that teleportation can be used to perform a wide variety of fault-tolerant quantum gates. The paper also discusses the importance of entangled states in quantum computation and their potential as valuable resources.