Home Patent Forecast® Sectors Log In   Contact  
How it works Patent Forecast® Sectors Insights
Menu
Enjoy your FREE PREVIEW which shows only 2022 data and 25 documents. Contact Patent Forecast for full access.        

Quantum Computing

Search All Patents in Quantum Computing


Patent US10242321


Issued 2019-03-26

Efficient Synthesis Of Repeat-until-success Circuits In Clifford + T Basis

Repeat-Until-Success (RUS) circuits are compiled in a Clifford+T basis by selecting a suitable cyclotomic integer approximation of a target rotation so that the rotation is approximated within a predetermined precision. The cyclotomic integer approximation is randomly modified until a modified value can be expanded into a single-qubit unitary matrix by solving one or more norm equations. The matrix is then expanded into a two-qubit unitary matrix of special form, which is then decomposed into an optimal two-qubit Clifford+T circuit. A two-qubit RUS circuit using a primary qubit and an ancillary qubit is then obtained based on the latter decomposition. An alternate embodiment is disclosed that keeps the total T-depth of the derived circuit small using at most 3 additional ancilla qubits. Arbitrary unitary matrices defined over the cyclotomic field of 8th roots of unity are implemented with RUS circuits.



Much More than Average Length Specification


View the Patent Matrix® Diagram to Explore the Claim Relationships

USPTO Full Text Publication >

1 Independent Claim

  • 1. A method of defining a quantum circuit, comprising: establishing a rational cyclotomic approximation of a target single-qubit unitary to a requested precision; expanding the rational cyclotomic approximation into a multi-qubit unitary that implements the target single-qubit unitary upon successful measurement; decomposing the multi-qubit unitary into a Clifford+T circuit; and defining a Repeat-Until-Success (RUS) circuit based on the decomposition.