专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US10430162B2 Quantum resource estimates for computing elliptic curve discrete logarithms 有权
公开(公告)号：US10430162B2
公开(公告)日：2019-10-01
申请号：US15669929
申请日：2017-08-05
申请人： Microsoft Technology Licensing, LLC
发明人： Martin Roetteler , Kristin Lauter , Krysta Svore
IPC分类号： G06F7/72 , G06N10/00 , G06F17/50
摘要： In this application, example methods for performing quantum Montgomery arithmetic are disclosed. Additionally, circuit implementations are disclosed for reversible modular arithmetic, including modular addition, multiplication and inversion, as well as reversible elliptic curve point addition. This application also shows that elliptic curve discrete logarithms on an elliptic curve defined over an n-bit prime field can be computed on a quantum computer with at most 9n+2┌log2(n)┐+10 qubits using a quantum circuit of at most 512n3 log2(n)+3572n3 Toffoli gates.

2. 发明授权

US10423887B2 Compilation, memory management, and fault localization with ancillas in an unknown state 有权
公开(公告)号：US10423887B2
公开(公告)日：2019-09-24
申请号：US15640108
申请日：2017-06-30
申请人： Microsoft Technology Licensing, LLC
发明人： Martin Roetteler , Krysta Svore , Thomas Haener
IPC分类号： G06F7/00 , G06N10/00 , G06F17/10 , B82Y10/00 , H03M13/29 , H03K19/20
摘要： Among the embodiments disclosed herein are quantum circuits (and associated compilation techniques) for performing Shor's quantum algorithm to factor n-bit integers. Example embodiments of the circuits use only 2n+2 qubits. In contrast to previous space-optimized implementations, embodiments of the disclosed technology feature a purely Toffoli-based modular multiplication circuit. Certain other example modular multiplication circuits disclosed herein are based on an (in-place) constant-adder that uses dirty ancilla qubits to achieve a size in (n log n) and a depth in (n).

3. 发明申请

US20170032272A1 EFFICIENT SYNTHESIS OF REPEAT-UNTIL-SUCCESS CIRCUITS IN CLIFFORD + T BASIS 审中-公开
标题翻译： CLIFFORD + T BASIS中重复成功电路的有效综合
公开(公告)号：US20170032272A1
公开(公告)日：2017-02-02
申请号：US15302887
申请日：2015-04-01
申请人： Microsoft Technology Licensing, LLC
发明人： Alexei Bocharov , Krysta M. Svore , Martin Roetteler
IPC分类号： G06N99/00 , G06F17/16
CPC分类号： G06N99/002 , B82Y10/00 , G06F17/16
摘要： 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.
摘要翻译：通过选择目标旋转的合适的循环整数近似来使得重复 - 直到成功（RUS）电路以Clifford + T编译，使得旋转在预定精度内近似。随机修改循环整数近似值，直到通过求解一个或多个范数方程将修正后的值扩展为单量子位酉矩阵。然后将矩阵扩展为特殊形式的双量子单位矩阵，然后将其分解为最佳双量子Clifford + T电路。然后基于后者的分解获得使用主量子位和辅助量子位的双量子位RUS电路。公开了一种替代实施例，其使用至多3个额外的辅助量子比特来保持导出电路的总T深度较小。使用RUS电路实现了第8个单位的循环场定义的任意酉矩阵。

4. 发明授权

US11580434B2 Automatic accuracy management for quantum programs via symbolic resource estimation 有权
公开(公告)号：US11580434B2
公开(公告)日：2023-02-14
申请号：US16843733
申请日：2020-04-08
申请人： Microsoft Technology Licensing, LLC
发明人： Thomas Haener , Giulia Meuli , Martin Roetteler
IPC分类号： G06N10/00 , G06F11/07 , G06F8/30
摘要： Embodiments of the disclosed technology concern transforming a high-level quantum-computer program to one or more symbolic expressions. Because the transformations lead to symbolic expressions in the compiled code, one can extract these to arrive at symbolic resource estimates for the quantum program. In cases where these transformations do not yield closed-form solutions, they can still be evaluated many orders of magnitude faster than it was possible using other resource estimation tools. Having access to such symbolic or near-symbolic expressions not only greatly improves the performance of accuracy management and resource estimation, but also better informs quantum software developers of the bottlenecks that may be present in the quantum program. In turn, the underlying quantum-computer program can be improved as appropriate.

5. 发明申请

US20210256416A1 TRAINING OF VARIATIONAL QUANTUM CLASSIFIERS BY PARAMETRIC COORDINATE ASCENT 有权
公开(公告)号：US20210256416A1
公开(公告)日：2021-08-19
申请号：US16790363
申请日：2020-02-13
申请人： Microsoft Technology Licensing, LLC
发明人： Alexei Bocharov , Martin Roetteler
IPC分类号： G06N20/00 , G06N5/04 , G06N10/00
摘要： Embodiments of the disclosed technology employ parametric coordinate ascent to train a quantum circuit. In certain implementations, parameters (e.g., variational parameters) are learned by coordinate ascent using closed form equations. This strategy helps ensure monotonic convergence to local maxima in parameter space at predictable convergence rates and eliminates the overhead due to hyperparameter sweeps.

6. 发明授权

US11010682B2 Efficient synthesis of probabilistic quantum circuits with fallback 有权
公开(公告)号：US11010682B2
公开(公告)日：2021-05-18
申请号：US15510668
申请日：2015-09-11
申请人： Microsoft Technology Licensing, LLC
发明人： Alexei Bocharov , Krysta Svore , Martin Roetteler
IPC分类号： G06N99/00 , B82Y10/00 , G06F17/10 , G06N10/00 , G06F30/00
摘要： 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.

7. 发明申请

US20210117844A1 AUTOMATIC ACCURACY MANAGEMENT FOR QUANTUM PROGRAMS VIA SYMBOLIC RESOURCE ESTIMATION 有权
公开(公告)号：US20210117844A1
公开(公告)日：2021-04-22
申请号：US16843733
申请日：2020-04-08
申请人： Microsoft Technology Licensing, LLC
发明人： Thomas Haener , Giulia Meuli , Martin Roetteler
IPC分类号： G06N10/00 , G06F8/30 , G06F11/07
摘要： Embodiments of the disclosed technology concern transforming a high-level quantum-computer program to one or more symbolic expressions. Because the transformations lead to symbolic expressions in the compiled code, one can extract these to arrive at symbolic resource estimates for the quantum program. In cases where these transformations do not yield closed-form solutions, they can still be evaluated many orders of magnitude faster than it was possible using other resource estimation tools. Having access to such symbolic or near-symbolic expressions not only greatly improves the performance of accuracy management and resource estimation, but also better informs quantum software developers of the bottlenecks that may be present in the quantum program. In turn, the underlying quantum-computer program can be improved as appropriate.

8. 发明授权

US10860759B2 System for reversible circuit compilation with space constraint, method and program 有权
公开(公告)号：US10860759B2
公开(公告)日：2020-12-08
申请号：US15735102
申请日：2016-06-07
申请人： Microsoft Technology Licensing, LLC
发明人： Martin Roetteler , Krysta Svore , Alex Parent
IPC分类号： G06F30/327 , G06N10/00
摘要： The disclosed technology includes, among other innovations, a framework for resource efficient compilation of higher-level programs into lower-level reversible circuits. In particular embodiments, the disclosed technology reduces the memory footprint of a reversible network implemented in a quantum computer and generated from a higher-level program. Such a reduced-memory footprint is desirable in that it addresses the limited availability of qubits available in many target quantum computer architectures.

9. 发明申请

US20180276014A1 METHOD AND SYSTEM FOR APPROXIMATE QUANTUM CIRCUIT SYNTHESIS USING QUATERNION ALGEBRA 审中-公开
公开(公告)号：US20180276014A1
公开(公告)日：2018-09-27
申请号：US15761836
申请日：2016-09-26
申请人： Microsoft Technology Licensing, LLC
发明人： Vadym Kliuchnikov , Jon Yard , Martin Roetteler , Alexei Bocharov
IPC分类号： G06F9/455 , G06N99/00
CPC分类号： G06F9/45508 , G06N10/00
摘要： This application concerns methods, apparatus, and systems for performing quantum circuit synthesis and/or for implementing the synthesis results in a quantum computer system. In certain example embodiments: a universal gate set, a target unitary described by a target angle, and target precision is received (input); a corresponding quaternion approximation of the target unitary is determined; and a quantum circuit corresponding to the quaternion approximation is synthesized, the quantum circuit being over a single qubit gate set, the single qubit gate set being realizable by the given universal gate set for the target quantum computer architecture.

10. 发明申请

US20180144262A1 COMPILATION, MEMORY MANAGEMENT, AND FAULT LOCALIZATION WITH ANCILLAS IN AN UNKNOWN STATE 有权
公开(公告)号：US20180144262A1
公开(公告)日：2018-05-24
申请号：US15640108
申请日：2017-06-30
申请人： Microsoft Technology Licensing, LLC
发明人： Martin Roetteler , Krysta Svore , Thomas Haener
IPC分类号： G06N99/00 , G06F17/10 , B82Y10/00 , H03M13/29 , H03K19/20
摘要： Among the embodiments disclosed herein are quantum circuits (and associated compilation techniques) for performing Shor's quantum algorithm to factor n-bit integers. Example embodiments of the circuits use only 2n+2 qubits. In contrast to previous space-optimized implementations, embodiments of the disclosed technology feature a purely Toffoli-based modular multiplication circuit. Certain other example modular multiplication circuits disclosed herein are based on an (in-place) constant-adder that uses dirty ancilla qubits to achieve a size in (n log n) and a depth in (n).

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式