메뉴 건너뛰기




Volumn 56, Issue 3, 1997, Pages 3661-3681

Simulating ising spin glasses on a quantum computer

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; ELECTRON ENERGY LEVELS; FERROMAGNETIC MATERIALS; GLASS; MAGNETIC FIELDS; MATHEMATICAL MODELS; MONTE CARLO METHODS; PROBABILITY; QUANTUM THEORY; THERMODYNAMICS;

EID: 0031222328     PISSN: 1063651X     EISSN: None     Source Type: Journal    
DOI: 10.1103/PhysRevE.56.3661     Document Type: Article
Times cited : (101)

References (65)
  • 5
    • 12044260119 scopus 로고
    • W. H. Zurek, Phys. Today 44 (10), 36 (1991).PHTOAD
    • (1991) Phys. Today , vol.44 , Issue.10 , pp. 36
    • Zurek, W.H.1
  • 6
    • 85037219752 scopus 로고    scopus 로고
    • fact, a quantum computer that is only allowed to use superposition, without interference, is equivalent in computational power to a classical probabilistic computer [D. Aharonov (private communication)
    • In fact, a quantum computer that is only allowed to use superposition, without interference, is equivalent in computational power to a classical probabilistic computer [D. Aharonov (private communication).
  • 22
    • 85037190317 scopus 로고    scopus 로고
    • Physica D (to be published)
    • A. Peres, Physica D (to be published).
    • Peres, A.1
  • 25
    • 0029838223 scopus 로고    scopus 로고
    • S. Lloyd, Science 273, 1073 (1996).SCIEAS
    • (1996) Science , vol.273 , pp. 1073
    • Lloyd, S.1
  • 26
    • 85037244789 scopus 로고    scopus 로고
    • B. M. Boghosian and W. Taylor IV (unpublished)
    • B. M. Boghosian and W. Taylor IV (unpublished).
  • 27
    • 85037255449 scopus 로고    scopus 로고
    • B. M. Boghosian and W. Taylor IV (unpublished)
    • B. M. Boghosian and W. Taylor IV (unpublished).
  • 36
    • 33947716431 scopus 로고
    • E. Ising, Z. Phys. 31, 253 (1925).ZEPYAA
    • (1925) Z. Phys. , vol.31 , pp. 253
    • Ising, E.1
  • 46
    • 5844243238 scopus 로고
    • G. Parisi, Physica A 140, 312 (1986).PHYADX
    • (1986) Physica A , vol.140 , pp. 312
    • Parisi, G.1
  • 50
    • 85037181472 scopus 로고    scopus 로고
    • The “(Formula presented)” superscript indicates the ferromagnetic case
    • The “(Formula presented)” superscript indicates the ferromagnetic case.
  • 51
    • 85037229425 scopus 로고    scopus 로고
    • (Formula presented) should be understood as “(Formula presented) plus (Formula presented)” or “(Formula presented) minus (Formula presented)” not “(Formula presented) to the power (Formula presented)”
    • (Formula presented) should be understood as “(Formula presented) plus (Formula presented)” or “(Formula presented) minus (Formula presented)” not “(Formula presented) to the power (Formula presented)”
  • 53
    • 85037211931 scopus 로고    scopus 로고
    • This operator is still “valid” since it can be decomposed into a product of two-qubit operators
    • This operator is still “valid” since it can be decomposed into a product of two-qubit operators.
  • 55
    • 85037191578 scopus 로고    scopus 로고
    • Suppose, without loss of generality, that (Formula presented). Then (Formula presented) (Formula presented) (Formula presented). For the other direction, take (Formula presented). This proves Eq. (2.51)
    • Suppose, without loss of generality, that (Formula presented). Then (Formula presented) (Formula presented) (Formula presented). For the other direction, take (Formula presented). This proves Eq. (2.51).
  • 57
    • 85037199873 scopus 로고    scopus 로고
    • N. IA. Vilenkin and A. U. Klimyk, Representation of Lie Groups and Special Functions (Kluwer Academic, Dordrecht, 1991), Vol. 2, p. 10
    • N. IA. Vilenkin and A. U. Klimyk, Representation of Lie Groups and Special Functions (Kluwer Academic, Dordrecht, 1991), Vol. 2, p. 10.
  • 59
    • 85037249684 scopus 로고    scopus 로고
    • Technically this is an induction on a finite set since the lattice is finite. But this is not a problem since once the entire lattice is covered the operation of closing a new bond is undefined
    • Technically this is an induction on a finite set since the lattice is finite. But this is not a problem since once the entire lattice is covered the operation of closing a new bond is undefined.


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