Abstract: Embodiments of the present disclosure provide for efficient global qubit placement within a quantum computing environment for a quantum program. Some embodiments utilize a graph-based approach to represent positions in a quantum computing environment, and optimize the graph layout using a graph processing algorithm to rearrange layers of a graph and reduce edge crossings. A layered graph associated with minimum cost is selected and utilized as an efficient layered graph for purposes of global qubit placement at various time steps of execution. Embodiments provide satisfactory approximations that avoid the NP-hard nature of this task to significantly reduce compilation time to a solution for global qubit placement as opposed to optimal global qubit placement while additionally identifying solutions that significantly reduce overall execution time and computing resource usage.