Related papers: Verifying Quantum Phase Estimation (QPE) using Pro…
We define the concept of collaborative theorem proving and outline our plan to make it a reality. We believe that a successful implementation of collaborative theorem proving is a necessary prerequisite for the formal verification of large…
We present a verifier of quantum programs called AutoQ 2.0. Quantum programs extend quantum circuits (the domain of AutoQ 1.0) by classical control flow constructs, which enable users to describe advanced quantum algorithms in a formal and…
Formal methods have been a successful approach for modelling and verifying the correctness of complex technologies like microprocessor chip design, biological systems and others. This is the main motivation of developing quantum formal…
Self-tested quantum information processing provides a means for doing useful information processing with untrusted quantum apparatus. Previous work was limited to performing computations and protocols in real Hilbert spaces, which is not a…
Quantum computers promise to efficiently solve not only problems believed to be intractable for classical computers, but also problems for which verifying the solution is also considered intractable. This raises the question of how one can…
Achieving quantum computational advantage requires solving a classically intractable problem on a quantum device. Natural proposals rely upon the intrinsic hardness of classically simulating quantum mechanics; however, verifying the output…
Infinite-state systems such as distributed protocols are challenging to verify using interactive theorem provers or automatic verification tools. Of these techniques, deductive verification is highly expressive but requires the user to…
It has been demonstrated that the critical point of the phase transition in scalar quantum field theory with a quartic interaction in one space dimension can be approximated via a Gaussian Effective Potential (GEP). We discuss how this…
Quantum phase estimation algorithm (PEA) is one of the most important algorithms in early studies of quantum computation. It is also a key for many other quantum algorithms, such as the quantum counting algorithm and the Shor's integer…
In this paper, we propose Proq, a runtime assertion scheme for testing and debugging quantum programs on a quantum computer. The predicates in Proq are represented by projections (or equivalently, closed subspaces of the state space),…
This is a set of lecture notes used in a graduate topic class in applied mathematics called ``Quantum Algorithms for Scientific Computation'' at the Department of Mathematics, UC Berkeley during the fall semester of 2021. These lecture…
Developing intuition about quantum information theory problems is difficult, as is verifying or ruling-out of hypothesis. We present a Matlab package intended to provide the QIT community with a new and powerful tool-set for quantum…
This tutorial introduces quantum computing with a focus on the applicability of formal methods in this relatively new domain. We describe quantum circuits and convey an understanding of their inherent combinatorial nature and the…
We present a physical scheme for implementing quantum phase estimation via weakly coupled double quantum-dot molecules embedded in a microcavity. During the same process of implementation, we can also realize the calibration of a timepiece…
A reliable method for characterizing quantum operations that is suitable for improving and validating their accuracies is indispensable for realizing a practical quantum computer. Known methods are still not sufficient because they lack…
Quantum tomography is the main method used to assess the quality of quantum information processing devices, but its complexity presents a major obstacle for the characterization of even moderately large systems. The number of experimental…
Quantum computing has proven to be capable of accelerating many algorithms by performing tasks that classical computers cannot. Currently, Noisy Intermediate Scale Quantum (NISQ) machines struggle from scalability and noise issues to render…
Quantum error correction (QEC) is fundamental for suppressing noise in quantum hardware and enabling fault-tolerant quantum computation. In this paper, we propose an efficient verification framework for QEC programs. We define an assertion…
Quantum Phase Estimation (QPE), the quantum algorithm for estimating eigenvalues of a given Hermitian matrix and preparing its eigenvectors, is considered the most promising approach to finding the ground states and their energies of…
Interactive proof assistants are computer programs carefully constructed to check a human-designed proof of a mathematical claim with high confidence in the implementation. However, this only validates truth of a formal claim, which may…