![]() more » Even when traditional tools run at scale, the approach wastes substantial effort and computation cycles. ![]() Programmers must reproduce problems in smaller runs to analyze them with traditional tools, or else perform repeated runs at scale using only primitive techniques. This paradigm breaks down beyond a few thousand cores, yet bugs often arise above that scale. Currently, many DOE application developers use primitive manual debugging based on printf or traditional debuggers such as TotalView or DDT. Scalable correctness tools are critical to shorten the time-to-solution on these systems. These large systems create unprecedented application development challenges. = ) processing cores are driving advancements in a wide range of scientific disciplines. By leveraging our framework, one can significantly reduce the effects of human errors and obtain a high-assurance implementation of large-scale quantum applications in more » a principled way. As a demonstration of the feasibility of applying formal methods to quantum programming, we present a formally certified end-to-end implementation of Shor’s prime factorization algorithm, developed as part of a framework for applying the certified approach to general applications. The proof’s validity is automatically confirmed-certified-by a “proof assistant.” Formal methods have successfully yielded high-assurance classical software artifacts, and the underlying technology has produced certified proofs of major mathematical theorems. With such methods, a programmer writes a mathematical specification alongside the program and semiautomatically proves the program correct with respect to it. To address this problem, we have been working to adapt formal methods to quantum programming. While hardware-level decoherence errors have garnered significant attention, a less recognized obstacle to correctness is that of human programming errors-“bugs.” Techniques familiar to most programmers from the classical domain for avoiding, discovering, and diagnosing bugs do not easily transfer, at scale, to the quantum domain because of its unique characteristics. Quantum computing technology may soon deliver revolutionary improvements in algorithmic performance, but it is useful only if computed answers are correct.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |