Is Your Quantum Program Bug-Free?
arXiv:2001.10870 · doi:10.1145/3377816.3381731
Abstract
Quantum computers are becoming more mainstream. As more programmers are starting to look at writing quantum programs, they face an inevitable task of debugging their code. How should the programs for quantum computers be debugged? In this paper, we discuss existing debugging tactics, used in developing programs for classic computers, and show which ones can be readily adopted. We also highlight quantum-computer-specific debugging issues and list novel techniques that are needed to address these issues. The practitioners can readily apply some of these tactics to their process of writing quantum programs, while researchers can learn about opportunities for future work.
12 pages, 2 figures, accepted for publication in Proceedings of the 42nd International Conference on Software Engineering: New Ideas and Emerging Results, 2020
References in corpus (12)
- Entanglement detection
- Quantum Copying: Beyond the No-Cloning Theorem
- Efficient quantum state tomography
- Quantum cloning
- Optimal Cloning of Pure States
- Resource-Aware Quantum Programming with General Recursion and Quantum Control
- Creating superpositions that correspond to efficiently integrable probability distributions
- Statistical Assertions for Validating Patterns and Finding Bugs in Quantum Programs
- Two qubit copying machine for economical quantum eavesdropping
- Geometrical aspects of entanglement
- On Testing Quantum Programs
- Quantum Cloning Machines of a d-level System
Cited by in corpus (7)
- Quantum Software Engineering: Roadmap and Challenges Ahead
- Analyzing Quantum Programs with LintQ: A Static Analysis Framework for Qiskit
- On the need for effective tools for debugging quantum programs
- Test Case Minimization with Quantum Annealers
- Identifying Flakiness in Quantum Programs
- The Quantum Monadology
- Bugs4Q: A Benchmark of Real Bugs for Quantum Programs