We report a hardware implementation of a reversible imprint-retrieval cycle motivated by the Quantum Memory Matrix (QMM) framework. Using IBM Quantum backends, we realize five circuits that scale from a minimal three-qubit memory cell to a five-qubit dual-cycle architecture, including variants with controlled phase evolution and deliberate perturbation. Because the circuit readout is based on computational-basis bit strings, the primary experimental metric is the basis-matched retrieval probability, \(P_{\textrm{ret}}=N_{\textrm{match}}/N_{\textrm{shots}}\) , reported together with Wilson-score \(95\,\%\) confidence intervals, Pearson correlations, and mutual information between field and output qubits. Across the five experiments, \(P_{\textrm{ret}}\) ranges from \(0.487\pm 0.017\) in the evolution stress test to \(0.732\pm 0.012\) in the baseline three-qubit cycle, with the dual-cycle and controlled-error variants remaining near 0.70 under realistic device noise. These results provide a proof-of-principle demonstration that finite-dimensional quantum registers can store and return basis-level information through local unitary gates. The experiments therefore support the operational imprint-retrieval primitive underlying QMM, while also identifying full state tomography as the next step toward verifying phase-coherent state recovery.
