This paper presents the one-way quantum computer (QC_C), a quantum computation scheme that uses only one-qubit measurements on a cluster state, an entangled state of qubits. The QC_C is universal, meaning it can simulate any quantum logic network efficiently. The computation is based on a cluster state, which serves as a universal resource for quantum computation. The entire computation is performed through a sequence of one-qubit measurements on the cluster state, which is initially prepared in a specific entangled state. The cluster state provides all the necessary entanglement for the computation, and the measurements drive the computation forward. The QC_C is different from the network model of quantum computation, which relies on unitary operations. Instead, the QC_C uses measurements as the central tool for computation. The paper discusses the universality of the QC_C, relates quantum algorithms to graphs, and provides examples of circuits of practical interest, such as the quantum Fourier transformation and the quantum adder. It also discusses the scaling of required resources and the computation with finite clusters. The paper shows that the QC_C can be implemented with a polynomial overhead, and that all QC_C circuits in the Clifford group have unit logical depth. The paper also discusses the non-network aspects of the QC_C and how it can be used for practical quantum computations. The paper concludes that the QC_C is a powerful and efficient method for quantum computation, and that it can be implemented with a variety of physical systems.This paper presents the one-way quantum computer (QC_C), a quantum computation scheme that uses only one-qubit measurements on a cluster state, an entangled state of qubits. The QC_C is universal, meaning it can simulate any quantum logic network efficiently. The computation is based on a cluster state, which serves as a universal resource for quantum computation. The entire computation is performed through a sequence of one-qubit measurements on the cluster state, which is initially prepared in a specific entangled state. The cluster state provides all the necessary entanglement for the computation, and the measurements drive the computation forward. The QC_C is different from the network model of quantum computation, which relies on unitary operations. Instead, the QC_C uses measurements as the central tool for computation. The paper discusses the universality of the QC_C, relates quantum algorithms to graphs, and provides examples of circuits of practical interest, such as the quantum Fourier transformation and the quantum adder. It also discusses the scaling of required resources and the computation with finite clusters. The paper shows that the QC_C can be implemented with a polynomial overhead, and that all QC_C circuits in the Clifford group have unit logical depth. The paper also discusses the non-network aspects of the QC_C and how it can be used for practical quantum computations. The paper concludes that the QC_C is a powerful and efficient method for quantum computation, and that it can be implemented with a variety of physical systems.