메뉴 건너뛰기




Volumn 106-107, Issue , 2002, Pages 151-158

The challenge of quantum computer simulations of physical phenomena

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0036524754     PISSN: 09205632     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0920-5632(01)01654-1     Document Type: Article
Times cited : (6)

References (15)
  • 1
    • 0003779051 scopus 로고    scopus 로고
    • edited by A. J. G. Hey (Perseus Books, Reading
    • R. Landauer in Feynman and Computation, edited by A. J. G. Hey (Perseus Books, Reading, 1999).
    • (1999) Feynman and Computation
    • Landauer, R.1
  • 3
    • 0344734433 scopus 로고    scopus 로고
    • For a history about quantum simulations see, for example, Ref. [2]
    • For a history about quantum simulations see, for example, Ref. [2].
  • 5
    • 0344302237 scopus 로고    scopus 로고
    • Probabilistic simulations of quantum systems on a CC are mainly performed with the use of the Monte Carlo method, which has the property that the probability distributions achieved represent the desired information efficiently. But they often require exponential sampling to obtain the desired expectation with sufficient accuracy
    • Probabilistic simulations of quantum systems on a CC are mainly performed with the use of the Monte Carlo method, which has the property that the probability distributions achieved represent the desired information efficiently. But they often require exponential sampling to obtain the desired expectation with sufficient accuracy.
  • 8
    • 0035251603 scopus 로고    scopus 로고
    • C.D. Batista and G. Ortiz, unpublished preprint
    • C.D. Batista and G. Ortiz, Phys. Rev. Lett. 86 (2001) 1082. C.D. Batista and G. Ortiz, unpublished preprint.
    • (2001) Phys. Rev. Lett. , vol.86 , pp. 1082
    • Batista, C.D.1    Ortiz, G.2
  • 9
    • 0344302236 scopus 로고    scopus 로고
    • j
    • j.
  • 10
    • 0345596727 scopus 로고    scopus 로고
    • j - 1
    • j - 1.
  • 11
    • 0345164653 scopus 로고    scopus 로고
    • We are aware of at least one case where the sign problem can be mapped onto a 3-SAT problem, i.e., an NP-complete problem [7]. Therefore, one cannot yet claim that a QC can solve "all" sign problems, otherwise one would claim that one is solving all NP-complete problems and this has not been rigorously established
    • We are aware of at least one case where the sign problem can be mapped onto a 3-SAT problem, i.e., an NP-complete problem [7]. Therefore, one cannot yet claim that a QC can solve "all" sign problems, otherwise one would claim that one is solving all NP-complete problems and this has not been rigorously established.
  • 12
    • 0344302235 scopus 로고    scopus 로고
    • unpublished preprint
    • C. Negrevergne et al., unpublished preprint.
    • Negrevergne, C.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.