量子計算機記録

6074 ワード
量子計算機 量子計算機 テキストリンク

Quantum Annealing Applications with the DW-2000Q
Dr. Edward Dahl

A new model of quantum computing annealing
西森 秀稔
http://www.qa.iir.titech.ac.jp/~nishimori/

Quantum & classical programming models
Quantum hamiltonian is a operator on herbert space

Ocado, Hartree Centre

Machine Learning
Material Simulation

cloud quantum computing at
https://cloud.dwavesys.com

next generation topology

chinera
Pegasus

Quantum Supremacy

Quantum Diversity

p.s.

Introduction to Quantum Annealing
https://docs.dwavesys.com/docs/latest/c_gs_2.html

How The Quantum Annealing Process Works
https://www.youtube.com/watch?v=UV_RlCAc5Zs

Physics of Quantum Annealing - Hamiltonian and Eigenspectrum
https://www.youtube.com/watch?v=tnikftltqE0

量子アニーリングまとめのまとめ
http://kashalpha.wp.xdomain.jp/quantum_annealing/

量子アニーリング ナレッジベース へようこそ
https://qard.is.tohoku.ac.jp/T-Wave/

Quantum annealing
https://arxiv.org/pdf/1404.2465.pdf

量子アニーリングにおける量子効果
東京工業大学理学院 物理学系 須佐友紀
http://www.kurims.kyoto-u.ac.jp/~kyodo/kokyuroku/contents/pdf/2059-11.pdf

量子コンピュータの新潮流：
量子アニーリングとD-Wave
The New Trend of Quantum Computing:
Quantum Annealing and D-Wave
宇都宮　聖子 国立情報学研究所情報学プリンシプル研究系
Shoko Utsunomiya Principles of Informatics Research Division, National Institute of Informatics.

Quantum Algorithm Zoo全訳　近似アルゴリズム、シミュレーションアルゴリズム
https://www.qmedia.jp/approximation-simulation-algorithms/

• Programming Environment
http://www.frontier.phys.nagoya-u.ac.jp/jp/leading/files/LDS-20170316-Dahl.pdf

Quantum Annealing
NSF/DOE Quantum Science Summer School
http://qs3.mit.edu/images/pdf/QS3-2017---Pakin-Lecture.pdf

28th Annual CSP Workshop on “Recent Developments in Computer Simulation Studies in Condensed Matter Physics”, CSP 2015
A Study of Spanning Trees on a D-Wave Quantum Computer J.S. Halla, M.A. Novotnya,*, T. Neuhausb, Kristel Michielsenb

References
[1] http://www.dwavesys.com
[2] Broder A. Generating random spanning trees. 30th Annual Symposium on Foundations of Computer Science 1989; 442-447.
[3] Pemantle R. Choosing a spanning tree for the integer lattice uniformly. Ann. Probab. 1991; 19:1559-1574.
[4] Wilson DB. Generating random spanning trees more quickly than the cover time. Proceedings of the Twenty-eighth Annual ACM Symposium on the Theory of Computing 1996; 296-303.
[5] Ronnow TF, Wang Z, Job J, Isakov SV, Wecker D, Martinis JM, Lidar DA, Troyer M. Defining and detecting quantum speedup. Science 2014; 345:420-424.
[6] Johnson MW, et al. Quantum annealing with manufactured spins. Nature 2011; 473:194-198.
[7] Lanting T, et al. Entanglement in a quantum annealing processor. Phys. Rev. X 2014; 4.
[8] Bian Z, Chudak F, Israel R, Lackey B, Macready WG, Roy A. Discrete optimization using quantum annealing on sparse Ising models. Front.
Phys. 2014; 2.
[9] https://oeis.org. The authors thank Dr. Edward D. Dahl of D-Wave for pointing this out.
[10] Boixo S, Ronnow TF, Isakov SV, Wang Z, Wecker D, Lidar DA, Martinis JM, and Troyer M. Evidence for quantum annealing with more
than one hundred qubits. Nature Physics 2014; 10:218.
[11] Rieffel EG, Venturelli D, O’Gorman B, Do MB, Pristay EM, Smelyanskiy VN. A case study in programming a quantum annealer for hard
operational planning problems. Quant. Inf. Process. 2014; 14:1-36.
[12] Rieffel EG, Polak W. Quantum Computing: A Gentle Introduction. MIT Press; 2011.
[13] Hen I, Job J, Albash T, Ronnow TF, Troyer M, Lidar DA. Probing for quantum speedup in spin glass problems with planted solutions.
arXiv:1502.01663v2.