Method and system for a quantum oracle to obtain the number of quantum ground states
View Patent ↗The present invention provides new methods, systems, and apparatus, including quantum programs and methodology, to construct a quantum oracle to obtain or to provide the exact value, or a range of values, of the number of ground states of a given quantum problem system.
1. A method for manipulating quantum computing hardware using a quantum computing system to provide a quantum oracle which resolves quantum information of a system governed by a quantum problem Hamiltonian H p , the method comprising:
implementing, by the quantum computing system, a quantum entirety of Hamiltonians comprising H p +H s +H c , as a physical embodiment of qubits, wherein a Hilbert space of H p +H s +H c comprises a dimension, and wherein H p is a quantum problem Hamiltonian, H s is a measured Hamiltonian part, and H c is a quantum Hamiltonian which when H s is measured has a ground state degeneracy of one; and
measuring, by the quantum computing system, average quantities on H s to allow the quantum oracle to provide a ground state degeneracy (g p ) of H p , wherein the quantum computing system is an adiabatic quantum computer, a gate-based quantum computer, a hybrid quantum computer, or a combination thereof.
2. The method of claim 1 , wherein the quantum oracle resolves either an integer for g p or a range of values within which g p falls.
3. The method of claim 1 , further comprising programming the Hamiltonian H c such that, before the measuring average quantities on H s , is not degenerate, or a degeneracy of H c is known and is less than or equal to five.
4. The method of claim 1 , further comprising programming the Hamiltonian H c such that, the measurement on H s returns values from a canonical thermal state ensemble (CTSE), or from a thermal state drawn from a Boltzmann weighted ensemble of all thermal states of H p +H s .
5. The method of claim 4 , wherein the quantum entirety of Hamiltonians is comprised of at least three distinct parts and at least three coupling Hamiltonians between the at least three distinct parts, wherein the three distinct parts comprises H 2 +H s +H c , and wherein the at least three coupling Hamiltonians comprises a coupling between H p and H c (H pc ), a coupling between H p and H s (H ps ), and a coupling between H s and H c (H sc ).
6. The method of claim 5 , wherein, before the measurement on H s , the at least three coupling Hamiltonians are zero.
7. The method of claim 1 , further comprising measuring H s for a measure of thermalization (δ) or a measure of decoherence (σ).
8. The method of claim 1 , wherein the problem Hamiltonian H p is a problem Hamiltonian of a counting problem contained in computational complexity class #P, computational complexity class #BQP, or a combination thereof.
9. The method of claim 8 , wherein measuring the average quantities on H s to allow the quantum oracle to provide g p of H p results in a range of possibilities for the g p of H p .
10. A quantum computing system to provide a quantum oracle which resolves quantum information of a system governed by a quantum problem Hamiltonian H p , the quantum computing system comprising:
an adiabatic quantum computer, a gate-based quantum computer, a hybrid quantum computer, or a combination thereof, which:
implements a quantum entirety of Hamiltonians comprising H p +H s +H c , as a physical embodiment of qubits, wherein a Hilbert space of H p +H s +H c comprises a dimension, and wherein H p is a quantum problem Hamiltonian, H S is a measured Hamiltonian part, and H c is a quantum Hamiltonian which when H s is measured has ground state degeneracy of one; and
measures average quantities on H s to allow the quantum oracle to provide a ground state degeneracy (g p ) of H p .
11. The quantum computing system of claim 10 , wherein the quantum oracle resolves either an integer for g p or a range of values within which g p falls.
12. The quantum computing system of claim 10 , wherein the quantum computing system programs the Hamiltonian H c such that, before the measuring average quantities on H s , the ground state of H c is not degenerate, or a degeneracy of H c is known and is less than or equal to five.
13. The quantum computing system of claim 10 , wherein the system programs the Hamiltonian H c such that the measurement on H s returns values from a canonical thermal state ensemble (CTSE), or from a thermal state drawn from a Boltzmann weighted ensemble of all thermal states of H p +H s .
14. The quantum computing system of claim 13 , wherein the quantum entirety of Hamiltonians is comprised of at least three distinct parts and at least three coupling Hamiltonians between the at least three distinct parts, wherein the three distinct parts comprises H p +H s +H c , and wherein the at least three coupling Hamiltonians comprises a coupling between H p and H c (H pc ), a coupling between H p and H s (H ps ), and a coupling between Hs and H c (H sc ).
15. The quantum computing system of claim 14 , wherein, before the measurement on H s , the at least three coupling Hamiltonians are zero.
16. The quantum computing system of claim 10 , wherein the system measures H S for a measure of thermalization (δ) or a measure of decoherence (σ).
17. The quantum computing system of claim 10 , wherein the problem Hamiltonian H p is a problem Hamiltonian of a counting problem contained in computational complexity class #P, computational complexity class #BQP, or a combination thereof.
18. The quantum computing system of claim 17 , wherein measuring the average quantities on H s to allow the quantum oracle to provide g p of H p results in a range of possibilities for the g p of H p .