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

1. 发明授权

US09819347B2 Quantum circuit for chemistry simulation 有权
公开(公告)号：US09819347B2
公开(公告)日：2017-11-14
申请号：US15118474
申请日：2015-02-06
申请人： Microsoft Technology Licensing, LLC
发明人： Matthew Hastings , David Wecker
IPC分类号： H03K19/195 , G06N99/00
CPC分类号： H03K19/195 , B82Y10/00 , G06N99/002
摘要： Quantum circuits for chemistry simulation are based on second quantization Hamiltonian coefficients for one-body and two-body interactions. Jordan-Wigner series that conserve parity can be defined so that selected CNOT gates are removed from the associated circuits. Basis change gates such as Hadamard or Y-gates can be coupled to some or all qubits of a quantum circuit or cancelled in view of corresponding gates in adjacent circuits. In some examples, CNOT gates can be moved to different circuit locations.

2. 发明授权

US10176433B2 Training a quantum optimizer 有权
公开(公告)号：US10176433B2
公开(公告)日：2019-01-08
申请号：US15457914
申请日：2017-03-13
申请人： Microsoft Technology Licensing, LLC
发明人： Matthew Hastings , David Wecker
IPC分类号： G06F17/11 , G06N99/00 , G06N5/00
摘要： Among the embodiments disclosed herein are variants of the quantum approximate optimization algorithm with different parametrization. In particular embodiments, a different objective is used: rather than looking for a state which approximately solves an optimization problem, embodiments of the disclosed technology find a quantum algorithm that will produce a state with high overlap with the optimal state (given an instance, for example, of MAX-2-SAT). In certain embodiments, a machine learning approach is used in which a “training set” of problems is selected and the parameters optimized to produce large overlap for this training set. The problem was then tested on a larger problem set. When tested on the full set, the parameters that were found produced significantly larger overlap than optimized annealing times. Testing on other random instances (e.g., from 20 to 28 bits) continued to show improvement over annealing, with the improvement being most notable on the hardest problems. Embodiments of the disclosed technology can be used, for example, for near-term quantum computers with limited coherence times.

3. 发明授权

US10417370B2 Classical simulation constants and ordering for quantum chemistry simulation 有权
公开(公告)号：US10417370B2
公开(公告)日：2019-09-17
申请号：US15118476
申请日：2015-02-06
申请人： Microsoft Technology Licensing, LLC
发明人： Matthew Hastings , David Wecker
IPC分类号： G06F17/50 , G06N10/00 , B82Y10/00
摘要： Quantum computations based on second quantization are performed by applying one body and two body terms in a selected order. Typically, terms associated with operators that commute are applied prior to application of other terms. In a particular example, one body terms of the form hpp are applied first, followed by two body terms of the form hprrp.

4. 发明申请

US20180269906A1 MAGIC STATE DISTILLATION WITH LOW SPACE OVERHEAD AND ASYMPTOTIC INPUT COUNT 审中-公开
公开(公告)号：US20180269906A1
公开(公告)日：2018-09-20
申请号：US15627190
申请日：2017-06-19
申请人： Microsoft Technology Licensing, LLC
发明人： Jeongwan Haah , David Wecker , Matthew Hastings , David Poulin
IPC分类号： H03M13/29 , H03M13/00 , G06N99/00
CPC分类号： H03M13/2909 , G06N10/00 , H03M13/033 , H03M13/13 , H03M13/2906 , H03M13/611
摘要： Disclosed herein are example embodiments of protocols to distill magic states for T-gates. Particular examples have low space overhead and use an asymptotically optimal number of input magic states to achieve a given target error. The space overhead, defined as the ratio between the physical qubits to the number of output magic states, is asymptotically constant, while both the number of input magic states used per output state and the T-gate depth of the circuit scale linearly in the logarithm of the target error. Unlike other distillation protocols, examples of the disclosed protocol achieve this performance without concatenation and the input magic states are injected at various steps in the circuit rather than all at the start of the circuit. Embodiments of the protocol can be modified to distill magic states for other gates at the third level of the Clifford hierarchy, with the same asymptotic performance. Embodiments of the protocol rely on the construction of weakly self-dual Calderbank-Shor-Steane codes (“CSS codes”) with many logical qubits and large distance, allowing one to implement control-Swaps on multiple qubits. This code is referred to herein as the “inner code”. The control-Swaps are then used to measure properties of the magic state and detect errors, using another code that is referred to as the “outer code”. Alternatively, one can use weakly-self dual CSS codes which implement controlled Hadamards for the inner code, reducing circuit depth. Several specific small examples of this protocol are disclosed herein.

5. 发明申请

US20170179960A1 IMPROVED QUANTUM CIRCUIT FOR CHEMISTRY SIMULATION 有权
公开(公告)号：US20170179960A1
公开(公告)日：2017-06-22
申请号：US15118474
申请日：2015-02-06
申请人： Microsoft Technology Licensing, LLC
发明人： Matthew Hastings , David Wecker
IPC分类号： H03K19/195 , G06N99/00
CPC分类号： H03K19/195 , B82Y10/00 , G06N99/002
摘要： Quantum circuits for chemistry simulation are based on second quantization Hamiltonian coefficients for one-body and two-body interactions. Jordan-Wigner series that conserve parity can be defined so that selected CNOT gates are removed from the associated circuits. Basis change gates such as Hadamard or Y-gates can be coupled to some or all qubits of a quantum circuit or cancelled in view of corresponding gates in adjacent circuits. In some examples, CNOT gates can be moved to different circuit locations.

6. 发明授权

US11038537B2 Magic state distillation with low space overhead and asymptotic input count 有权
公开(公告)号：US11038537B2
公开(公告)日：2021-06-15
申请号：US16557845
申请日：2019-08-30
申请人： Microsoft Technology Licensing, LLC
发明人： Jeongwan Haah , David Wecker , Matthew Hastings , David Poulin
IPC分类号： H03M13/00 , H03M13/29 , G06N10/00 , H03M13/13 , H03M13/03
摘要： Disclosed herein are example embodiments of protocols to distill magic states for T-gates. Particular examples have low space overhead and use an asymptotically optimal number of input magic states to achieve a given target error. The space overhead, defined as the ratio between the physical qubits to the number of output magic states, is asymptotically constant, while both the number of input magic states used per output state and the T-gate depth of the circuit scale linearly in the logarithm of the target error. Unlike other distillation protocols, examples of the disclosed protocol achieve this performance without concatenation and the input magic states are injected at various steps in the circuit rather than all at the start of the circuit. Embodiments of the protocol can be modified to distill magic states for other gates at the third level of the Clifford hierarchy, with the same asymptotic performance. Embodiments of the protocol rely on the construction of weakly self-dual Calderbank-Shor-Steane codes (“CSS codes”) with many logical qubits and large distance, allowing one to implement control-Swaps on multiple qubits. This code is referred to herein as the “inner code”. The control-Swaps are then used to measure properties of the magic state and detect errors, using another code that is referred to as the “outer code”. Alternatively, one can use weakly-self dual CSS codes which implement controlled Hadamards for the inner code, reducing circuit depth. Several specific small examples of this protocol are disclosed herein.

7. 发明申请

US20190386685A1 MAGIC STATE DISTILLATION WITH LOW SPACE OVERHEAD AND ASYMPTOTIC INPUT COUNT 审中-公开
公开(公告)号：US20190386685A1
公开(公告)日：2019-12-19
申请号：US16557845
申请日：2019-08-30
申请人： Microsoft Technology Licensing, LLC
发明人： Jeongwan Haah , David Wecker , Matthew Hastings , David Poulin
IPC分类号： H03M13/29 , G06N10/00 , H03M13/00 , H03M13/13 , H03M13/03
摘要： Disclosed herein are example embodiments of protocols to distill magic states for T-gates. Particular examples have low space overhead and use an asymptotically optimal number of input magic states to achieve a given target error. The space overhead, defined as the ratio between the physical qubits to the number of output magic states, is asymptotically constant, while both the number of input magic states used per output state and the T-gate depth of the circuit scale linearly in the logarithm of the target error. Unlike other distillation protocols, examples of the disclosed protocol achieve this performance without concatenation and the input magic states are injected at various steps in the circuit rather than all at the start of the circuit. Embodiments of the protocol can be modified to distill magic states for other gates at the third level of the Clifford hierarchy, with the same asymptotic performance. Embodiments of the protocol rely on the construction of weakly self-dual Calderbank-Shor-Steane codes (“CSS codes”) with many logical qubits and large distance, allowing one to implement control-Swaps on multiple qubits. This code is referred to herein as the “inner code”. The control-Swaps are then used to measure properties of the magic state and detect errors, using another code that is referred to as the “outer code”. Alternatively, one can use weakly-self dual CSS codes which implement controlled Hadamards for the inner code, reducing circuit depth. Several specific small examples of this protocol are disclosed herein.

8. 发明授权

US10404287B2 Magic state distillation with low space overhead and asymptotic input count 有权
公开(公告)号：US10404287B2
公开(公告)日：2019-09-03
申请号：US15627190
申请日：2017-06-19
申请人： Microsoft Technology Licensing, LLC
发明人： Jeongwan Haah , David Wecker , Matthew Hastings , David Poulin
IPC分类号： H03M13/00 , H03M13/29 , G06N10/00 , H03M13/03 , H03M13/13
摘要： Disclosed herein are example embodiments of protocols to distill magic states for T-gates. Particular examples have low space overhead and use an asymptotically optimal number of input magic states to achieve a given target error. The space overhead, defined as the ratio between the physical qubits to the number of output magic states, is asymptotically constant, while both the number of input magic states used per output state and the T-gate depth of the circuit scale linearly in the logarithm of the target error. Unlike other distillation protocols, examples of the disclosed protocol achieve this performance without concatenation and the input magic states are injected at various steps in the circuit rather than all at the start of the circuit. Embodiments of the protocol can be modified to distill magic states for other gates at the third level of the Clifford hierarchy, with the same asymptotic performance. Embodiments of the protocol rely on the construction of weakly self-dual Calderbank-Shor-Steane codes (“CSS codes”) with many logical qubits and large distance, allowing one to implement control-Swaps on multiple qubits. This code is referred to herein as the “inner code”. The control-Swaps are then used to measure properties of the magic state and detect errors, using another code that is referred to as the “outer code”. Alternatively, one can use weakly-self dual CSS codes which implement controlled Hadamards for the inner code, reducing circuit depth. Several specific small examples of this protocol are disclosed herein.

9. 发明申请

US20170330101A1 TRAINING A QUANTUM OPTIMIZER 审中-公开
公开(公告)号：US20170330101A1
公开(公告)日：2017-11-16
申请号：US15457914
申请日：2017-03-13
申请人： Microsoft Technology Licensing, LLC
发明人： Matthew Hastings , David Wecker
IPC分类号： G06N99/00
CPC分类号： G06N99/002 , G06N5/006 , G06N99/005
摘要： Among the embodiments disclosed herein are variants of the quantum approximate optimization algorithm with different parametrization. In particular embodiments, a different objective is used: rather than looking for a state which approximately solves an optimization problem, embodiments of the disclosed technology find a quantum algorithm that will produce a state with high overlap with the optimal state (given an instance, for example, of MAX-2-SAT). In certain embodiments, a machine learning approach is used in which a “training set” of problems is selected and the parameters optimized to produce large overlap for this training set. The problem was then tested on a larger problem set. When tested on the full set, the parameters that were found produced significantly larger overlap than optimized annealing times. Testing on other random instances (e.g., from 20 to 28 bits) continued to show improvement over annealing, with the improvement being most notable on the hardest problems. Embodiments of the disclosed technology can be used, for example, for near-term quantum computers with limited coherence times.

10. 发明申请

US20170177782A1 CLASSICAL SIMULATION CONSTANTS AND ORDERING FOR QUANTUM CHEMISTRY SIMULATION 审中-公开
公开(公告)号：US20170177782A1
公开(公告)日：2017-06-22
申请号：US15118476
申请日：2015-02-06
申请人： Microsoft Technology Licensing, LLC
发明人： Matthew Hastings , David Wecker
IPC分类号： G06F17/50 , G06N99/00
CPC分类号： G06F17/5077 , B82Y10/00 , G06N10/00
摘要： Quantum computations based on second quantization are performed by applying one body and two body terms in a selected order. Typically, terms associated with operators that commute are applied prior to application of other terms. In a particular example, one body terms of the form hpp are applied first, followed by two body terms of the form hprrp.

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式