Title: A formally certified end-to-end implementation of Shor’s factorization algorithm

Journal Article · · Proceedings of the National Academy of Sciences of the United States of America
ORCiD logo [1]; ORCiD logo [2];  [3];  [1]; ORCiD logo [4]; ORCiD logo [1];  [1]
  1. Department of Computer Science, University of Maryland, College Park, MD 20740, Joint Center for Quantum Information and Computer Science, University of Maryland, College Park, MD 20740
  2. Department of Computer Science, University of Maryland, College Park, MD 20740
  3. Department of Computer Science, Columbia University, New York, NY 10027
  4. Department of Computer Science, University of Chicago, Chicago, IL 60637

Quantum computing technology may soon deliver revolutionary improvements in algorithmic performance, but it is useful only if computed answers are correct. 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. To address this problem, we have been working to adapt formal methods to quantum programming. With such methods, a programmer writes a mathematical specification alongside the program and semiautomatically proves the program correct with respect to it. 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. 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. 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 a principled way.

Research Organization:
Univ. of Maryland, College Park, MD (United States)
Sponsoring Organization:
USDOE; USDOE Office of Science (SC)
Grant/Contract Number:
SC0019040
OSTI ID:
1973705
Journal Information:
Proceedings of the National Academy of Sciences of the United States of America, Journal Name: Proceedings of the National Academy of Sciences of the United States of America Journal Issue: 21 Vol. 120; ISSN 0027-8424
Publisher:
Proceedings of the National Academy of SciencesCopyright Statement
Country of Publication:
United States
Language:
English

References (25)

Formal Verification of Quantum Algorithms Using Quantum Hoare Logic book January 2019
An Automated Deductive Verification Framework for Circuit-building Quantum Programs book March 2021
Why3 — Where Programs Meet Provers book January 2013
Certified Quantum Computation in Isabelle/HOL journal December 2020
Experimental realization of Shor's quantum factoring algorithm using nuclear magnetic resonance journal December 2001
Mathematicians welcome computer-assisted proof in ‘grand unification’ theory journal June 2021
Roads towards fault-tolerant universal quantum computation journal September 2017
Experimental realization of Shor's quantum factoring algorithm using qubit recycling journal October 2012
Functionality in Combinatory Logic journal November 1934
Five stages of accepting constructive mathematics journal October 2016
Quantum error correction for quantum memories journal April 2015
A Coincidence-Based Test for Uniformity Given Very Sparsely Sampled Discrete Data journal October 2008
Universal Quantum Simulators journal August 1996
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer journal October 1997
Formal verification of a realistic compiler journal July 2009
seL4 conference October 2009
Finding and understanding bugs in C compilers conference January 2011
A fast quantum mechanical algorithm for database search conference January 1996
QWIRE: a core language for quantum circuits conference January 2017
Quantum relational Hoare logic journal January 2019
A verified optimizer for Quantum circuits journal January 2021
Social processes and proofs of theorems and programs journal May 1979
The verifying compiler journal January 2003
Formalization of Quantum Protocols using Coq journal November 2015
QWIRE Practice: Formal Verification of Quantum Circuits in Coq journal February 2018

Similar Records

Effects of dynamical phases in Shor's factoring algorithm with operational delays
Journal Article · 2005 · Physical Review. A · OSTI ID:20650062

Quantum computation and Shor{close_quote}s factoring algorithm
Journal Article · 1996 · Reviews of Modern Physics · OSTI ID:287011

A Compact Code for Simulations of Quantum Error Correction in Classical Computers
Journal Article · 2009 · AIP Conference Proceedings · OSTI ID:21293354