Exact universality from any entangling gate without inverses

TL;DR

This paper proves that any entangling bipartite gate combined with local gates is sufficient for universal quantum computation without needing the inverse of the entangling gate, extending previous results.

Contribution

It establishes exact universality using any entangling gate without requiring its inverse, unlike prior work that needed either the inverse or only approximate universality.

Findings

Any entangling bipartite gate with local gates is universal.

Universal quantum computation can be achieved without inverses of entangling gates.

Previous constraints requiring inverses or approximation are relaxed.

Abstract

This note proves that arbitrary local gates together with any entangling bipartite gate V are universal. Previously this was known only when access to both V and V^{-1} was given, or when approximate universality was demanded.