Zobrazeno 1 - 10
of 42
pro vyhledávání: '"Robert Rand"'
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 287, Iss Proc. QPL 2018, Pp 299-312 (2019)
Common quantum algorithms make heavy use of ancillae: scratch qubits that are initialized at some state and later returned to that state and discarded. Existing quantum circuit languages let programmers assert that a qubit has been returned to the |0
Externí odkaz:
https://doaj.org/article/458893be75f44370a4675a0bc3b8d22e
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 266, Iss Proc. QPL 2017, Pp 119-132 (2018)
We describe an embedding of the QWIRE quantum circuit language in the Coq proof assistant. This allows programmers to write quantum circuits using high-level abstractions and to prove properties of those circuits using Coq's theorem proving features.
Externí odkaz:
https://doaj.org/article/af407acf1db94a06a933dd8398b41c9e
Publikováno v:
Proceedings of the ACM on Programming Languages. 7:921-951
We introduce Qunity, a new quantum programming language designed to treat quantum computing as a natural generalization of classical computing. Qunity presents a unified syntax where familiar programming constructs can have both quantum and classical
Publikováno v:
IEEE Journal on Emerging and Selected Topics in Circuits and Systems. 12:584-601
Universal and fault-tolerant quantum computation is a promising new paradigm that may efficiently conquer difficult computation tasks beyond the reach of classical computation. It motivates the development of various quantum technologies. The rapid p
Publikováno v:
Proceedings of the National Academy of Sciences. 120
Quantum computing technology may soon deliver revolutionary improvements in algorithmic performance, but it is useful only if computed answers are correct. While hardware-level decoherence errors have garnered significant attention, a less recognized
Publikováno v:
Electronic Proceedings in Theoretical Computer Science. 340:279-290
The Heisenberg representation of quantum operators provides a powerful technique for reasoning about quantum circuits, albeit those restricted to the common (non-universal) Clifford set H, S and CNOT. The Gottesman-Knill theorem showed that we can us
Publikováno v:
Proceedings of the ACM on Programming Languages. 5:1-29
We present VOQC, the first fully verified optimizer for quantum circuits, written using the Coq proof assistant. Quantum circuits are expressed as programs in a simple, low-level language called SQIR, a simple quantum intermediate representation, whi
Publikováno v:
Kartik Singhal
Q# is a standalone domain-specific programming language from Microsoft for writing and running quantum programs. Like most industrial languages, it was designed without a formal specification, which can naturally lead to ambiguity in its interpretati
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0cbff3818e337a23771bfe7420d1c2d7
http://arxiv.org/abs/2206.03532
http://arxiv.org/abs/2206.03532
Autor:
Robert Rand
Publikováno v:
Proceedings of the 31st ACM SIGPLAN International Conference on Compiler Construction.
Autor:
Robert Rand
Examines Japan's war generation—Japanese men and women who survived World War Two and rebuilt their lives, into the 21st century, from memories of that conflict Since John Hersey's Hiroshima—the classic account, published in 1946, of the aftermat