IPC분류정보
국가/구분 |
United States(US) Patent
등록
|
국제특허분류(IPC7판) |
|
출원번호 |
US-0924654
(2010-10-01)
|
등록번호 |
US-8543627
(2013-09-24)
|
발명자
/ 주소 |
|
출원인 / 주소 |
|
인용정보 |
피인용 횟수 :
1 인용 특허 :
4 |
초록
▼
We describe a method for using a classical computer to generate a sequence of elementary operation (SEO) that can be used to operate a quantum computer, thereby inducing the quantum computer to sample an arbitrary probability distribution. The probability distribution being sampled is specified in t
We describe a method for using a classical computer to generate a sequence of elementary operation (SEO) that can be used to operate a quantum computer, thereby inducing the quantum computer to sample an arbitrary probability distribution. The probability distribution being sampled is specified in the form of a Bayesian network.
대표청구항
▼
1. A method of operating a classical computer to calculate a total SEO, with the purpose of using said total SEO to operate a quantum computer, and to induce said quantum computer to approximately sample a probability distribution π(x) defined for all x∈{0,1}NB, said method comprising the steps of:
1. A method of operating a classical computer to calculate a total SEO, with the purpose of using said total SEO to operate a quantum computer, and to induce said quantum computer to approximately sample a probability distribution π(x) defined for all x∈{0,1}NB, said method comprising the steps of: storing in said classical computer a data trove comprising a positive number ε, a point x0∈{0,1}NB such that π(x0) is nonzero, and a data-set that specifies said probability distribution π(x),calculating using said classical computer and using said data trove, a sequence of unitary operators U0, U1, U2, . . . , UM, wherein M depends on ε, wherein there are unit vectors |Φ1 and |Φ2(x) such that if ERR=∥v1−|2|2 where |v1=UM . . . U1U0|x0|Φ1 and |v2=Σx√{square root over (π(x))}|x|Φ2(x), then ERR≦ε,calculating using said classical computer for each j=0,1,2, . . . M, a SEO Σj corresponding to Uj, wherein said total SEO equals the product ΣM . . . Σ1Σ0. 2. The method of claim 1, wherein said data trove comprises a net data-set that specifies a Bayesian network with full probability distribution equal to said π(x), wherein said net data-set comprises: (a) a data-set that characterizes the possible states of each node of said Bayesian network,(b) a data-set that characterizes the parent nodes of each node of said Bayesian network,(c) a data-set that characterizes a multiplicity of conditional probabilities associated with each node of said Bayesian network. 3. The method of claim 1, wherein if A is the subset of {0,1,2, . . . M} such that for all j in A, Uj has only two distinct eigenvalues λ1j and λ2j such that the product λijλ2j* is not in the set {eiπ/3,e−iπ/3,−1}, then A has 3 or more elements. 4. The method of claim 3, wherein A has about M elements. 5. The method of claim 1, wherein for each j=0,1,2, . . . M, said SEO Σj has a number of elementary operations that scales polynomially in NB. 6. The method of claim 1, further utilizing a quantum computer, comprising the additional step of: operating said quantum computer according to said total SEO. 7. The method of claim 1, wherein said sequence of unitary operators U0,U1, . . . UM alternates between unitary operators that have |x|α for some state |α, as an approximate eigenvector, and unitary operators that have Σx√{square root over (π(x))}|x|β for some state |β, as an approximate eigenvector. 8. A device that calculates a total SEO, with the purpose of using said total SEO to operate a quantum computer, and to induce said quantum computer to approximately sample a probability distribution π(x) defined for all x∈{0,1}NB, said device comprising: a memory arranged to store a data trove comprising a positive number ε, a point x0∈{0,1}NB such that π(x0) is nonzero, and a data-set that specifies said probability distribution π(x),a processor arranged to calculate using said data trove stored in said memory, a sequence of unitary operators U0,U1,U2, . . . ,UM, wherein M depends on ε, and arranged to calculate for each j=0,1,2, . . . M, a SEO Σj corresponding to Uj, wherein there are unit vectors |Φ1 and |Φ2(x) such that if ERR=∥v1−|v2|2 where |v1=UM . . . U1U0|x0|Φ1 and |v2=Σx√{square root over (π(x))}|x|Φ2(x), then ERR≦ε, wherein said total SEO equals the product ΣM . . . Σ1Σ0. 9. The device of claim 8, wherein said data trove comprises a net data-set that specifies a Bayesian network with full probability distribution equal to said π(x), wherein said net data-set comprises: (a) a data-set that characterizes the possible states of each node of said Bayesian network,(b) a data-set that characterizes the parent nodes of each node of said Bayesian network,(c) a data-set that characterizes a multiplicity of conditonal probabilities associated with each node of said Bayesian network. 10. The device of claim 8, wherein if A is the subset of {0,1,2, . . . M} such that for all j in A, Uj has only two distinct eigenvalues λ1j and λ2j such that the product λ1jλ2j8 is not in the set {eiπ/3,e−iπ/3,−1}, then A has 3 or more elements. 11. The device of claim 10, wherein A has about M elements. 12. The device of claim 8, further comprising a quantum computer that operates according to said total SEO. 13. The device of claim 8, wherein said sequence of unitary operators U0,U1, . . . UM alternates between unitary operators that have |x|α for some state |α, as an approximate eigenvector, and unitary operators that have Σx√{square root over (π(x))}|x|β for some state |β, as an approximate eigenvector. 14. A method of operating a classical computer to calculate a total SEO, with the purpose of using said total SEO to operate a quantum computer, and to induce said quantum computer to approximately sample a probability distribution π(x) defined for all x∈{0,1}NB, said method comprising the steps of: storing in said classical computer a data trove comprising a positive number ε, and a data-set that specifies a multiplicity of conditional probabilities of said π(x),calculating using said classical computer and using said data trove, a sequence of unitary operators U0,U1,U2, . . . , UM, wherein M depends on ε, wherein there are unit vectors |Φ1 and |Φ2(x) such that if ERR=∥v1−|v2|2 where |v1=UM . . . U1U0|Φ1 and |v2=Σx√{square root over (π(x))}|x|Φ2(x), then ERR≦ε,calculating using said classical computer for each j=0,1,2, . . . M, a SEO Σj corresponding to Uj, wherein said total SEO equals the product ΣM . . . . Σ1Σ0. 15. The method of claim 14, wherein if A is the subset of {0,1,2, . . . M} such that for all j in A, Uj has only two distinct eigenvalues λ1j and λ2j such that the product λ1jλ2j* is not in the set {eiπ/3,e−iπ/3,−1}, then A has 3 or more elements. 16. The method of claim 15, wherein A has about M elements. 17. The method of claim 14, wherein for each j=0,1,2, . . . M, said SEO Σj has a number of elementary operations that scales polynomially in NB. 18. The method of claim 14, further utilizing a quantum computer, comprising the additional step of: operating said quantum computer according to said total SEO. 19. The method of claim 14, wherein said sequence of unitary operators U0,U1, . . . UM alternates between unitary operators that have |x|α for some state |α, as an approximate eigenvector, and unitary operators that have Σx√{square root over (π(x))}|x|β for some state |β, as an approximate eigenvector. 20. A device that calculates a total SEO, with the purpose of using said total SEO to operate a quantum computer, and to induce said quantum computer to approximately sample a probability distribution π(x) defined for all x∈{0,1}NB said device comprising: a memory arranged to store a data trove comprising a positive number ε, and a data-set that specifies a multiplicity of conditional probabilities of said π(x),a processor arranged to calculate using said data trove stored in said memory, a sequence of unitary operators U0,U1,U2, . . . , UM, wherein M depends on ε, and arranged to calculate for each j=0,1,2, . . . M, a SEO Σj corresponding to Uj, wherein said total SEO equals the product ΣM . . . Σ1Σ0, wherein there are unit vectors |Φ1 and |Φ2(x) such that if ERR=∥v1−|v2|2 where |v1=UM . . . U1U0|Φ1 and |v2=Σx√{square root over (π(x))}|x|Φ2(x), then ERR≦ε. 21. The device of claim 20, wherein if A is the subset of {0,1,2, . . . M} such that for all j in A, Uj has only two distinct eigenvalues λ1j and λ2j such that the product λ1jλ2j* is not in the set {eiπ/3,e−iπ/3,−1}, then A has 3 or more elements. 22. The device of claim 21, wherein A has about M elements. 23. The device of claim 20, wherein for each j=0,1,2, . . . M, said SEO Σj has a number of elementary operations that scales polynomially in NB. 24. The device of claim 20, further comprising a quantum computer that operates according to said total SEO. 25. The device of claim 20, wherein said sequence of unitary operators U0,U1, . . . UM alternates between unitary operators that have |x|α for some state |α, as an approximate eigenvector, and unitary operators that have Σx√{square root over (π(x))}|x|β for some state |β, as an approximate eigenvector.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.