5 papers
Polynomial-Time Classical Simulation of Hidden Shift Circuits via Confluent Rewriting of Symbolic Sums
Matthew Amy, Lucas Shigeru Stinchcombe
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…
Linear and non-linear relational analyses for Quantum Program Optimization
Matthew Amy, Joseph Lunderville
The phase folding optimization is a circuit optimization used in many quantum compilers as a fast and effective way of reducing the number of high-cost gates in a quantum circuit.…
A Sound and Complete Equational Theory for 3-Qubit Toffoli-Hadamard Circuits
Matthew Amy, Neil J. Ross, Scott Wesley
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 equatio…
Optimising quantum circuits is generally hard
John van de Wetering, Matt Amy
In order for quantum computations to be done as efficiently as possible it is important to optimise the number of gates used in the underlying quantum circuits. In this paper we fi…
Exact Synthesis of Multiqubit Clifford-Cyclotomic Circuits
Matthew Amy, Andrew N. Glaudell, Shaun Kelso +3
Let be divisible by 4. The Clifford-cyclotomic gate set is the universal gate set obtained by extending the Clifford gates with the -rotation $T_n = \m…