We introduce InfoCommit, a protocol for polynomial commitment and verification. InfoCommit consists of two phases. An initial commitment phase and an evaluation phase. During the commitment phase, the verifier and the prover engage in a private two-party computation algorithm so that the verifier extracts a private verification key. In the evaluation phase, the verifier is interested in learning the evaluations of the polynomial at several input points. InfoCommit has four main features. Firstly, the verifier is able to detect, with high probability, if the prover has responded with evaluations of the same polynomial that he has initially committed to. Secondly, InfoCommit provides rigorous privacy guarantees for the prover: upon observing the initial commitment and the response provided by the prover to m evaluation requests, the verifier only learns O(m2) symbols about the coefficients of the polynomial. Thirdly, the verifiability guarantee is unconditional and without the need for a trusted party, while bounded storage is the only assumption underlying the privacy of the algorithm. In particular, both properties hold regardless of the computation power of the two parties. Lastly, InfoCommit is doubly-efficient in the sense that in the evaluation phase, the verifier runs in O(d) and the prover runs in O(d), where d−1 is the degree of the polynomial.
Molecular conical intersection of odd-electron number are known to give arise to non-abelian geometric phases. In this work, we present a simple algorithm for evaluating the SU(2) geometric phases given a trajectory represented as a discrete set of coordinates in the five-dimensional branching space. Motivated by the special property that such conical intersection behaves as abelian ones in three-dimensional subspace, we take two steps to establish the algorithm. We first prove that it is possible to construct an augmented trajectory consisting of spherical triangles that has the same geometric phases as the original trajectory. We then prove that the geometric phase contribution from each spherical triangle can be evaluated from its properties using Stokes' theorem in a way that closely resembles abelian conical intersections. The total geometric phases are thus evaluated by path-ordered products of contributions from each spherical triangle. Based on the augmented trajectory, we further show that the geometric phases of the upper and lower states will switch under inversion transformation of the trajectory. This relation is further generalized to show that the Wilson loop, defined as the trace of the geometric phases, will switch between the two states under any five-dimensional improper isometric transformation. Example calculations of geometric phases for trajectories generated on five-dimensional polytopes are also presented and discussed.
We adapt the robust phase estimation algorithm to the evaluation of energy differences between two eigenstates using a quantum computer. This approach does not require controlled unitaries between auxiliary and system registers or even a single auxiliary qubit. As a proof of concept, we calculate the energies of the ground state and low-lying electronic excitations of a hydrogen molecule in a minimal basis on a cloud quantum computer. The denominative robustness of our approach is then quantified in terms of a high tolerance to coherent errors in the state preparation and measurement. Conceptually, we note that all quantum phase estimation algorithms ultimately evaluate eigenvalue differences.