default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatthew Amy
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c11]Matthew Amy
, Andrew N. Glaudell, Shaun Kelso, William Maxwell, Samuel S. Mendelson, Neil J. Ross:
Exact Synthesis of Multiqubit Clifford-Cyclotomic Circuits. RC 2024: 238-245- [c10]Matthew Amy, Neil J. Ross, Scott Wesley:
A Sound and Complete Equational Theory for 3-Qubit Toffoli-Hadamard Circuits. QPL 2024: 1-43 - [i7]Matthew Amy, Joseph Lunderville:
Linear and non-linear relational analyses for Quantum Program Optimization. CoRR abs/2410.23493 (2024) - 2023
- [c9]Matthew Amy, Andrew N. Glaudell, Sarah Meng Li, Neil J. Ross:
Improved Synthesis of Toffoli-Hadamard Circuits. RC 2023: 169-209 - [c8]Matthew Amy:
Complete Equational Theories for the Sum-Over-Paths with Unbalanced Amplitudes. QPL 2023: 127-141 - [i6]Matthew Amy, Andrew N. Glaudell, Sarah Meng Li, Neil J. Ross:
Improved Synthesis of Toffoli-Hadamard Circuits. CoRR abs/2305.11305 (2023) - 2022
- [c7]Matthew Amy, Owen Bennett-Gibbs, Neil J. Ross:
Symbolic Synthesis of Clifford Circuits and Beyond. QPL 2022: 343-362 - 2020
- [j5]Matthew Amy, Andrew N. Glaudell, Neil J. Ross:
Number-Theoretic Characterizations of Some Restricted Clifford+T Circuits. Quantum 4: 252 (2020)
2010 – 2019
- 2019
- [b1]Matthew Amy:
Formal Methods in Quantum Circuit Design. University of Waterloo, Ontario, Canada, 2019 - [j4]Matthew Amy, Michele Mosca:
T-Count Optimization and Reed-Muller Codes. IEEE Trans. Inf. Theory 65(8): 4771-4784 (2019) - [c6]Matthew Amy:
Sized Types for Low-Level Quantum Metaprogramming. RC 2019: 87-107 - [i5]Matthew Amy:
Sized Types for low-level Quantum Metaprogramming. CoRR abs/1908.02644 (2019) - 2018
- [c5]Matthew Amy:
Towards Large-scale Functional Verification of Universal Quantum Circuits. QPL 2018: 1-21 - 2017
- [c4]Matthew Amy, Martin Roetteler, Krysta M. Svore:
Verified Compilation of Space-Efficient Reversible Circuits. CAV (2) 2017: 3-21 - [c3]Matthew Amy, Jianxin Chen, Neil J. Ross:
A finite presentation of CNOT-dihedral operators. QPL 2017: 84-97 - 2016
- [j3]Nabila Abdessaied, Matthew Amy, Rolf Drechsler, Mathias Soeken:
Complexity of reversible circuits and their quantum implementations. Theor. Comput. Sci. 618: 85-106 (2016) - [c2]Nabila Abdessaied, Matthew Amy, Mathias Soeken, Rolf Drechsler:
Technology Mapping of Reversible Circuits to Clifford+T Quantum Circuits. ISMVL 2016: 150-155 - [c1]Matthew Amy, Olivia Di Matteo, Vlad Gheorghiu, Michele Mosca, Alex Parent, John M. Schanck:
Estimating the Cost of Generic Quantum Pre-image Attacks on SHA-2 and SHA-3. SAC 2016: 317-337 - [i4]Matthew Amy, Martin Roetteler, Krysta M. Svore:
Verified compilation of space-efficient reversible circuits. CoRR abs/1603.01635 (2016) - [i3]Matthew Amy, Olivia Di Matteo, Vlad Gheorghiu, Michele Mosca, Alex Parent, John M. Schanck:
Estimating the cost of generic quantum pre-image attacks on SHA-2 and SHA-3. IACR Cryptol. ePrint Arch. 2016: 992 (2016) - 2014
- [j2]Matthew Amy, Dmitri Maslov, Michele Mosca:
Polynomial-Time T-Depth Optimization of Clifford+T Circuits Via Matroid Partitioning. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 33(10): 1476-1489 (2014) - 2013
- [j1]Matthew Amy, Dmitri Maslov, Michele Mosca, Martin Roetteler:
A Meet-in-the-Middle Algorithm for Fast Synthesis of Depth-Optimal Quantum Circuits. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 32(6): 818-830 (2013) - [i2]Matthew Amy, Dmitri Maslov, Michele Mosca:
Polynomial-time T-depth Optimization of Clifford+T circuits via Matroid Partitioning. CoRR abs/1303.2042 (2013) - 2012
- [i1]Matthew Amy, Dmitri Maslov, Michele Mosca, Martin Roetteler:
A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits. CoRR abs/1206.0758 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 22:55 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
