John Baez's Stuff
John Baez’s Stuff I'm a mathematical physicist. Among other things, I study networks and help researchers use them in scientific software, such as quickly adaptable models of infectious disease. I am a Professor of the Graduate Division but not accepting new students at this time. In the fall of 2023 I had a Leverhulme Visiting Professorship and gave a series of lectures on mathematics at the Univ
ofmind.net
ofmind.net 2020 Copyright. All Rights Reserved. The Sponsored Listings displayed above are served automatically by a third party. Neither the service provider nor the domain owner maintain any relationship with the advertisers. In case of trademark issues please contact the domain owner directly (contact information can be found in whois). Privacy Policy
Simon Gay's Bibliography on Quantum Programming Languages
This bibliography was originally compiled in association with my article Quantum Programming Languages: Survey and Bibliography (Mathematical Structures in Computer Science 16(4), 2006). Its original topic was quantum programming languages, but this has widened to include semantics of quantum computation and structural approaches to quantum computing. The complete bibliography as a BibTeX file is
Fable · JavaScript you can be proud of!
Fable is a compiler that brings F# into the JavaScript ecosystem Functional programming and more Immutable by default. Powerful pattern matching. Lightweight syntax. Units of measure. Type providers. Enjoy. Type safety without the hassle Type inference provides robustness and correctness, but without the cost of additional code. Let the compiler catch bugs for you.
Lecture Notes in Computing Model
〒101-8430 東京都 千代田区 一ツ橋 2-1-2 国立情報学研究所 副所長 / 情報社会相関研究系 教授 佐藤一郎
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
Joe Duffy - Blogging about Midori
Founder/CEO Pulumi • Cloud, languages, and developer tools guy • Eat, sleep, code, repeat Enough time has passed that I feel safe blogging about my prior project here at Microsoft, “Midori.” In the months to come, I’ll publish a dozen-or-so articles covering the most interesting aspects of this project, and my key take-aways. Midori was a research/incubation project to explore ways of innovating t
グラフマッピング - 技術リソース - Amplify - 量子アニーリングと共に進化するクラウド
解きたい組合せ最適化問題をイジング模型に表現したとしても、マシンによっては変数ノード間で結合が自由に作成できない場合があります。これはマシンがビット配置を非完全グラフで実装しているためです。ここでは非完全グラフ上のイジング模型において、どのようにして任意の変数ノード間で結合を作成するかについて説明します。 複数ノードによるチェイン # 例として、二次元正方格子上に変数ノードが配置されているグラフで実装されたマシンがあったとします。このマシンでは上下左右の結合のみが許されています。そのため、例えば三角格子上のイジング模型はそのままでは埋め込むことが出来ません。 この場合の対処法として、隣接した複数のノードを一つのノードとみなすという方法が使われます。 上図において正方格子へのマッピングの一例を図示します。左の三角形の頂点は正方格子上の対応する色の頂点にマッピングされています。左図中央の青いノ
Closure Conversion as CoYoneda
2017-08-28 :: Yoneda, coYoneda, category theory, compilers, closure conversion, math By: Max New The continuation-passing style transform (cps) and closure conversion (cc) are two techniques widely employed by compilers for functional languages, and have been studied extensively in the compiler correctness literature. Interestingly, typed versions of each can be proven to be equivalence preserving
25日目: 自作コンパイラ、自作エミュ、自作CPUの結合 - しかくいさんかく
この記事はひとりでCPUとエミュレータとコンパイラを作る Advent Calendar 2017の25日目の記事です。 いよいよ最終日。 まず復習を兼ねて、今までの記事を振り返りながら、C言語から半導体までCPUの中を歩く。 最後に自作コンパイラ、自作エミュレータ、自作CPUを結合し、再帰関数でフィボナッチ数を計算する。 25日間の復習 アドベントカレンダーの 初日の記事 に 「普段目にする抽象的なプログラムコードから、CPU内の電圧変動が想像できるようになりたい。」 と書いたので、今までの記事を見返しつつ、C言語から半導体までレイヤーを降りてみる。 C言語からアセンブラまで (18日目-24日目) C言語のサンプルコード int main () { int a ; a = 3 ; return 0 ; } これを1週間かけてアセンブラに変換した。 作ったコンパイラのリポジトリはこれ。
[quant-ph/0307150] A Lambda Calculus for Quantum Computation
(Submitted on 21 Jul 2003 (v1), last revised 3 Apr 2004 (this version, v5)) 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
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く
https://www.kurims.kyoto-u.ac.jp/~terui/summer1.pdf
Arc More Atomic
[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
A lambda calculus for quantum computation | Hacker News
Why C is so Influential - Computerphile