Log in
Enquire now
‌

US Patent 11010682 Efficient synthesis of probabilistic quantum circuits with fallback

Patent 11010682 was granted and assigned to Microsoft on May, 2021 by the United States Patent and Trademark Office.

OverviewStructured DataIssuesContributors

Contents

Is a
Patent
Patent

Patent attributes

Patent Applicant
Microsoft
Microsoft
Current Assignee
Microsoft
Microsoft
Patent Jurisdiction
United States Patent and Trademark Office
United States Patent and Trademark Office
Patent Number
11010682
Patent Inventor Names
Martin Roetteler0
Alexei Bocharov0
Krysta Svore0
Date of Patent
May 18, 2021
Patent Application Number
15510668
Date Filed
September 11, 2015
Patent Citations
‌
US Patent 10430162 Quantum resource estimates for computing elliptic curve discrete logarithms
‌
US Patent 10366339 Method for efficient implementation of diagonal operators over clifford+T basis
0
Patent Citations Received
‌
US Patent 11488049 Hybrid quantum-classical computer system and method for optimization
‌
US Patent 11507872 Hybrid quantum-classical computer system and method for performing function inversion
‌
US Patent 11537928 Quantum-classical system and method for matrix computations
‌
US Patent 11681774 Classically-boosted quantum optimization
0
Patent Primary Examiner
‌
Victoria K. Hall
Patent 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 logb(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.

Timeline

No Timeline data yet.

Further Resources

Title
Author
Link
Type
Date
No Further Resources data yet.

References

Find more entities like US Patent 11010682 Efficient synthesis of probabilistic quantum circuits with fallback

Use the Golden Query Tool to find similar entities by any field in the Knowledge Graph, including industry, location, and more.
Open Query Tool
Access by API
Golden Query Tool
Golden logo

Company

  • Home
  • Press & Media
  • Blog
  • Careers
  • WE'RE HIRING

Products

  • Knowledge Graph
  • Query Tool
  • Data Requests
  • Knowledge Storage
  • API
  • Pricing
  • Enterprise
  • ChatGPT Plugin

Legal

  • Terms of Service
  • Enterprise Terms of Service
  • Privacy Policy

Help

  • Help center
  • API Documentation
  • Contact Us