Patents by Inventor Jeongwan Haah
Jeongwan Haah 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).
-
Publication number: 20230115086Abstract: A quantum error correcting code with dynamically generated logical qubits is provided. When viewed as a subsystem code, the code has no logical qubits. Nevertheless, the measurement patterns generate logical qubits, allowing the code to act as a fault-tolerant quantum memory. Each measurement can be a two-qubit Pauli measurement.Type: ApplicationFiled: May 11, 2022Publication date: April 13, 2023Applicant: Microsoft Technology Licensing, LLCInventors: Matthew HASTINGS, Jeongwan HAAH
-
Patent number: 11599817Abstract: A quantum computing device is provided, including a logical qubit encoding surface including a plurality of plaquettes. Each plaquette of the plurality of plaquettes may include a plurality of measurement-based qubits. The plurality of measurement-based qubits may include four data qubits and a first ancilla qubit. The first ancilla qubit may be electrically connected to the four data qubits and a second ancilla qubit included in the logical qubit encoding surface.Type: GrantFiled: October 18, 2019Date of Patent: March 7, 2023Assignee: Microsoft Technology Licensing, LLCInventors: Nicolas Guillaume Delfosse, Michael Edward Beverland, Jeongwan Haah, Rui Chao
-
Publication number: 20230030383Abstract: Embodiments of the present disclosure include systems and methods for reducing a sample complexity and a time complexity associated with noise-robust characterization of a quantum device. A plurality of copies of a Gibbs state of the quantum device in thermal equilibrium at a high-temperature. A plurality of estimates for expectation values of the plurality of copies of the Gibbs state. A plurality of cluster derivatives for a plurality of connected clusters of a low-degree Hamiltonian are calculated. A function is inverted on the plurality of estimates based on the plurality of cluster derivatives and a set of Hamiltonian coefficients are estimated for the low-degree Hamiltonian of the quantum device.Type: ApplicationFiled: June 2, 2021Publication date: February 2, 2023Inventors: Jeongwan HAAH, Robin Ashok KOTHARI, Ewin TANG
-
Patent number: 11568295Abstract: In some embodiments, one or more unitary-valued functions are generated by a classical computer generating using projectors with a predetermined number of significant bits. A quantum computing device is then configured to implement the one or more unitary-valued functions. In further embodiments, a quantum circuit description for implementing quantum signal processing that decomposes complex-valued periodic functions is generated by a classical computer, wherein the generating further includes representing approximate polynomials in a Fourier series with rational coefficients. A quantum computing device is then configured to implement a quantum circuit defined by the quantum circuit description.Type: GrantFiled: June 24, 2019Date of Patent: January 31, 2023Assignee: Microsoft Technology Licensing, LLCInventor: Jeongwan Haah
-
Publication number: 20230027698Abstract: A quantum error correcting code with dynamically generated logical qubits is provided. When viewed as a subsystem code, the code has no logical qubits. Nevertheless, the measurement patterns generate logical qubits, allowing the code to act as a fault-tolerant quantum memory. Each measurement can be a two-qubit Pauli measurement.Type: ApplicationFiled: June 30, 2021Publication date: January 26, 2023Applicant: Microsoft Technology Licensing, LLCInventors: Matthew Hastings, Jeongwan Haah
-
Patent number: 11552653Abstract: A quantum decoder receives a syndrome from a quantum measurement circuit and performs various decoding operations for processing-efficient fault detection. The decoding operations include generating a decoding graph from the syndrome and growing a cluster around each one of multiple check nodes in the graph that correspond to a non-trivial value in the syndrome. Each cluster includes the check node corresponding to the non-trivial value and a set of neighboring nodes positioned within a distance of d edge-lengths from the check node. Following cluster growth, the decoder determines if, for each cluster, there exists a solution set internal to the cluster that fully explains the non-trivial syndrome bit for the cluster. If so, the decoder identifies and returns at least one solution set that fully explains the set of non-trivial bits in the syndrome.Type: GrantFiled: February 26, 2021Date of Patent: January 10, 2023Assignee: Microsoft Technology Licensing, LLCInventors: Nicolas Guillaume Delfosse, Michael Edward Beverland, Vivien Londe, Jeongwan Haah
-
Publication number: 20220414509Abstract: Embodiments of the present disclosure include systems and methods for magic state distillation. A first matrix is generated based on a collection of indices that reference a second matrix. A set of compressed Clifford gates is determined based on the first matrix. The set of compressed Clifford gates is applied to a set of the qubits of a quantum processor. A set of magic states of the quantum processor are obtained as a result of application of the set of compressed Clifford gates. The quantum processor may be configured based on the magic states obtained.Type: ApplicationFiled: June 28, 2021Publication date: December 29, 2022Inventor: Jeongwan HAAH
-
Patent number: 11437995Abstract: A quantum computing system implementing surface code in a measurement circuit may be configured to translate a quantum algorithm including at least one Hadamard gate into an equivalent circuit that lacks a Hadamard gate, the circuit including Hadamard-conjugated Pauli measurements that include joint logical measurements implemented on diagonally-arranged patches of the surface code.Type: GrantFiled: February 26, 2021Date of Patent: September 6, 2022Assignee: Microsoft Technology Licensing, LLCInventors: Jeongwan Haah, Michael Beverland, Nicolas Guillaume Delfosse
-
Publication number: 20220278683Abstract: A quantum computing system implementing surface code in a measurement circuit may be configured to translate a quantum algorithm including at least one Hadamard gate into an equivalent circuit that lacks a Hadamard gate, the circuit including Hadamard-conjugated Pauli measurements that include joint logical measurements implemented on diagonally-arranged patches of the surface code.Type: ApplicationFiled: February 26, 2021Publication date: September 1, 2022Inventors: Jeongwan HAAH, Michael BEVERLAND, Nicolas Guillaume DELFOSSE
-
Patent number: 11405056Abstract: Examples are disclosed that relate to, on a quantum computing device, distilling magic states encoded in a [[n,k,d]] block code comprising an outer code. One example provides a method comprising preparing encoded noisy magic states using data qubits, and measuring Clifford stabilizers on the data qubits, thereby applying an inner code. The method further comprises initializing output qubits and initiating a teleportation of distilled magic states derived from the encoded noisy magic states to the output qubits. The method further comprises measuring X-stabilizers on the data qubits, postselecting based on the outcomes, measuring each data qubit destructively utilizing Z-stabilizers, and applying one or more postselection conditions to the data qubits to complete the teleportation of the distilled magic states to the output qubits.Type: GrantFiled: May 10, 2020Date of Patent: August 2, 2022Assignee: Microsoft Technology Licensing, LLCInventors: Matthew Benjamin Hastings, Jeongwan Haah
-
Publication number: 20220216884Abstract: A quantum decoder receives a syndrome from a quantum measurement circuit and performs various decoding operations for processing-efficient fault detection. The decoding operations include generating a decoding graph from the syndrome and growing a cluster around each one of multiple check nodes in the graph that correspond to a non-trivial value in the syndrome. Each cluster includes the check node corresponding to the non-trivial value and a set of neighboring nodes positioned within a distance of d edge-lengths from the check node. Following cluster growth, the decoder determines if, for each cluster, there exists a solution set internal to the cluster that fully explains the non-trivial syndrome bit for the cluster. If so, the decoder identifies and returns at least one solution set that fully explains the set of non-trivial bits in the syndrome.Type: ApplicationFiled: February 26, 2021Publication date: July 7, 2022Inventors: Nicolas Guillaume DELFOSSE, Michael Edward BEVERLAND, Vivien LONDE, Jeongwan HAAH
-
Publication number: 20210351795Abstract: Examples are disclosed that relate to, on a quantum computing device, distilling magic states encoded in a [[n,k,d]] block code comprising an outer code. One example provides a method comprising preparing encoded noisy magic states using data qubits, and measuring Clifford stabilizers on the data qubits, thereby applying an inner code. The method further comprises initializing output qubits and initiating a teleportation of distilled magic states derived from the encoded noisy magic states to the output qubits. The method further comprises measuring X-stabilizers on the data qubits, postselecting based on the outcomes, measuring each data qubit destructively utilizing Z-stabilizers, and applying one or more postselection conditions to the data qubits to complete the teleportation of the distilled magic states to the output qubits.Type: ApplicationFiled: May 10, 2020Publication date: November 11, 2021Applicant: Microsoft Technology Licensing, LLCInventors: Matthew Benjamin HASTINGS, Jeongwan HAAH
-
Patent number: 11132617Abstract: Embodiments of the disclosed technology concern a quantum circuit configured to implement a real time evolution unitary of a Hamiltonian in a quantum computing device, wherein a unit time evolution unitary operator is decomposed into overlapping smaller blocks of unitary operators. In some implementations, (a) the size of the overlap is proportional to the logarithm of a number of qubits in the simulated system, (b) the size of the overlap is proportional to the logarithm of a total simulated evolution time, and/or (c) the size of the overlap is proportional to a Lieb-Robinson velocity.Type: GrantFiled: June 27, 2018Date of Patent: September 28, 2021Assignee: Microsoft Technology Licensing, LLCInventors: Jeongwan Haah, Matthew B. Hastings, Robin Kothari, Guang H. Low
-
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: 20210117843Abstract: A quantum computing device is provided, including a logical qubit encoding surface including a plurality of plaquettes. Each plaquette of the plurality of plaquettes may include a plurality of measurement-based qubits. The plurality of measurement-based qubits may include four data qubits and a first ancilla qubit. The first ancilla qubit may be electrically connected to the four data qubits and a second ancilla qubit included in the logical qubit encoding surface.Type: ApplicationFiled: October 18, 2019Publication date: April 22, 2021Applicant: Microsoft Technology Licensing, LLCInventors: Nicolas Guillaume DELFOSSE, Michael Edward BEVERLAND, Jeongwan HAAH, Rui CHAO
-
Patent number: 10846608Abstract: This application concerns quantum computing and quantum circuits. For example, among the embodiments disclosed herein are codes and protocols to distill T, controlled-S, and Toffoli (or CCZ) gates for use in croantum circuits. Examples of the disclosed codes use lower overhead for a given target accuracy relative to other distillation techniques. In some embodiments, a magic state distillation protocol is generated for creating magic states in the quantum computing device, wherein the magic state distillation protocol includes (a) Reed-Muller codes, or (b) punctured Reed-Muller codes. The quantum computing device can then configured to implement the magic state distillation protocol.Type: GrantFiled: May 17, 2018Date of Patent: November 24, 2020Assignee: Microsoft Technology Licensing, LLCInventors: Jeongwan Haah, Matthew Hastings
-
Publication number: 20200143280Abstract: Embodiments of the disclosed technology concern a quantum circuit configured to implement a real time evolution unitary of a Hamiltonian in a quantum computing device, wherein a unit time evolution unitary operator is decomposed into overlapping smaller blocks of unitary operators. In some implementations, (a) the size of the overlap is proportional to the logarithm of a number of qubits in the simulated system, (b) the size of the overlap is proportional to the logarithm of a total simulated evolution time, and/or (c) the size of the overlap is proportional to a Lieb-Robinson velocity.Type: ApplicationFiled: June 27, 2018Publication date: May 7, 2020Applicant: Microsoft Technology Licensing, LLCInventors: Jeongwan Haah, Matthew B. Hastings, Robin Kothari, Guang H. Low
-
Publication number: 20190392343Abstract: In some embodiments, one or more unitary-valued functions are generated by a classical computer generating using projectors with a predetermined number of significant bits. A quantum computing device is then configured to implement the one or more unitary-valued functions. In further embodiments, a quantum circuit description for implementing quantum signal processing that decomposes complex-valued periodic functions is generated by a classical computer, wherein the generating further includes representing approximate polynomials in a Fourier series with rational coefficients. A quantum computing device is then configured to implement a quantum circuit defined by the quantum circuit description.Type: ApplicationFiled: June 24, 2019Publication date: December 26, 2019Applicant: Microsoft Technology Licensing, LLCInventor: Jeongwan Haah
-
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