Zobrazeno 1 - 10
of 53
pro vyhledávání: '"Amy, Matthew"'
Implementations of Roetteler's shifted bent function algorithm have in recent years been used to test and benchmark both classical simulation algorithms and quantum hardware. These circuits have many favorable properties, including a tunable amount o
Externí odkaz:
http://arxiv.org/abs/2408.02778
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
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
Autor:
Amy, Matthew
Publikováno v:
EPTCS 384, 2023, pp. 127-141
Vilmart recently gave a complete equational theory for the balanced sum-over-paths over Toffoli-Hadamard circuits, and by extension Clifford+Rz(2pi/2^k) circuits. Their theory is based on the phase-free ZH-calculus which crucially omits the average r
Externí odkaz:
http://arxiv.org/abs/2306.16369
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
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
Autor:
Amy, Matthew, Ross, Neil J.
Publikováno v:
Phys. Rev. A 104, 052602 (2021)
The reversible implementation of classical functions accounts for the bulk of most known quantum algorithms. As a result, a number of reversible circuit constructions over the Clifford+$T$ gate set have been developed in recent years which use both t
Externí odkaz:
http://arxiv.org/abs/2105.13410
Autor:
Amy, Matthew, Gheorghiu, Vlad
Publikováno v:
Quantum Science and Technology, Focus on Quantum Software, 5, 034016 (2020)
We describe 'staq', a full-stack quantum processing toolkit written in standard C++. 'staq' is a quantum compiler toolkit, comprising of tools that range from quantum optimizers and translators to physical mappers for quantum devices with restricted
Externí odkaz:
http://arxiv.org/abs/1912.06070
Publikováno v:
Quantum 4, 252 (2020)
Kliuchnikov, Maslov, and Mosca proved in 2012 that a $2\times 2$ unitary matrix $V$ can be exactly represented by a single-qubit Clifford+$T$ circuit if and only if the entries of $V$ belong to the ring $\mathbb{Z}[1/\sqrt{2},i]$. Later that year, Gi
Externí odkaz:
http://arxiv.org/abs/1908.06076
Autor:
Amy, Matthew
Publikováno v:
Thomsen M., Soeken M. (eds) Reversible Computation. RC 2019. Lecture Notes in Computer Science, vol 11497. Springer, Cham
One of the most fundamental aspects of quantum circuit design is the concept of families of circuits parametrized by an instance size. As in classical programming, metaprogramming allows the programmer to write entire families of circuits simultaneou
Externí odkaz:
http://arxiv.org/abs/1908.02644