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
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
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
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週間かけてアセンブラに変換した。 作ったコンパイラのリポジトリはこれ。
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 É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
ガチャ、オートマトン、オイラー積分 - Analytic Combinatoricsが面白い - Woodrush’s Blog
Analytic Combinatoricsがめちゃくちゃ面白い。場合の数という離散的なものを数えるのに、連続的世界から生まれた解析学の知見を用いる分野だ。階乗をガンマ関数で表示するだとかいうレベルではなく、マクローリン展開の係数を調べることで場合の数を知るようなことをしている。 オートマトン ハマった発端は「オートマトン理論再考」（新屋, 2017 *1 ）というサーベイ論文。有限状態オートマトンを定めると、そのグラフの形から直接「出力文字列のうち文字のもの」の係数とする母関数が構成でき、それをマクローリン展開すると、文字となる出力の場合の数が直ちにわかるという内容を紹介していた。この結果は文脈自由言語にも拡張でき、生成規則から母関数が機械的に計算でき、その展開係数が文字の場合の数になっているという。場合の数を数えるのになんとマクローリン展開！一体どういうことなのか。 例えば、[1]中で
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ページを開く
https://www.kurims.kyoto-u.ac.jp/~terui/summer1.pdf
[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://hjemmesider.diku.dk/~neil/comp2book2007/book-whole.pdf
https://www.cs.cmu.edu/~fp/courses/linear/handouts/lnd.pdf
Shota Nagayama's Shota Nagayama's Quantum Internet Research Lab. - 猫でもわかる Surface Code 量子計算
https://www.imperial.ac.uk/media/imperial-college/faculty-of-engineering/computing/public/student-projects/Paul-Li%C3%A9tar---Formalizing-Generics-for-Pony.pdf