Zobrazeno 1 - 10
of 69
pro vyhledávání: '"Ross, Neil J."'
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
Publikováno v:
EPTCS 406, 2024, pp. 1-43
We give a sound and complete equational theory for 3-qubit quantum circuits over the Toffoli-Hadamard gate set { X, CX, CCX, H }. That is, we introduce a collection of true equations among Toffoli-Hadamard circuits on three qubits that is sufficient
Externí odkaz:
http://arxiv.org/abs/2407.11152
Publikováno v:
EPTCS 406, 2024, pp. 44-62
It is known that the matrices that can be exactly represented by a multiqubit circuit over the Toffoli+Hadamard, Clifford+$T$, or, more generally, Clifford-cyclotomic gate set are precisely the unitary matrices with entries in the ring $\mathbb{Z}[1/
Externí odkaz:
http://arxiv.org/abs/2405.08136
A catalysis state is a quantum state that is used to make some desired operation possible or more efficient, while not being consumed in the process. Recent years have seen catalysis used in state-of-the-art protocols for implementing magic state dis
Externí odkaz:
http://arxiv.org/abs/2404.09915
Autor:
Amy, Matthew, Glaudell, Andrew N., Kelso, Shaun, Maxwell, William, Mendelson, Samuel S., Ross, Neil J.
Let $n\geq 8$ be divisible by 4. The Clifford-cyclotomic gate set $\mathcal{G}_n$ is the universal gate set obtained by extending the Clifford gates with the $z$-rotation $T_n = \mathrm{diag}(1,\zeta_n)$, where $\zeta_n$ is a primitive $n$-th root of
Externí odkaz:
http://arxiv.org/abs/2311.07741
The matrices that can be exactly represented by a circuit over the Toffoli-Hadamard gate set are the orthogonal matrices of the form $M/ \sqrt{2}{}^k$, where $M$ is an integer matrix and $k$ is a nonnegative integer. The exact synthesis problem for t
Externí odkaz:
http://arxiv.org/abs/2305.11305
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
Publikováno v:
EPTCS 394, 2023, pp. 343-362
Path sums are a convenient symbolic formalism for quantum operations with applications to the simulation, optimization, and verification of quantum protocols. Unlike quantum circuits, path sums are not limited to unitary operations, but can express a
Externí odkaz:
http://arxiv.org/abs/2204.14205
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