This paper presents the experimental realization of two-qubit quantum algorithms using a superconducting quantum processor. The researchers demonstrate the implementation of the Grover search and Deutsch-Jozsa quantum algorithms on a two-qubit superconducting processor. The processor utilizes a novel two-qubit interaction mediated by a cavity bus in a circuit quantum electrodynamics (cQED) architecture. This interaction allows the generation of highly entangled states with concurrence up to 94%. The processor incorporates local flux control and joint-dispersive readout, enabling on-demand generation and detection of entanglement. The researchers also show that the processor can perform simple algorithms with fidelity greater than 80%. The superconducting quantum processor is a 4-port device comprising two transmon qubits inside a microwave cavity bus. The qubits are coupled via virtual photon exchange and shielded from the electromagnetic continuum. The cavity is used to couple, control, and measure the qubits. The researchers demonstrate the implementation of a two-qubit conditional phase (c-Phase) gate by pulsing the qubit frequencies to an avoided crossing where a σ_z⊗σ_z interaction turns on. Operation in the strong-dispersive regime of cQED allows joint readout that can efficiently detect two-qubit correlations. Combined with single-qubit rotations, this enables tomography of the two-qubit state. The researchers also demonstrate the implementation of the Grover search algorithm, which can determine the solution to a search problem with a single call of an oracle. The algorithm uses the concept of quantum phase kick-back to encode the result in the final state of one qubit while leaving the other untouched. The fidelity of the final state to the expected output is 85%. The researchers also demonstrate the implementation of the Deutsch-Jozsa algorithm, which determines whether an unknown function is constant or balanced. The algorithm applies the function once to a superposition of the two possible inputs and uses the concept of quantum phase kick-back to encode the result in the final state of one qubit. The performance of both algorithms is summarized in Table I. The results suggest that, if combined with single-shot readout, the two algorithms executed with this processor would give the correct answer with probability far exceeding the 50% success probability of the best classical algorithms limited to single calls of the oracle. The researchers conclude that superconducting circuits could eventually perform more complex quantum algorithms on many qubits, provided that coherence lifetimes and the resulting gate fidelities can be further improved.This paper presents the experimental realization of two-qubit quantum algorithms using a superconducting quantum processor. The researchers demonstrate the implementation of the Grover search and Deutsch-Jozsa quantum algorithms on a two-qubit superconducting processor. The processor utilizes a novel two-qubit interaction mediated by a cavity bus in a circuit quantum electrodynamics (cQED) architecture. This interaction allows the generation of highly entangled states with concurrence up to 94%. The processor incorporates local flux control and joint-dispersive readout, enabling on-demand generation and detection of entanglement. The researchers also show that the processor can perform simple algorithms with fidelity greater than 80%. The superconducting quantum processor is a 4-port device comprising two transmon qubits inside a microwave cavity bus. The qubits are coupled via virtual photon exchange and shielded from the electromagnetic continuum. The cavity is used to couple, control, and measure the qubits. The researchers demonstrate the implementation of a two-qubit conditional phase (c-Phase) gate by pulsing the qubit frequencies to an avoided crossing where a σ_z⊗σ_z interaction turns on. Operation in the strong-dispersive regime of cQED allows joint readout that can efficiently detect two-qubit correlations. Combined with single-qubit rotations, this enables tomography of the two-qubit state. The researchers also demonstrate the implementation of the Grover search algorithm, which can determine the solution to a search problem with a single call of an oracle. The algorithm uses the concept of quantum phase kick-back to encode the result in the final state of one qubit while leaving the other untouched. The fidelity of the final state to the expected output is 85%. The researchers also demonstrate the implementation of the Deutsch-Jozsa algorithm, which determines whether an unknown function is constant or balanced. The algorithm applies the function once to a superposition of the two possible inputs and uses the concept of quantum phase kick-back to encode the result in the final state of one qubit. The performance of both algorithms is summarized in Table I. The results suggest that, if combined with single-shot readout, the two algorithms executed with this processor would give the correct answer with probability far exceeding the 50% success probability of the best classical algorithms limited to single calls of the oracle. The researchers conclude that superconducting circuits could eventually perform more complex quantum algorithms on many qubits, provided that coherence lifetimes and the resulting gate fidelities can be further improved.