Robert Rand (University of Chicago) |
Aarthi Sundaram (Microsoft Quantum) |
Kartik Singhal (University of Chicago) |
Brad Lackey (Microsoft Quantum and University of Maryland) |
The Heisenberg representation of quantum operators provides a powerful technique for reasoning about quantum circuits, albeit those restricted to the common (non-universal) Clifford set H, S and CNOT. The Gottesman-Knill theorem showed that we can use this representation to efficiently simulate Clifford circuits. We show that Gottesman's semantics for quantum programs can be treated as a type system, allowing us to efficiently characterize a common subset of quantum programs. We also show that it can be extended beyond the Clifford set to partially characterize a broad range of programs. We apply these types to reason about separable states and the superdense coding algorithm. |
ArXived at: https://dx.doi.org/10.4204/EPTCS.340.14 | bibtex | |
Comments and questions to: eptcs@eptcs.org |
For website issues: webmaster@eptcs.org |