Researchers in Programming Languages and Compilers
Below are links to home pages of researchers working on programming language theory, design, implementation, and related areas. Disclaimer: this list is not exhaustive! Please let me know if you would like to be added to this list, or if you would like an existing entry modified or deleted. Back to the language research page Related Pages The SEL-HPC list of home pages of functional language resea
Physics 219 Course Information
Course Information for Physics 219/Computer Science 219 Quantum Computation (Formerly Physics 229) John Preskill Go to the home page of Ph219/CS219 for 2019-20. Home pages from previous years: 2018 (fall term) 2018 (spring term) 2017 (winter and spring terms) 2015-16 (winter term) 2013-14 (fall and winter terms) 2011 (winter term) 2008-09 (three terms) 2006-07 (fall and winter terms) 2005-06 (fall
Quantum Algorithm Implementations for Beginners
As quantum computers become available to the general public, the need has arisen to train a cohort of quantum programmers, many of whom have been developing classical computer programs for most of their careers. While currently available quantum computers have less than 100 qubits, quantum computing hardware is widely expected to grow in terms of qubit count, quality, and connectivity. This review
グラフマッピング - 技術リソース - Amplify - é‡åアニーリングã¨å…±ã«é€²åŒ–ã™ã‚‹ã‚¯ãƒ©ã‚¦ãƒ‰
解ããŸã„組åˆã›æœ€é©åŒ–å•é¡Œã‚’イジング模型ã«è¡¨ç¾ã—ãŸã¨ã—ã¦ã‚‚ã€ãƒžã‚·ãƒ³ã«ã‚ˆã£ã¦ã¯å¤‰æ•°ãƒŽãƒ¼ãƒ‰é–“ã§çµåˆãŒè‡ªç”±ã«ä½œæˆã§ããªã„å ´åˆãŒã‚ã‚Šã¾ã™ã€‚ã“ã‚Œã¯ãƒžã‚·ãƒ³ãŒãƒ“ットé…置をéžå®Œå…¨ã‚°ãƒ©ãƒ•ã§å®Ÿè£…ã—ã¦ã„ã‚‹ãŸã‚ã§ã™ã€‚ã“ã“ã§ã¯éžå®Œå…¨ã‚°ãƒ©ãƒ•ä¸Šã®ã‚¤ã‚¸ãƒ³ã‚°æ¨¡åž‹ã«ãŠã„ã¦ã€ã©ã®ã‚ˆã†ã«ã—ã¦ä»»æ„ã®å¤‰æ•°ãƒŽãƒ¼ãƒ‰é–“ã§çµåˆã‚’作æˆã™ã‚‹ã‹ã«ã¤ã„ã¦èª¬æ˜Žã—ã¾ã™ã€‚ 複数ノードã«ã‚ˆã‚‹ãƒã‚§ã‚¤ãƒ³ # 例ã¨ã—ã¦ã€äºŒæ¬¡å…ƒæ£æ–¹æ ¼å上ã«å¤‰æ•°ãƒŽãƒ¼ãƒ‰ãŒé…ç½®ã•ã‚Œã¦ã„るグラフã§å®Ÿè£…ã•ã‚ŒãŸãƒžã‚·ãƒ³ãŒã‚ã£ãŸã¨ã—ã¾ã™ã€‚ã“ã®ãƒžã‚·ãƒ³ã§ã¯ä¸Šä¸‹å·¦å³ã®çµåˆã®ã¿ãŒè¨±ã•ã‚Œã¦ã„ã¾ã™ã€‚ãã®ãŸã‚ã€ä¾‹ãˆã°ä¸‰è§’æ ¼å上ã®ã‚¤ã‚¸ãƒ³ã‚°æ¨¡åž‹ã¯ãã®ã¾ã¾ã§ã¯åŸ‹ã‚込むã“ã¨ãŒå‡ºæ¥ã¾ã›ã‚“。 ã“ã®å ´åˆã®å¯¾å‡¦æ³•ã¨ã—ã¦ã€éš£æŽ¥ã—ãŸè¤‡æ•°ã®ãƒŽãƒ¼ãƒ‰ã‚’一ã¤ã®ãƒŽãƒ¼ãƒ‰ã¨ã¿ãªã™ã¨ã„ã†æ–¹æ³•ãŒä½¿ã‚ã‚Œã¾ã™ã€‚ 上図ã«ãŠã„ã¦æ£æ–¹æ ¼åã¸ã®ãƒžãƒƒãƒ”ングã®ä¸€ä¾‹ã‚’図示ã—ã¾ã™ã€‚å·¦ã®ä¸‰è§’å½¢ã®é ‚点ã¯æ£æ–¹æ ¼å上ã®å¯¾å¿œã™ã‚‹è‰²ã®é ‚点ã«ãƒžãƒƒãƒ”ングã•ã‚Œã¦ã„ã¾ã™ã€‚左図ä¸å¤®ã®é’ã„ノ
A Lambda Calculus for Quantum Computation
View PDF Abstract: The classical lambda calculus may be regarded both as a programming language and as a formal algebraic system for reasoning about computation. It provides a computational model equivalent to the Turing machine, and continues to be of enormous benefit in the classical theory of computation. We propose that quantum computation, like its classical counterpart, may benefit from a ve
qlambdabook.dvi
1 Quantum Lambda Calculus Peter Selinger Dalhousie University, Canada Benoı̂t Valiron INRIA and EÌcole Polytechnique, LIX, Palaiseau, France. Abstract We discuss the design of a typed lambda calculus for quantum compu- tation. After a brief discussion of the role of higher-order functions in quantum information theory, we define the quantum lambda calculus and its operational semantics. Safety inv
å…±åŒç™ºè¡¨ï¼šé‡åコンピュータã®ãƒ‡ãƒãƒƒã‚°ã‚’高速化～速ã„ãŒã‚†ãˆã®ã‚¸ãƒ¬ãƒ³ãƒžã‚’解消～
ãƒã‚¤ãƒ³ãƒˆ é‡åコンピュータã®å†…部ã§ç™ºç”Ÿã™ã‚‹é‡åçš„ãªã‚¨ãƒ©ãƒ¼ã®å½±éŸ¿ã®è¿½è·¡ã¯å›°é›£ã ã¨è€ƒãˆã‚‰ã‚Œã¦ã„ãŸãŒã€æ£ç¢ºã‹ã¤é«˜é€Ÿã«è©•ä¾¡ã™ã‚‹æ•°å€¤è¨ˆç®—手法を新ãŸã«æ案ã—ãŸã€‚ 複雑ãªé‡ãåˆã‚ã›çŠ¶æ…‹ã®ä¸ã«ã¯ã€ã€Œè¦‹ã‹ã‘ã ã‘ã®ã€é‡ãåˆã‚ã›çŠ¶æ…‹ãŒã‚ã‚‹ã“ã¨ã‚’æ–°ãŸã«ç™ºè¦‹ã—ãŸã€‚ã“ã‚Œã¯é‡åコンピュータã®é«˜é€ŸåŒ–ã®åŽŸç†ã®ç†è§£ã«ä¸€æ©è¿‘ã¥ãæˆæžœã§ã‚る。 本手法ã«ã‚ˆã‚Šã€é‡åコンピュータ実ç¾ã®ãŸã‚ã«åŸºæœ¬ç´ åã«è¦æ±‚ã•ã‚Œã‚‹æ€§èƒ½ã‚’具体的ã«è¨ˆç®—ã™ã‚‹ã“ã¨ãŒå¯èƒ½ã«ãªã‚Šã€é‡åコンピュータ開発ã®é€²å±•ã«å¯„与ã™ã‚‹ã¨æœŸå¾…ã•ã‚Œã‚‹ã€‚ é‡åコンピュータ注１）ã¯ã€é‡å力å¦ã®é‡ãåˆã‚ã›ã®åŽŸç†ã‚’活用ã—ã¦è¨ˆç®—ã‚’è¡Œã†æŠ€è¡“ã§ã€ç´ å› æ•°åˆ†è§£ã‚„é‡å化å¦è¨ˆç®—ãªã©ã®å•é¡Œã‚’ã€ç¾ä»£ã®ã‚らゆるコンピュータよりも高速ã«è§£ã‘ã‚‹ã“ã¨ãŒæœŸå¾…ã•ã‚Œã¦ã„ã‚‹ãŸã‚ã€ãã®é–‹ç™ºãŒä¸–ç•Œã§ç››ã‚“ã«é€²ã‚られã¦ã„ã¾ã™ã€‚実際ã®é‡åコンピュータã¯ã€ã‚ãšã‹ã«ã‚¨ãƒ©ãƒ¼ã‚’ã‚‚ã¤ç´ å（é‡åビット注２））を組ã¿åˆã‚ã›ã¦ä½œã‚‰ã‚Œã‚‹ã®ã§ã€ãれを訂æ£ã—ãª
prakashfest
Ross Duncan ◠PrakashFest ◠Oxford 2014 The non-logic of quantum computation OR: How I learned to live without propositions-as-types Ross Duncan Mathematically Structured Programming Group University of Strathclyde Ross Duncan ◠PrakashFest ◠Oxford 2014 2004 The 1st occasional Bellairs workshop on semantic techniques in quantum computing †“ Ross Duncan ◠PrakashFest ◠Oxford 2014 Ross Duncan ◠P
Quantum Computation and Information Theory Course
(Spring Term 2014) Physics Department, Carnegie Mellon University Department of Physics and Astronomy, University of Pittsburgh This course is offered by the Physics Department of Carnegie-Mellon University, with assistance from the Computer Science Department and the Department of Physics and Astronomy of the University of Pittsburgh. The level is appropriate for advanced undergraduates and begin
å¼±ã„é‡åコンピューターã¯ã©ã®ãらã„å¼·ã„ã®ã‹ï¼Ÿ – é‡åã‚¹ãƒ—ãƒ¬ãƒžã‚·ãƒ¼ç ”ç©¶ã®æœ€å‰ç·š
é‡åコンピューターã¨ã¯ã€åŽŸåや分åã€å…‰ãªã©ã€ãƒŸã‚¯ãƒãªä¸–界を記述ã™ã‚‹é‡å力å¦ã«åŸºã¥ã„ã¦å‹•ä½œã™ã‚‹ã‚³ãƒ³ãƒ”ューターã®ã“ã¨ã§ã‚ã‚Šã€ç¾åœ¨æˆ‘々ãŒä½¿ã£ã¦ã„るコンピューター（å¤å…¸ã‚³ãƒ³ãƒ”ューターã¨å‘¼ã°ã‚Œã¾ã™ï¼‰ã‚’ã¯ã‚‹ã‹ã«å‡Œé§•ã™ã‚‹è¨ˆç®—能力をæŒã¤ã¨æœŸå¾…ã•ã‚Œã¦ã„ã¾ã™ã€‚ é‡å計算ã®ç ”究者ãŸã¡ãŒç›®æŒ‡ã™ç©¶æ¥µã®ã‚´ãƒ¼ãƒ«ã®ã²ã¨ã¤ã¯ã€å¤§é‡ã®é‡åビットã‹ã‚‰ãªã‚‹ãƒ¦ãƒ‹ãƒãƒ¼ã‚µãƒ«é‡åコンピューターを作るã“ã¨ã§ã™ã€‚ユニãƒãƒ¼ã‚µãƒ«é‡åコンピューターã¨ã„ã†ã®ã¯ã€ä»»æ„ã®é‡åアルゴリズムを走らã›ã‚‹ã“ã¨ã®ã§ãる汎用ã®é‡åコンピューターã®ã“ã¨ã§ã™ã€‚ã—ã‹ã—ãªãŒã‚‰ã€å¤§é‡ã®é‡åビットを自由自在ã«æ“る汎用ã®é‡åコンピューターを実験室ã§ã¤ãã‚‹ã®ã¯ã¾ã ã¾ã 技術的ã«é›£ã—ãã€å®Ÿç¾ã•ã‚Œã¦ã„ãªã„ã®ãŒç¾çŠ¶ã§ã™ã€‚ ãã“ã§ã€ãƒ¦ãƒ‹ãƒãƒ¼ã‚µãƒ«ã§ãªãã¦ã‚‚よã„ã‹ã‚‰ã€ã¾ãŸã€é‡åビットã®æ•°ã‚‚ãã‚Œã»ã©å¤šããªãã¦ã‚‚よã„ã‹ã‚‰ã€ä½•ã‹ã€ç¾åœ¨ã‚‚ã—ãã¯è¿‘ã„å°†æ¥ã®æŠ€è¡“ã®ã¿ã§å®Ÿç¾ã§ãるよã†ãªã€Œå¼±ã„ã€é‡åコンピュー
リリースã€éšœå®³æƒ…å ±ãªã©ã®ã‚µãƒ¼ãƒ“スã®ãŠçŸ¥ã‚‰ã›
最新ã®äººæ°—エントリーã®é…ä¿¡
j次ã®ãƒ–ックマーク
kå‰ã®ãƒ–ックマーク
lã‚ã¨ã§èªã‚€
eコメント一覧を開ã
oページを開ã
[quant-ph/0507171] An Introduction to Cartan's KAK Decomposition for QC Programmers
力扣 (LeetCode) å…¨çƒæžå®¢æŒšçˆ±çš„技术æˆé•¿å¹³å°
https://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.887.3091&rep=rep1&type=pdf
http://www2.yukawa.kyoto-u.ac.jp/ws/2013/yitpqip/pdf/fujii.pdf
Second Law-Like Inequalities with Quantum Relative Entropy: An Introduction
物ç†ã¨ã‹
Shota Nagayama's Shota Nagayama's Quantum Internet Research Lab. - 猫ã§ã‚‚ã‚ã‹ã‚‹ Surface Code é‡å計算
QCoDeS 0.51.0.dev128 documentation
Chris Ferrie on Twitter: "Most estimators are inadmissible. Quantum tomography will never be the same. https://t.co/n8lXonycGG"
Simon Gay's Bibliography on Quantum Programming Languages
{{#tags}}- {{label}}
{{/tags}}