「Connecting The Dots」しよう!〜情報システムの未解決問題を材料工学,機械学習,量子コンピュータで解く〜

5381bd68abe2b91239ca1600db2a890d?s=47 tsurubee
October 01, 2019

「Connecting The Dots」しよう!〜情報システムの未解決問題を材料工学,機械学習,量子コンピュータで解く〜

5381bd68abe2b91239ca1600db2a890d?s=128

tsurubee

October 01, 2019
Tweet

Transcript

  1. 1.

    ͘͞ΒΠϯλʔωοτגࣜձࣾ (C) Copyright 1996-2019 SAKURA Internet Inc ͘͞ΒΠϯλʔωοτݚڀॴ ʮConnecting The

    Dotsʯ͠Α͏ʂ ʙ৘ใγεςϜͷະղܾ໰୊Λࡐྉ޻ֶɼػցֶशɼྔࢠίϯϐϡʔλͰղ͘ʙ 2019/10/01 ݚڀһ ௽ాതจ FGNΤϯδχΞMeetup vol.3
  2. 2.

    2 1. ࣗݾ঺հɾܦྺ঺հ 2. Connecting The Dotsͱ͸ 3. ఺Λଧͭ 4.

    ఺Λͭͳ͙ 5. ࢲ͕ମײͨ͠Connecting The Dots 6. ࠓޙ΍Γ͍ͨݚڀʹ͍ͭͯ ໨࣍
  3. 14.

    14 Connecting The Dots You can’t connect the dots looking

    forward; you can only connect them looking backwards. So you have to trust that the dots will somehow connect in your future. You have to trust in something — your gut, destiny, life, karma, whatever. This approach has never let me down, and it has made all the difference in my life. εςΟʔϒɾδϣϒζࢯ͕2005೥ʹελϯϑΥʔυେֶͷଔۀࣜͰ ߦͳͬͨεϐʔνΑΓ
  4. 24.

    24 ఺Λͭͳ͙ Ͳ͏΍ͬͯͭͳ͙ͷ͔ʁ • ઓུతʹͭͳ͙͜ͱ͸೉͘͠ɼͭͳ͕Δͱ৴ͯ͡఺Λ ଧͪଓ͚Δ • ͱ͸͍͑ɼաڈͷܦݧ΍஌ࣝΛϓϥεʹม͍͑ͨͱ͍͏ ϚΠϯυηοτ͸ॏཁͩͱࢥ͏ •

    ࣗ෼͕જࡏతʹϫΫϫΫΛײ͡Δ෼໺ʹ఺Λଧ͓ͬͯ͘ ͱ͋ͱ͔Βͭͳ͕Δ֬཰͕ߴ͍ͷͰ͸ͳ͍͔ ͜͜͸͜Ε͔Β΋ࢼߦࡨޡ͍ͯ͘͠ϙΠϯτͩͱߟ͍͑ͯΔ
  5. 26.
  6. 27.

    27 ྔࢠΞχʔϦϯά • ྔࢠΞχʔϦϯάͱ͸ɼྔࢠྗֶͷ๏ଇΛར༻ͯ͠ɼ͋Δछͷ৘ใॲཧΛ ͢ΔͨΊͷ࿮૊ΈͰ͋Δ ྔࢠΞχʔϦϯάͱ͸ https://arxiv.org/abs/cond-mat/9804280 ྔࢠΞχʔϦϯά͸1998೥ͷ࿦จͰ೔ຊਓ͕ ཧ࿦ΛߟҊͨ͠ •

    ૊Έ߹Θͤ࠷దԽ໰୊ʹର͢ΔϝλώϡʔϦεςΟοΫͳղ๏ͱͯ͠
 ஫໨͞Ε͍ͯΔ ྔࢠίϯϐϡʔλͱͷؔ܎ • ྔࢠίϯϐϡʔλʹ͸൚༻ܭࢉػΛ໨ࢦ͢ʮྔࢠ ήʔτํࣜʯͱ૊Έ߹Θͤ࠷దԽ໰୊ʹಛԽͨ͠ ʮྔࢠΞχʔϦϯάํࣜʯ͕͋Δ • ͨͩ͠ɼྔࢠΞχʔϦϯάΛઐ໳ʹ΍͍ͬͯΔํʑ ͸ΞχʔϦϯάϚγϯΛྔࢠίϯϐϡʔλͱݺ͹ ͳ͍͜ͱ͕ଟ͍
  7. 28.

    28 ࡐྉ޻ֶͱͷͭͳ͕Γ ྔ ࢠ Ξ χ ʔ Ϧ ϯ ά

    ࣗવՊֶͱ৘ใ޻ֶͷͭͳ͕ΓΛॳΊͯײͯ͡خ͔ͬͨ͠
 աڈʹਅ݋ʹֶΜͰͯΑ͔ͬͨͱࢥ͑ͨ • ྔࢠྗֶ͸ݪࢠ΍ిࢠͳͲͷৼΔ ෣͍Λهड़͢Δྗֶ • ࡐྉͷઃܭʹ͸ݪࢠ΍ͦΕΒ͕࿈ ͳͬͨ෼ࢠ࠯ͷৼΔ෣͍Λ੍ޚ͢ Δඞཁ͕͋Δ • ྔࢠྗֶͷॾݪཧΛԽֶʹద༻͢ ΔʮྔࢠԽֶʯͱ͍͏ཧ࿦Խֶͷ ෼໺΋͋Δ • ΞχʔϦϯάͱ͸ʮম͖ͳ·͠ʯͷ͜ ͱͰ͋Γɼࡐྉͷ෺ੑΛ҆ఆͤ͞Δͨ ΊͷॏཁͳޙॲཧͷϓϩηεͰ͋Δ • ࢲ͕ݚڀ͍ͯͨ͠ߴ෼ࢠࡐྉͰ΋੒ܕ Ճ޻ޙʹඞͣ೤ΞχʔϦϯάΛࢪͯ͠ ͍ͨ • ೤ΞχʔϦϯάΛར༻ͨ͠࠷దԽख๏ ʹγϛϡϨʔςΟουΞχʔϦϯά͕ ͋Δ
  8. 31.

    31 ݚڀͷίϯηϓτ ৘ใγεςϜͷ՝୊ɾ໰୊ Solver Problems ࡐྉ޻ֶ ৘ใ޻ֶ ྔࢠԽֶ ػցֶश ྔࢠίϯϐϡʔλ

    ྔࢠΞχʔϦϯά ৘ใγεςϜʹ͓͚Δະղܾͳ໰୊Λࡐྉ޻ֶɼػցֶशɼྔࢠίϯϐϡʔλͳͲɼ
 ͞·͟·ͳ஌ࣝ΍ٕज़Λۦ࢖ͯ͠ղܾ͢ΔSolverͱͯ͠ͷཱͪҐஔΛ໨ࢦ͢ Πϯϑϥ ϓϩάϥϛϯά ౷ܭྗֶ ෺ཧԽֶ
  9. 32.

    32 ࠓޙͷݚڀςʔϚ എܠ ෺ཧϚγϯʹίϯςφΛͲͷΑ͏ʹ഑ஔ ͢Δ͔ΛφοϓαοΫ໰୊ͱͯ͠Ҩ఻త ΞϧΰϦζϜͰ࠷దԽ͢Δ ελςΟοΫͳঢ়گͷΈͰ࠷దղΛٻΊͯΑ͍ͷ͔ʁ
 ٻΊͨղ͕ෆ࣮֬ͳকདྷʹରͯ͠΋҆ఆͳղΛ΋ͨΒ͢ͷ͔ʁ ※1 C.

    Guerrero et al.: Genetic Algorithm for Multi-Objective Optimization of Container Allocation in Cloud Architecture, Journal of Grid Computing, Vol. 16, 113-135 2018. ண؟఺ কདྷͷෆ֬ఆੑΛड͚ೖΕͯ௕ظత ͳࢹ఺Ͱܧଓతʹ࠷దԽ͍ͯ͘͠ Container Node ίϯςφͳͲͷԾ૝Խٕज़ͷීٴ΍ϚΠΫϩαʔϏεԽͳͲʹ൐͍ɼWebαʔϏεΛࢧ͑Δ Πϯϑϥ͸ෳࡶԽ͍ͯ͠Δɽ
 ෳࡶԽͨ͠γεςϜߏ੒ΛػցֶशͰ࠷దԽ͢Δݚڀ͕ߦΘΕ͍ͯΔ※1 Ϣʔβ͔Βͷଟ༷ͳཁٻ΍ϋʔυ΢ΣΞো֐ͳͲ༷ʑͳมԽʹ௥ै͢Δ͜ͱ͕ٻΊΒΕΔɽ
 ex. αʔόͷεέʔϧΞ΢τɼϚΠάϨʔγϣϯɼ৽͍͠ϩʔϧͷ௥ՃͳͲ
  10. 33.

    • େن໛ͳ૊Έ߹Θͤ࠷దԽ໰୊Λߴ଎ʹղ͘͜ͱ͕ظ଴͞ΕΔ※1 33 ࠓޙͷݚڀςʔϚ ࠷దԽ໰୊ͷղͷϩόετੑʹண໨͠ɼಈతʹมԽ͢ΔγεςϜ ؀ڥʹ͓͍ͯɼߴ͍ੑೳΛҡ࣋͠ͳ͕Βܧଓతʹ࠷దԽՄೳͳ ࢓૊ΈΛ࣮ݱ͢Δ ྔࢠΞχʔϦϯάͷಛ௃ ྔࢠΞχʔϦϯά͸જࡏతʹϩόετͳղ͕ಘ΍͍͢͜ͱ ͕஌ΒΕ͍ͯΔ※3

    • جఈঢ়ଶ͕ॖୀ͍ͯ͠Δ৔߹ʹɼภͬͨղ͕ಘΒΕΔ※2ʢΞϯϑΣΞαϯϓϦϯάʣ ※1 V. S. Denchev et al.: What is the Computational Value of Finite Range Tunneling?, Phys. Rev. X, Vol. 6, 031015 2016.
 ※2 B. H. Zhang et al.: Advantages of Unfair Quantum Ground-State Sampling, Scientific Reports, Vol. 7, 1044 2017.
 ※3 Y. Matsuda et al.: Ground-state statistics from annealing algorithms: quantum versus classical approaches, New Journal of Physics, Vol. 11, 073021 2009. https://link.springer.com/content/pdf/10.1007/s10898-009-9496-x.pdf ղͷੑೳ͕ύϥϝʔλมಈʹରͯ͠ ؤڧͰ͋Γɼܥͷ҆ఆΛҡ࣋ͨ͠· ·༰қʹ૊Έ׵͑ՄೳͰ͋Δ
  11. 34.

    34 ·ͱΊ • ఺Λଧͭ͜ͱͷେ੾͞ • ͱʹ͔͘ଧͪଓ͚Δ • ࣗ෼͕ࠓ͍ΔҐஔ΍ಘҙ෼໺͔Β཭Εͨͱ͜Ζʹଧͭ • ఺Λͭͳ͙͜ͱͷେ੾͞

    • ఺Λͭͳ͙͜ͱͰ૑ൃతωοτϫʔΫ͕ܗ੒͞ΕΔ • ઓུతʹ఺Λͭͳ͙͜ͱ͸೉͍͕͠જࡏతʹϫΫϫΫΛײ͡Δ
 ෼໺ʹ఺Λଧ͓ͬͯ͘ͱΑ͍ • ࠓޙݚڀΛόʔϯͱ΍͍ͬͯ͘ͷͰ·ͨͲ͔͜Ͱ͓࿩͠͠·͢ʂ