Data structures are essential to programming, underpinning computing models through their memory representations such as stacks. Despite focusing on algorithms in the quantum computing literature, data structures and memory have been relatively neglected. This paper presents an approach to implementing classical data types in the quantum framework, specifically focusing on a stack data structure at the quantum circuit level. Our method maps the traditional stack operations push and pop onto quantum operations, enabling data elements to be represented as quantum states and their transitions as quantum operations. The proposed quantum stack implementation is constructed using quantum gates to maintain the stack’s Last-In-First-Out (LIFO) behavior. Conventional programming languages are based on the von Neumann architecture. A memory location has an l-value which is the address and an r-value which is the actual value that is stored. The r-value can change. This is vital to implementing data structures in the conventional programming paradigm. Quantum computing lacks this r-value feature. Hence, the implementation of data structures in the quantum computing paradigm is a significant problem to be addressed, since data structures and their implementation are critical to data organization, storage, programming and retrieval. In this paper, we propose a stack quantum model based on computational basis and rotation.