The paper presents the experimental realization of two-qubit quantum algorithms using a superconducting circuit. The authors demonstrate a two-qubit processor capable of implementing Grover's search and Deutsch-Jozsa quantum algorithms. The processor is based on a circuit quantum electrodynamics (cQED) architecture, featuring a cavity bus and tunable two-qubit interaction mediated by the cavity. This interaction allows the generation of highly entangled states with a concurrence of up to 94%. The processor's key components include transmon qubits, a microwave cavity, and flux-bias lines for tuning qubit frequencies. The authors achieve single-qubit rotations, state preparation, and universal gate operations, with coherence times of about 1 μs. They also perform quantum state tomography to reconstruct the density matrix of the two-qubit state, demonstrating high-fidelity entanglement generation and detection. The implementation of Grover's search and Deutsch-Jozsa algorithms shows fidelities of 85% and 94%, respectively, indicating the potential for scalable quantum computing with solid-state qubits.The paper presents the experimental realization of two-qubit quantum algorithms using a superconducting circuit. The authors demonstrate a two-qubit processor capable of implementing Grover's search and Deutsch-Jozsa quantum algorithms. The processor is based on a circuit quantum electrodynamics (cQED) architecture, featuring a cavity bus and tunable two-qubit interaction mediated by the cavity. This interaction allows the generation of highly entangled states with a concurrence of up to 94%. The processor's key components include transmon qubits, a microwave cavity, and flux-bias lines for tuning qubit frequencies. The authors achieve single-qubit rotations, state preparation, and universal gate operations, with coherence times of about 1 μs. They also perform quantum state tomography to reconstruct the density matrix of the two-qubit state, demonstrating high-fidelity entanglement generation and detection. The implementation of Grover's search and Deutsch-Jozsa algorithms shows fidelities of 85% and 94%, respectively, indicating the potential for scalable quantum computing with solid-state qubits.