Patents by Inventor Guang Hao Low

Guang Hao Low 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: 20240046137
    Abstract: A computing system including a classical computing device, including a processor that generates a Haar-random unitary matrix. The processor further computes a single-particle-basis fermion rotation based at least in part on the Haar-random unitary matrix and outputs the single-particle-basis fermion rotation to a quantum computing device. The quantum computing device receives a specification of a fermion wavefunction and further receives the single-particle-basis fermion rotation. The quantum computing device further applies the single-particle-basis fermion rotation to the fermion wavefunction. The quantum computing device further measures the rotated fermion wavefunction to obtain a classical shadow measurement result. The processor of the classical computing device further receives the classical shadow measurement result.
    Type: Application
    Filed: August 24, 2022
    Publication date: February 8, 2024
    Applicant: Microsoft Technology Licensing, LLC
    Inventor: Guang Hao LOW
  • Publication number: 20230409895
    Abstract: A computing system including one or more processing devices configured to generate a training data set. Generating the training data set may include generating training molecular structures, respective training Hamiltonians, and training energy terms. Computing the training energy terms may include, for each of the training Hamiltonians, computing a kinetic energy term, a nuclear potential energy term, an electron repulsion energy term, and an exchange energy term using Hartree-Fock (HF) estimation. Computing the training energy terms may further include, for a first subset of the training Hamiltonians, computing dynamical correlation energy terms using coupled cluster estimation. Computing the training energy terms may further include, for a second subset of the first subset, generating truncated Hamiltonians and computing static correlation energy terms using complete active space (CAS) estimation.
    Type: Application
    Filed: June 13, 2022
    Publication date: December 21, 2023
    Applicant: Microsoft Technology Licensing, LLC
    Inventors: Hongbin LIU, Guang Hao LOW, Matthias TROYER, Chi CHEN
  • Patent number: 11809959
    Abstract: In this disclosure, quantum algorithms are presented for simulating Hamiltonian time-evolution e?i(A+B)t in the interaction picture of quantum mechanics on a quantum computer. The interaction picture is a known analytical tool for separating dynamical effects due to trivial free-evolution A from those due to interactions B. This is especially useful when the energy-scale of the trivial component is dominant, but of little interest. Whereas state-of-art simulation algorithms scale with the energy ?A+B???A?+?B? of the full Hamiltonian, embodiments of the disclosed approach generally scale linearly with the sum of the Hamiltonian coefficients from the low-energy component B and poly-logarithmically with those from A.
    Type: Grant
    Filed: April 12, 2019
    Date of Patent: November 7, 2023
    Assignee: Microsoft Technology Licensing, LLC
    Inventors: Guang Hao Low, Nathan O. Wiebe
  • Patent number: 11699087
    Abstract: In this disclosure, quantum algorithms are presented for simulating Hamiltonian time-evolution e?i(A+B)t in the interaction picture of quantum mechanics on a quantum computer. The interaction picture is a known analytical tool for separating dynamical effects due to trivial free-evolution A from those due to interactions B. This is especially useful when the energy-scale of the trivial component is dominant, but of little interest. Whereas state-of-art simulation algorithms scale with the energy ?A+B???A?+?B? of the full Hamiltonian, embodiments of the disclosed approach generally scale linearly with the sum of the Hamiltonian coefficients from the low-energy component B and poly-logarithmically with those from A.
    Type: Grant
    Filed: April 12, 2019
    Date of Patent: July 11, 2023
    Assignee: Microsoft Technology Licensing, LLC
    Inventors: Guang Hao Low, Nathan O. Wiebe
  • Patent number: 11640549
    Abstract: Methods for preparing a Gibbs state in a qubit register of a quantum computer include applying one or more quantum gates to one or more qubits of the qubit register to prepare a trial quantum state spanning the one or more qubits, the trial quantum state being defined as a function of parameters {right arrow over (?)} and being selected to provide an initial estimate of the Gibbs state. The methods further include evaluating the Gibbs free energy of the trial quantum state, adjusting the parameters {right arrow over (?)}, re-applying the one or more quantum gates to the one or more qubits to refine the trial quantum state according to the parameters {right arrow over (?)} as adjusted, and re-evaluating the Gibbs free energy of the trial quantum state.
    Type: Grant
    Filed: April 30, 2019
    Date of Patent: May 2, 2023
    Assignee: Microsoft Technology Licensing, LLC
    Inventors: Guang Hao Low, Nathan O. Wiebe, Anirban Ch Narayan Chowdhury
  • Publication number: 20230112724
    Abstract: A quantum-computation method comprises (a) sampling a random bit string from a predetermined distribution of bit strings, where each bit of the random bit string enables or disables a corresponding fixed-angle rotation of a state vector and where the product of the enabled fixed-angle rotations approximates an arbitrary rotation of the state vector through an angle of a multiplexed-rotation gate; and (b) enacting on the state vector each of the fixed-angle rotations enabled by a corresponding bit of the bit string.
    Type: Application
    Filed: August 5, 2021
    Publication date: April 13, 2023
    Applicant: Microsoft Technology Licensing, LLC
    Inventor: Guang Hao LOW
  • Patent number: 11562282
    Abstract: In methods for simulating the evolution of a real-world quantum system over time, a state-preparation sequence of quantum gates is applied to a qubit register of a quantum computer. The state-preparation sequence is configured to prepare in the qubit register an initial model state representing an initial state of the real-world quantum system. A Hamiltonian operator for the real-world quantum system is received and used in the example method. The Hamiltonian operator represents two-body potential-energy interactions in a factorized form comprising at least one Majorana operator. A time-evolution-operator sequence of quantum gates comprising a block-encoded form of the Hamiltonian operator is now applied to the qubit register of the quantum computer, yielding a changed model state that represents a time-evolved state of the real-world quantum system. A measurement operation is applied subsequently to the qubit register.
    Type: Grant
    Filed: March 5, 2020
    Date of Patent: January 24, 2023
    Assignee: Microsoft Technology Licensing, LLC
    Inventor: Guang Hao Low
  • Patent number: 11386347
    Abstract: A quantum computer and methods of operating the quantum computer, such that the quantum computer is enabled to fully simulate molecular chemistry, are described. The circuit depth of the quantum computer is reduced by at least an order of magnitude, as compared to conventional quantum computing methods. Parallelized qubit or fermionic swap networks are employed to render the non-local terms of the second quantized Hamiltonian, as local on consecutive qubits of the computer. Thus, non-local quantum dynamics are rendered local. By localizing the non-local interactions, the quantum computations may be significantly parallelized and a single template circuit, simulating the time-evolution operator for 4-qubit interactions, may be applied to the localized groupings of four qubits.
    Type: Grant
    Filed: June 11, 2019
    Date of Patent: July 12, 2022
    Assignee: Microsoft Technology Licensing, LLC
    Inventors: Guang Hao Low, Nathan Wiebe, Natalie M. Klco, Yuan Su
  • Patent number: 11188842
    Abstract: Examples are disclosed relating to obtaining a solution to a multiproduct formula of order m to solve a quantum computing problem comprising a product formula. One example provides a method comprising selecting a set of exponents kj, wherein each kj is a real number and is an exponent in a linear combination of product formulas. Based on the set of exponents kj, a set of pre-factors aj is determined based on an underdetermined solution to an m×M system of linear equations, where M is a number of lower-order product formulas in the linear combination of product formulas. The set of exponents kj and the set of pre-factors aj are used to solve the quantum computing problem comprising the product formula. By minimizing the set of exponents kj and the set of pre-factors aj, sparse solutions to the multiproduct formula are generated, reducing computational time and scaling.
    Type: Grant
    Filed: June 14, 2019
    Date of Patent: November 30, 2021
    Assignee: Microsoft Technology Licensing, LLC
    Inventors: Vadym Kliuchnikov, Guang Hao Low, Nathan Wiebe
  • Publication number: 20210295194
    Abstract: In methods for simulating the evolution of a real-world quantum system over time, a state-preparation sequence of quantum gates is applied to a qubit register of a quantum computer. The state-preparation sequence is configured to prepare in the qubit register an initial model state representing an initial state of the real-world quantum system. A Hamiltonian operator for the real-world quantum system is received and used in the example method. The Hamiltonian operator represents two-body potential-energy interactions in a factorized form comprising at least one Majorana operator. A time-evolution-operator sequence of quantum gates comprising a block-encoded form of the Hamiltonian operator is now applied to the qubit register of the quantum computer, yielding a changed model state that represents a time-evolved state of the real-world quantum system. A measurement operation is applied subsequently to the qubit register.
    Type: Application
    Filed: March 5, 2020
    Publication date: September 23, 2021
    Applicant: Microsoft Technology Licensing, LLC
    Inventor: Guang Hao LOW
  • Patent number: 10997337
    Abstract: Efficient synthesis of arbitrary quantum states and unitaries from a universal fault tolerant gate-set (e.g., Clifford+T) is a goal in quantum computation. As physical quantum computers are fixed in size, all available qubits should be used if it minimizes overall gate counts, especially that of the expensive T-gates. In this application, a quantum algorithm is described for preparing any dimension-N quantum state specified by a list of N classical numbers, that realizes a trade-off between space and T-gates. Example embodiments exploit (?) ancilla qubits, to reduce the T-gate cost to ???? ? ( N ? + ?log 2 ? N ? ) . Notably, this it proven to be optimal up to logarithmic factors for any ?=o(?{square root over (N)}) through an unconditional gate counting argument. Though (N) Clifford gates are always required, only (?{square root over (N)}) T-gates are needed in the best case, which is a quadratic improvement over prior art.
    Type: Grant
    Filed: June 12, 2019
    Date of Patent: May 4, 2021
    Assignee: Microsoft Technology Licensing, LLC
    Inventors: Guang Hao Low, Vadym Kliuchnikov
  • Publication number: 20200394545
    Abstract: Examples are disclosed relating to obtaining a solution to a multiproduct formula of order m to solve a quantum computing problem comprising a product formula. One example provides a method comprising selecting a set of exponents kj, wherein each kj is a real number and is an exponent in a linear combination of product formulas. Based on the set of exponents kj, a set of pre-factors aj is determined based on an underdetermined solution to an m×M system of linear equations, where M is a number of lower-order product formulas in the linear combination of product formulas. The set of exponents kj and the set of pre-factors aj are used to solve the quantum computing problem comprising the product formula. By minimizing the set of exponents kj and the set of pre-factors aj, sparse solutions to the multiproduct formula are generated, reducing computational time and scaling.
    Type: Application
    Filed: June 14, 2019
    Publication date: December 17, 2020
    Applicant: Microsoft Technology Licensing, LLC
    Inventors: Vadym KLIUCHNIKOV, Guang Hao LOW, Nathan WIEBE
  • Publication number: 20200394544
    Abstract: A quantum computer and methods of operating the quantum computer, such that the quantum computer is enabled to fully simulate molecular chemistry, are described. The circuit depth of the quantum computer is reduced by at least an order of magnitude, as compared to conventional quantum computing methods. Parallelized qubit or fermionic swap networks are employed to render the non-local terms of the second quantized Hamiltonian, as local on consecutive qubits of the computer. Thus, non-local quantum dynamics are rendered local. By localizing the non-local interactions, the quantum computations may be significantly parallelized and a single template circuit, simulating the time-evolution operator for 4-qubit interactions, may be applied to the localized groupings of four qubits.
    Type: Application
    Filed: June 11, 2019
    Publication date: December 17, 2020
    Inventors: Guang Hao LOW, Nathan WIEBE, Natalie M. KLCO, Yuan SU
  • Publication number: 20200349457
    Abstract: Methods for preparing a Gibbs state in a qubit register of a quantum computer include applying one or more quantum gates to one or more qubits of the qubit register to prepare a trial quantum state spanning the one or more qubits, the trial quantum state being defined as a function of parameters {right arrow over (?)} and being selected to provide an initial estimate of the Gibbs state. The methods further include evaluating the Gibbs free energy of the trial quantum state, adjusting the parameters {right arrow over (?)}, re-applying the one or more quantum gates to the one or more qubits to refine the trial quantum state according to the parameters {right arrow over (?)} as adjusted, and re-evaluating the Gibbs free energy of the trial quantum state.
    Type: Application
    Filed: April 30, 2019
    Publication date: November 5, 2020
    Applicant: Microsoft Technology Licensing, LLC
    Inventors: Guang Hao LOW, Nathan O. WIEBE, Anirban CH NARAYAN CHOWDHURY
  • Publication number: 20200134107
    Abstract: Efficient synthesis of arbitrary quantum states and unitaries from a universal fault tolerant gate-set (e.g., Clifford+T) is a goal in quantum computation. As physical quanturn computers are fixed in size, all available qubits should be used if it minimizes overall gate counts, especially that of the expensive T-gates. In this application, a quantum algorithm is described for preparing any dimension-N quantum state specified by a list of N classical numbers, that realizes a trade-off between space and T-gates. Example embodiments exploit (?) ancilla qubits, to reduce the T-gate cost to ? ? ( N ? + ?log 2 ? N ? ) . Notably, this it proven to be optimal up to logarithmic factors for any ?=o(?{square root over (N)}) through an unconditional gate counting argument. Though (N) Clifford gates are always required, only (?{square root over (N)}) T-gates are needed in the best case, which is a quadratic improvement over prior art.
    Type: Application
    Filed: June 12, 2019
    Publication date: April 30, 2020
    Applicant: Microsoft Technology Licensing, LLC
    Inventors: Guang Hao Low, Vadym Kliuchnikov
  • Publication number: 20190318053
    Abstract: In this disclosure, quantum algorithms are presented for simulating Hamiltonian time-evolution e?i(A+B)t in the interaction picture of quantum mechanics on a quantum computer. The interaction picture is a known analytical tool for separating dynamical effects due to trivial free-evolution A from those due to interactions B. This is especially useful when the energy-scale of the trivial component is dominant, but of little interest. Whereas state-of-art simulation algorithms scale with the energy ?A+B???A?+?B? of the full Hamiltonian, embodiments of the disclosed approach generally scale linearly with the sum of the Hamiltonian coefficients from the low-energy component B and poly-logarithmically with those from A.
    Type: Application
    Filed: April 12, 2019
    Publication date: October 17, 2019
    Applicant: Microsoft Technology Licensing, LLC
    Inventors: Guang Hao Low, Nathan O. Wiebe