Quantum Technologies: a Short Note

Alexander Wilce

A slightly revised version of notes distributed during a short course on GPTs, given at the Perimeter Institute for Theoretical Physics in March and April of 2024.

Rainer Müller, Franziska Greinert

Harry Buhrman

This note shows that Shor's algorithm for factoring in polynomial time on a quantum computer can be made to work with zero error probability.

K.J. Vahala

Reza Rajaei

In this short note, we present a proof of a relatively expected result in a convex-optimization problem. In fact, we will show that a matrix at which the maximum of the SWAP fidelity is achieved has determinant zero.