The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.

The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.

Date of Patent:
May. 18, 2021

Filed:

Sep. 11, 2015
Applicant:

Microsoft Technology Licensing, Llc, Redmond, WA (US);

Inventors:

Alexei Bocharov, Redmond, WA (US);

Krysta Svore, Seattle, WA (US);

Martin Roetteler, Woodinville, WA (US);

Assignee:
Attorney:
Primary Examiner:
Int. Cl.
CPC ...
G06N 99/00 (2019.01); B82Y 10/00 (2011.01); G06F 17/10 (2006.01); G06N 10/00 (2019.01); G06F 30/00 (2020.01);
U.S. Cl.
CPC ...
G06N 10/00 (2019.01); B82Y 10/00 (2013.01); G06F 17/10 (2013.01); G06F 30/00 (2020.01); G06N 99/00 (2013.01); Y10S 977/933 (2013.01);
Abstract

A Probabilistic Quantum Circuit with Fallback (PQFs) is composed as a series of circuit stages that are selected to implement a target unitary. A final stage is conditioned on unsuccessful results of all the preceding stages as indicated by measurement of one or more ancillary qubits. This final stage executes a fallback circuit that enforces deterministic execution of the target unitary at a relatively high cost (mitigated by very low probability of the fallback). Specific instances of general PQF synthesis method and are disclosed with reference to the specific Clifford+T, Clifford+V and Clifford+π/12 bases. The resulting circuits have expected cost in log(1/ε)+O(log(log(1/ε)))+const wherein b is specific to each basis. The three specific instances of the synthesis have polynomial compilation time guarantees.


Find Patent Forward Citations

Loading…