The growth of classical computers can be credited in no small part to the development of operating systems designed to provide program portability between different hardware configurations. Quantum computing should learn from classical computing history in order to expedite their development. The approach presented in this paper results in basic parallel execution of quantum programs. The approach utilises the information required for sequential execution including program dependancies, program mappings and qubit connectivities reshaping it to present novel data in the form of a serializability conflict graph. Utilising this graph the quantum system can easily determine parallelisable programs as well as how to parallelise them. This premiere system has been implemented and an attempted comparison has been made to other simulators. Because this system requires no new information, the comparison demonstrates that the cost of employing this strategy is largely similar to employing current sequential techniques, with the added novel benefit of parallel execution.
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Conference||IEEE International Conference on Algorithms and Architectures for Parallel Processing|
|Period||1/01/02 → …|
- Quantum Computing
- Operating Systems
- Graph Theory