US 11,755,682 B2
Evaluating quantum computing circuits in view of the resource costs of a quantum algorithm
Thomas Haener, Zurich (CH); Martin H. Roetteler, Woodinville, WA (US); and Krysta M. Svore, Seattle, WA (US)
Assigned to Microsoft Technology Licensing, LLC, Redmond, WA (US)
Filed by Microsoft Technology Licensing, LLC, Redmond, WA (US)
Filed on Jun. 29, 2018, as Appl. No. 16/22,914.
Claims priority of provisional application 62/676,539, filed on May 25, 2018.
Prior Publication US 2019/0361675 A1, Nov. 28, 2019
Int. Cl. G06F 17/11 (2006.01); G06N 10/00 (2022.01); G06N 10/60 (2022.01)
CPC G06F 17/11 (2013.01) [G06N 10/00 (2019.01); G06N 10/60 (2022.01)] 20 Claims
OG exemplary drawing
 
1. A processor-implemented method for compiling a quantum circuit for performing an evaluation of a polynomial, the method comprising:
receiving an input comprising a polynomial function and a set of sub-intervals;
partitioning the polynomial function into the set of sub-intervals by determining whether an input value of the polynomial function falls into any of the set of sub-intervals;
computing a label register having at least one label indicative of at least one of the set of sub-intervals;
determining a polynomial interpolation for the set of sub-intervals corresponding to the input; and
using the processor generating an output including the quantum circuit to a quantum processor for execution,
wherein the quantum circuit comprises a label gate for initializing the label register and quantum gates for performing, in parallel, polynomial evaluation corresponding to each of the set of sub-intervals.