In computational complexity theory, bounded-error quantum polynomial time (BQP) is the class of decision problems solvable by a quantum computer in polynomial time, with an error probability of at most 1/3 for all instances.
Published in Chapter:
Quantum Software Engineering and Technology
Subramaniam Meenakshi Sundaram (GSSS Institute of Engineering and Technology for Women, India) and Tejaswini R. Murgod (GSSS Institute of Engineering and Technology for Women, India)
Copyright: © 2022
|Pages: 15
DOI: 10.4018/978-1-7998-9183-3.ch007
Abstract
Quantum technology works with and relies on sub-atomic particles or physics that operates on the quantum level. Quantum computing has become a mature field, having diversified applications in supply chain and logistics, chemistry, economics and financial services, energy and agriculture, medicine and health, etc. In the recent years, companies have started to incorporate quantum software to benefit the research and the practitioner communities. Software engineering and programming practices need to be brought into the domain of quantum computing. Quantum algorithms provide the ability to analyze the data and offer simulations based on the data. A few of the quantum computing programming languages include QISKit, Q#, Cirq, and forest are used to write and run quantum programs. In this chapter, the authors provide an overall picture of the problems and challenges of developing quantum software and up-to-date software engineering processes, methods, techniques, practices, and principles for the development of quantum software to both researchers and practitioners.