IP Library Granted Patent US 11,010,682
Granted Patent B2
US 11,010,682 · App. 15/510,668 · Granted May 18, 2021

Efficient synthesis of probabilistic quantum circuits with fallback

Inventors: Alexei Bocharov (Redmond, WA); Krysta Svore (Seattle, WA); Martin Roetteler (Woodinville, WA)
Assignee: Microsoft Technology Licensing, LLC
G06N10/00B82Y10/00G06F17/10G06F30/00G06N99/00Y10S977/933
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 11,010,682
App. No.
15/510,668
Granted
May 18, 2021
Kind
B2
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 b (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.

Claims (39)

1. A computer-implemented method, comprising:

with a computer:

establishing a first approximation of a target unitary to a requested precision;

expanding the first approximation into a first multi-qubit unitary that implements the target unitary in a selected basis upon successful measurement;

defining a fallback circuit in the selected basis, wherein the fallback circuit implements the target unitary based upon an unsuccessful measurement;

storing a circuit definition that includes a definition of the first multi-qubit unitary and a definition of the fallback circuit in a computer-readable storage device; and

implementing a quantum circuit that includes the fallback circuit and a circuit implementing the first multi-qubit unitary.

2. The computer-implemented method of claim 1 , wherein the target unitary is a multi-qubit unitary, and further comprising:

establishing a second approximation of the target unitary to a requested precision based on an unsuccessful output of the first multi-qubit unitary; and

expanding the second approximation into a second multi-qubit unitary that implements the target unitary in the selected basis upon successful measurement, wherein the fallback circuit implements the target unitary based upon an unsuccessful measurement associated with the second multi-qubit unitary.

3. The computer-implemented method of claim 2 , wherein the target unitary is of the form

1

2

L

(

rz

y

-

y

*

r

*

z

*

)

,

wherein z is a cyclotomic rational, r is a probability enhancement factor, and L is a minimal positive integer such that 2 L >|r z| 2 .

4. The computer-implemented method of claim 3 , further comprising selecting a value r ∈Z[√{square root over (2)}] such that a norm equation is solvable for z replaced by rz.

5. The computer-implemented method of claim 1 , further comprising:

establishing a series of approximations of the target unitary to a requested precision based on an unsuccessful measurement of a multi-qubit unitary associated with a prior approximation in the series; and

expanding the series of approximations into a corresponding series of multi-qubit unitaries that implement the target unitary in the selected basis upon successful measurement, wherein the fallback circuit implements the target unitary based upon an unsuccessful measurement associated with a final multi-qubit unitary in the series.

6. The computer-implemented method of claim 1 , wherein the approximation of the target unitary is based on a rational cyclotomic approximation of the target unitary.

7. The computer-implemented method of claim 6 , further comprising establishing the rational cyclotomic approximation of the target unitary by solving a norm equation.

8. The computer-implemented method of claim 1 , wherein the target unitary is an axial rotation and is approximated by z*/z wherein z is a cyclotomic integer.

9. The computer-implemented method of claim 1 , wherein the multi-qubit unitary is defined with respect to at least one ancillary qubit and at least one primary qubit.

10. The computer-implemented method of claim 1 , wherein the first multi-qubit unitary is coupled to at least one ancillary qubit having a predetermined state.

11. The computer-implemented method of claim 10 , wherein the at least one ancillary qubit is used in each of a plurality of probabilistic quantum circuits with fallback (PQF) stages associated with different multi-qubit unitaries and measurements associated with at least one of the PQF stages.

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 23, 2018
From: BOCHAROV, ALEXEI; SVORE, KRYSTA; ROETTELER, MARTIN
To: MICROSOFT CORPORATION
Reel/Frame 046678/0464 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 23, 2018
From: MICROSOFT CORPORATION
To: MICROSOFT TECHNOLOGY LICENSING, LLC
Reel/Frame 046678/0523 →