Patents by Inventor David Poulin
David Poulin has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 11694103Abstract: Example circuit implementations of Szegedy's quantization of the Metropolis-Hastings walk are presented. In certain disclosed embodiments, a quantum walk procedure of a Markov chain Monte Carlo simulation is implemented in which a quantum move register is reset at every step in the quantum walk. In further embodiments, a quantum walk procedure of a Markov chain Monte Carlo simulation is implemented in which an underlying classical walk is obtained using a Metropolis-Hastings rotation or a Glauber dynamics rotation. In some embodiments, a quantum walk procedure is performed in the quantum computing device to implement a Markov Chain Monte Carlo method; during the quantum walk procedure, an intermediate measurement is obtained; and a rewinding procedure of one or more but not all steps of the quantum walk procedure is performed if the intermediate measurement produces an incorrect outcome.Type: GrantFiled: August 2, 2019Date of Patent: July 4, 2023Assignee: Microsoft Technology Licensing, LLCInventors: Matthias Troyer, David Poulin, Bettina Heim, Jessica Lemieux
-
Patent number: 11336300Abstract: A method for determining the n best positions of frozen bits in a channel decoder for a noisy communication channel. A decoding method and decoding processing unit for implementing the channel having frozen bits at the n worst positions. A method and system that iteratively, for each bit i from the n bits, determines a probability vector for the bit i by traversing a logical graph using contraction identities simplified to specific values, indexes the specific values from the contraction identities newly computed during the determination of the probability vector for subsequent reference during a following iteration based on corresponding contraction identities, fixes the bit i from the probability vector and moving to bit i+1 until all n bits are fixed.Type: GrantFiled: March 5, 2018Date of Patent: May 17, 2022Assignee: SOCPRA SCIENCES ET GÉNIE S.E.CInventors: David Poulin, Andrew J. Ferris
-
Patent number: 11038537Abstract: 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.Type: GrantFiled: August 30, 2019Date of Patent: June 15, 2021Assignee: Microsoft Technology Licensing, LLCInventors: Jeongwan Haah, David Wecker, Matthew Hastings, David Poulin
-
Publication number: 20200090072Abstract: Example circuit implementations of Szegedy's quantization of the Metropolis-Hastings walk are presented. In certain disclosed embodiments, a quantum walk procedure of a Markov chain Monte Carlo simulation is implemented in which a quantum move register is reset at every step in the quantum walk. In further embodiments, a quantum walk procedure of a Markov chain Monte Carlo simulation is implemented in which an underlying classical walk is obtained using a Metropolis-Hastings rotation or a Glauber dynamics rotation. In some embodiments, a quantum walk procedure is performed in the quantum computing device to implement a Markov Chain Monte Carlo method; during the quantum walk procedure, an intermediate measurement is obtained; and a rewinding procedure of one or more but not all steps of the quantum walk procedure is performed if the intermediate measurement produces an incorrect outcome.Type: ApplicationFiled: August 2, 2019Publication date: March 19, 2020Applicant: Microsoft Technology Licensing, LLCInventors: Matthias Troyer, David Poulin, Bettina Heim, Jessica Lemieux
-
Publication number: 20200076451Abstract: A method for determining the n best positions of frozen bits in a channel decoder for a noisy communication channel. A decoding method and decoding processing unit for implementing the channel having frozen bits at the n worst positions. A method and system that iteratively, for each bit i from the n bits, determines a probability vector for the bit i by traversing a logical graph using contraction identities simplified to specific values, indexes the specific values from the contraction identities newly computed during the determination of the probability vector for subsequent reference during a following iteration based on corresponding contraction identities, fixes the bit i from the probability vector and moving to bit i+1 until all n bits are fixed.Type: ApplicationFiled: March 5, 2018Publication date: March 5, 2020Applicant: SOCPRA SCIENCES ET GÉNIE S.E.C.Inventors: David Poulin, Andrew J. Ferris
-
Publication number: 20190386685Abstract: 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.Type: ApplicationFiled: August 30, 2019Publication date: December 19, 2019Applicant: Microsoft Technology Licensing, LLCInventors: Jeongwan Haah, David Wecker, Matthew Hastings, David Poulin
-
Patent number: 10404287Abstract: 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.Type: GrantFiled: June 19, 2017Date of Patent: September 3, 2019Assignee: Microsoft Technology Licensing, LLCInventors: Jeongwan Haah, David Wecker, Matthew Hastings, David Poulin
-
Publication number: 20180269906Abstract: 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.Type: ApplicationFiled: June 19, 2017Publication date: September 20, 2018Applicant: Microsoft Technology Licensing, LLCInventors: Jeongwan Haah, David Wecker, Matthew Hastings, David Poulin
-
Patent number: D257685Type: GrantFiled: August 21, 1978Date of Patent: December 23, 1980Inventor: David A. Poulin