Summary: Hardy’s paradox can demonstrate the conflict between quantum mechanics and local realism. Experimental testing of Hardy’s paradox has been carried out, but it involved only a few qubits. We propose a simple but novel approach to verify the generalized Hardy’s paradox and Hardy’s inequality using quantum programming. By designing scalable quantum circuits, we write quantum programs in Q# and corresponding classical controls in C# using Visual Studio. Our quantum simulation results are consistent with the original theoretical values; moreover, they can be easily extended to multiqubit systems. This provides an effective means for investigating multipartite entanglement question using quantum programming.