Zobrazeno 1 - 10
of 146
pro vyhledávání: '"Selinger, Peter"'
The quantum programming language Quipper supports circuit operations such as reversing and control, which allows programmers to control and reverse certain quantum circuits. In addition to these two operations, Quipper provides a function called with
Externí odkaz:
http://arxiv.org/abs/2410.22261
Autor:
Selinger, Peter
We answer the question: what is the longest winning path on a Hex board of size $n\times n$?
Comment: 10 pages
Comment: 10 pages
Externí odkaz:
http://arxiv.org/abs/2408.05601
Autor:
Kornell, Andre, Selinger, Peter
We provide three improvements to the standard implementation of the ground state energy estimation algorithm via Trotter-Suzuki decomposition. These consist of smaller circuit templates for each Hamiltonian term, parallelization of commuting controll
Externí odkaz:
http://arxiv.org/abs/2310.12256
Autor:
Fu, Peng, Selinger, Peter
A well-known problem in the theory of dependent types is how to handle so-called nested data types. These data types are difficult to program and to reason about in total dependently typed languages such as Agda and Coq. In particular, it is not easy
Externí odkaz:
http://arxiv.org/abs/2306.10124
Autor:
Bian, Xiaoning, Selinger, Peter
Publikováno v:
EPTCS 384, 2023, pp. 114-126
We give a presentation by generators and relations of the group of 3-qubit Clifford+CS operators. The proof roughly consists of two parts: (1) applying the Reidemeister-Schreier theorem recursively to an earlier result of ours; and (2) the simplifica
Externí odkaz:
http://arxiv.org/abs/2306.08530
It is well-known that the category of presheaf functors is complete and cocomplete, and that the Yoneda embedding into the presheaf category preserves products. However, the Yoneda embedding does not preserve coproducts. It is perhaps less well-known
Externí odkaz:
http://arxiv.org/abs/2205.06068
Quipper is a functional programming language for quantum computing. Proto-Quipper is a family of languages aiming to provide a formal foundation for Quipper. In this paper, we extend Proto-Quipper-M with a construct called dynamic lifting, which is p
Externí odkaz:
http://arxiv.org/abs/2204.13041
Publikováno v:
EPTCS 394, 2023, pp. 302-342
Quipper and Proto-Quipper are a family of quantum programming languages that, by their nature as circuit description languages, involve two runtimes: one at which the program generates a circuit and one at which the circuit is executed, normally with
Externí odkaz:
http://arxiv.org/abs/2204.13039
Autor:
Bian, Xiaoning, Selinger, Peter
Publikováno v:
EPTCS 394, 2023, pp. 13-28
We give a presentation by generators and relations of the group of Clifford+T operators on two qubits. The proof relies on an application of the Reidemeister-Schreier theorem to an earlier result of Greylyn, and has been formally verified in the proo
Externí odkaz:
http://arxiv.org/abs/2204.02217
Autor:
Demer, Eric, Selinger, Peter
A notion of combinatorial game over a partially ordered set of atomic outcomes was recently introduced by Selinger. These games are appropriate for describing the value of positions in Hex and other monotone set coloring games. It is already known th
Externí odkaz:
http://arxiv.org/abs/2203.13971