Keywords:-
Article Content:-
Abstract
This paper implicates the graph theoretic approach for quantum information systems modelling by employing linear graph theoretic modelling to analyse single qubit rotation operator gates. By representing qubit states as nodes and rotation operations at edges, a linear graph framework is developed to systematically examine the interactions and transformations involved in qubit rotation. This study establishes a link between linear graph theory and quantum computing. Through this perspective, the paper contributes to both the fields of linear graph theoretic modelling of general systems and quantum computing, paving the way for new insights and advancements in quantum algorithm design and optimization.
References:-
References
Satsangi, P. S. "Linear graph theory—A growing engineering discipline." Journal of the Institution of Engineers (India) 43.6 (1963): 123.
Bollobás, Béla. Modern graph theory. Vol. 184. Springer Science & Business Media, 1998..
Pósfai, Márton, and Albert-Laszlo Barabasi. Network Science. Cambridge, UK:: Cambridge University Press, 2016.
Deutsch, David. "Quantum theory, the Church–Turing principle and the universal quantum computer." Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences 400.1818 (1985): 97-117.
Nielsen, M. A., & Chuang, I. L. (2000). Quantum Computation and Quantum Information. Cambridge University Press.
Sahni, Vishal, Dayal Pyari Srivastava, and Prem Saran Satsangi. "Unified modelling theory for qubit representation using quantum field graph models." Journal of the Indian Institute of Science 89.3 (2009): 351-362.
Srivastava, Dayal Pyari, Vishal Sahni, and Prem Saran Satsangi. "Graph-theoretic quantum system modelling for information/computation processing circuits." International Journal of General Systems 40.8 (2011): 777-804.
Barenco, Adriano, et al. "Elementary gates for quantum computation." Physical review A 52.5 (1995): 3457.
Grier, D., & Schaeffer, L. (2022). The Classification of Clifford Gates over Qubits. Quantum, 6, 734.
Wong, T. G. (2022). Introduction to classical and quantum computing. (No Title).
Amy, M., Glaudell, A. N., & Ross, N. J. (2020). Number-theoretic characterizations of some restricted Clifford+ T circuits. Quantum, 4, 252.
Akahoshi, Y., Maruyama, K., Oshima, H., Sato, S., & Fujii, K. (2024). Partially fault-tolerant quantum computing architecture with error-corrected Clifford gates and space-time efficient analog rotations. PRX Quantum, 5(1), 010337.
Patil, A., & Guha, S. (2023). Clifford Manipulations of Stabilizer States: A graphical rule book for Clifford unitaries and measurements on cluster states, and application to photonic quantum computing. arXiv preprint arXiv:2312.02377.
Yépez, J. (2013, Spring). Lecture 1: Qubits [Lecture notes]. University of Hawaii at Manoa. Retrieved from https://www.phys.hawaii.edu/wp-content/uploads/2021/03/phys274-F2016-browder.pdf
Czachor, M. (2010). Two-spinors, oscillator algebras, and qubits: aspects of manifestly covariant approach to relativistic quantum information. Quantum Information Processing, 9, 171-232.
Campbell, E. T., Terhal, B. M., & Vuillot, C. (2017). Roads towards fault-tolerant universal quantum computation. Nature, 549(7671), 172-179.
Von Neumann, J. (2018). Mathematical foundations of quantum mechanics: New edition (Vol. 53). Princeton university press.
Preskill, J. (1998). Reliable quantum computers. Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences, 454(1969), 385-410.