Matthew Amy

Orcid: 0000-0003-3514-420X

According to our database1, Matthew Amy authored at least 15 papers between 2013 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Complete Equational Theories for the Sum-Over-Paths with Unbalanced Amplitudes.
Proceedings of the Twentieth International Conference on Quantum Physics and Logic, 2023

Improved Synthesis of Toffoli-Hadamard Circuits.
Proceedings of the Reversible Computation - 15th International Conference, 2023

2022
Symbolic Synthesis of Clifford Circuits and Beyond.
Proceedings of the Proceedings 19th International Conference on Quantum Physics and Logic, 2022

2020
Number-Theoretic Characterizations of Some Restricted Clifford+T Circuits.
Quantum, 2020

2019
Formal Methods in Quantum Circuit Design.
PhD thesis, 2019

T-Count Optimization and Reed-Muller Codes.
IEEE Trans. Inf. Theory, 2019

Sized Types for Low-Level Quantum Metaprogramming.
Proceedings of the Reversible Computation - 11th International Conference, 2019

2018
Towards Large-scale Functional Verification of Universal Quantum Circuits.
Proceedings of the Proceedings 15th International Conference on Quantum Physics and Logic, 2018

2017
A finite presentation of CNOT-dihedral operators.
Proceedings of the Proceedings 14th International Conference on Quantum Physics and Logic, 2017

Verified Compilation of Space-Efficient Reversible Circuits.
Proceedings of the Computer Aided Verification - 29th International Conference, 2017

2016
Complexity of reversible circuits and their quantum implementations.
Theor. Comput. Sci., 2016

Estimating the cost of generic quantum pre-image attacks on SHA-2 and SHA-3.
IACR Cryptol. ePrint Arch., 2016

Technology Mapping of Reversible Circuits to Clifford+T Quantum Circuits.
Proceedings of the 46th IEEE International Symposium on Multiple-Valued Logic, 2016

2014
Polynomial-Time T-Depth Optimization of Clifford+T Circuits Via Matroid Partitioning.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2014

2013
A Meet-in-the-Middle Algorithm for Fast Synthesis of Depth-Optimal Quantum Circuits.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2013


  Loading...