Betis Baheri
Ang Li
ABSTRACT
Undoubtedly, quantum computing offers valuable acceleration for solving intricate problems. One of the primary hurdles lies in executing large-scale quantum applications on backend machines. Qubit noise, among other factors, dramatically influences the execution process. Implementing effective scheduling techniques for quantum circuits is crucial for practical quantum computing and preventing excessive waiting times. The quantum realm is distinct from classical computing in terms of optimization, performance, utilization, and waiting periods. Consequently, the parameters and components of quantum circuit scheduling diverge from those of classical computing. This paper presents Quantum Noise Mitigation: Introducing the Robust Quantum Circuit Scheduler for Enhanced Fidelity and Throughput, a straightforward yet effective scheduling framework and policy that enhances noise resilience, throughput, and the fidelity of quantum circuits. Drawing inspiration from classical methods, our scheduling approach incorporates additional constraints tailored for quantum logic. The outcome demonstrates a substantial improvement in fidelity and resource management, which is vital for real-world quantum applications.
- Amazon. 2023. Amazon aws braket. https://aws.amazon.com/braket/.Google Scholar
- CNET. 2023. "Cnet: Ibm now has 18 quantum computers in its fleet of weird machines. https://www.cnet.com/news/ibm-now-has-18-quantum-computers-in-its-fleet-of-weird-machines/.Google Scholar
- Sara El Gaily and Sándor Imre. 2019a. Quantum Optimization in Large Resource Management Systems. In 2019 IEEE 20th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC). 1--5. https://doi.org/10.1109/SPAWC.2019.8815470Google Scholar
- Sara El Gaily and Sándor Imre. 2019b. Quantum Resource Distribution Management in Multi-task Environment. In 2019 14th International Conference on Advanced Technologies, Systems and Services in Telecommunications (TELSIKS). 364--367. https://doi.org/10.1109/TELSIKS46999.2019.9002340Google Scholar
- Lov K. Grover. 1996. A fast quantum mechanical algorithm for database search. arxiv: quant-ph/9605043 [quant-ph]Google Scholar
- IBM. 2023. Ibm quantum experience. https://quantum-computing.ibm.com.Google Scholar
- Microsoft. 2023. Microsoft Azure Quantum. https://azure.microsoft.com/en-us/products/quantum/.Google Scholar
- Yunseong Nam, Neil J. Ross, Yuan Su, Andrew M. Childs, and Dmitri Maslov. 2018. Automated optimization of large quantum circuits with continuous parameters. npj Quantum Information, Vol. 4, 1 (10 May 2018), 23. https://doi.org/10.1038/s41534-018-0072--4Google Scholar
- Joe OtextquotesingleGorman and Earl T. Campbell. 2017. Quantum computation with realistic magic-state factories. Physical Review A, Vol. 95, 3 (mar 2017). https://doi.org/10.1103/physreva.95.032338Google Scholar
- John Preskill. 2018. Quantum Computing in the NISQ era and beyond. Quantum, Vol. 2 (Aug 2018), 79. https://doi.org/10.22331/q-2018-08-06--79Google Scholar
- Gokul Subramanian Ravi, Kaitlin N. Smith, Prakash Murali, and Frederic T. Chong. 2022. Adaptive job and resource management for the growing quantum cloud. arxiv: 2203.13260 [quant-ph]Google Scholar
- Zheng Shan, Yu Zhu, and Bo Zhao. 2022. A high-performance compilation strategy for multiplexing quantum control architecture. Scientific Reports, Vol. 12, 1 (03 May 2022), 7132. https://doi.org/10.1038/s41598-022--11154--3Google Scholar
- Peter W. Shor. 1997. Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer. SIAM J. Comput., Vol. 26, 5 (oct 1997), 1484--1509. https://doi.org/10.1137/s0097539795293172Google ScholarDigital Library
- Dan Steinberg. 2009. Chapter 10 CART: Classification and Regression Trees. (01 2009). ioGoogle Scholar
Index Terms
- Quantum Noise Mitigation: Introducing the Robust Quantum Circuit Scheduler for Enhanced Fidelity and Throughput
Recommendations
Integrable quantum computation
Integrable quantum computation is defined as quantum computing via the integrable condition, in which two-qubit gates are either nontrivial unitary solutions of the Yang---Baxter equation or the Swap gate (permutation). To make the definition clear, in ...
Contextuality Supplies the Magic for Quantum Computation
ISMVL '15: Proceedings of the 2015 IEEE 45th International Symposium on Multiple-Valued LogicWe know that quantum mechanics enables the performance of computational and cryptographic tasks that are impossible (or impracticable) using only classical physics. It seems natural to examine manifestations of inherently quantum behaviour as potential ...
Quantum walks: a comprehensive review
Quantum walks, the quantum mechanical counterpart of classical random walks, is an advanced tool for building quantum algorithms that has been recently shown to constitute a universal model of quantum computation. Quantum walks is now a solid field of ...
Comments