@inproceedings{DBLP:journals/corr/abs-1805-06908,
	title = {Towards large-scale functional verification of universal quantum circuits},
	volume = {287},
	url = {https://doi.org/10.4204/EPTCS.287.1},
	doi = {10/ggb9cz},
	abstract = {We introduce a framework for the formal specification and verification of quantum circuits based on the Feynman path integral. Our formalism, built around exponential sums of polynomial functions, provides a structured and natural way of specifying quantum operations, particularly for quantum implementations of classical functions. Verification of circuits over all levels of the Clifford hierarchy with respect to either a specification or reference circuit is enabled by a novel rewrite system for exponential sums with free variables. Our algorithm is further shown to give a polynomial-time decision procedure for checking the equivalence of Clifford group circuits. We evaluate our methods by performing automated verification of optimized Clifford+T circuits with up to 100 qubits and thousands of T gates, as well as the functional verification of quantum algorithms using hundreds of qubits. Our experiments culminate in the automated verification of the Hidden Shift algorithm for a class of Boolean functions in a fraction of the time it has taken recent algorithms to simulate.},
	booktitle = {Proceedings 15th international conference on quantum physics and logic, {QPL} 2018, halifax, canada, 3-7th june 2018.},
	author = {Amy, Matthew},
	year = {2018},
	note = {tex.bibsource: dblp computer science bibliography, https://dblp.org
tex.biburl: https://dblp.org/rec/bib/journals/corr/abs-1805-06908
tex.crossref: DBLP:journals/corr/abs-1901-09476
tex.timestamp: Wed, 29 May 2019 11:09:08 +0200
Citation Key Alias: amy2019a},
	keywords = {Computer Science - Logic in Computer Science, Quantum Physics},
	pages = {1--21}
}

{"_id":"CM5sKYXttG7qdFCdz","bibbaseid":"amy-towardslargescalefunctionalverificationofuniversalquantumcircuits-2018","authorIDs":[],"author_short":["Amy, M."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","title":"Towards large-scale functional verification of universal quantum circuits","volume":"287","url":"https://doi.org/10.4204/EPTCS.287.1","doi":"10/ggb9cz","abstract":"We introduce a framework for the formal specification and verification of quantum circuits based on the Feynman path integral. Our formalism, built around exponential sums of polynomial functions, provides a structured and natural way of specifying quantum operations, particularly for quantum implementations of classical functions. Verification of circuits over all levels of the Clifford hierarchy with respect to either a specification or reference circuit is enabled by a novel rewrite system for exponential sums with free variables. Our algorithm is further shown to give a polynomial-time decision procedure for checking the equivalence of Clifford group circuits. We evaluate our methods by performing automated verification of optimized Clifford+T circuits with up to 100 qubits and thousands of T gates, as well as the functional verification of quantum algorithms using hundreds of qubits. Our experiments culminate in the automated verification of the Hidden Shift algorithm for a class of Boolean functions in a fraction of the time it has taken recent algorithms to simulate.","booktitle":"Proceedings 15th international conference on quantum physics and logic, QPL 2018, halifax, canada, 3-7th june 2018.","author":[{"propositions":[],"lastnames":["Amy"],"firstnames":["Matthew"],"suffixes":[]}],"year":"2018","note":"tex.bibsource: dblp computer science bibliography, https://dblp.org tex.biburl: https://dblp.org/rec/bib/journals/corr/abs-1805-06908 tex.crossref: DBLP:journals/corr/abs-1901-09476 tex.timestamp: Wed, 29 May 2019 11:09:08 +0200 Citation Key Alias: amy2019a","keywords":"Computer Science - Logic in Computer Science, Quantum Physics","pages":"1–21","bibtex":"@inproceedings{DBLP:journals/corr/abs-1805-06908,\n\ttitle = {Towards large-scale functional verification of universal quantum circuits},\n\tvolume = {287},\n\turl = {https://doi.org/10.4204/EPTCS.287.1},\n\tdoi = {10/ggb9cz},\n\tabstract = {We introduce a framework for the formal specification and verification of quantum circuits based on the Feynman path integral. Our formalism, built around exponential sums of polynomial functions, provides a structured and natural way of specifying quantum operations, particularly for quantum implementations of classical functions. Verification of circuits over all levels of the Clifford hierarchy with respect to either a specification or reference circuit is enabled by a novel rewrite system for exponential sums with free variables. Our algorithm is further shown to give a polynomial-time decision procedure for checking the equivalence of Clifford group circuits. We evaluate our methods by performing automated verification of optimized Clifford+T circuits with up to 100 qubits and thousands of T gates, as well as the functional verification of quantum algorithms using hundreds of qubits. Our experiments culminate in the automated verification of the Hidden Shift algorithm for a class of Boolean functions in a fraction of the time it has taken recent algorithms to simulate.},\n\tbooktitle = {Proceedings 15th international conference on quantum physics and logic, {QPL} 2018, halifax, canada, 3-7th june 2018.},\n\tauthor = {Amy, Matthew},\n\tyear = {2018},\n\tnote = {tex.bibsource: dblp computer science bibliography, https://dblp.org\ntex.biburl: https://dblp.org/rec/bib/journals/corr/abs-1805-06908\ntex.crossref: DBLP:journals/corr/abs-1901-09476\ntex.timestamp: Wed, 29 May 2019 11:09:08 +0200\nCitation Key Alias: amy2019a},\n\tkeywords = {Computer Science - Logic in Computer Science, Quantum Physics},\n\tpages = {1--21}\n}\n\n","author_short":["Amy, M."],"key":"DBLP:journals/corr/abs-1805-06908","id":"DBLP:journals/corr/abs-1805-06908","bibbaseid":"amy-towardslargescalefunctionalverificationofuniversalquantumcircuits-2018","role":"author","urls":{"Paper":"https://doi.org/10.4204/EPTCS.287.1"},"keyword":["Computer Science - Logic in Computer Science","Quantum Physics"],"downloads":0},"bibtype":"inproceedings","biburl":"https://bibbase.org/zotero/k4rtik","creationDate":"2020-05-31T17:07:22.668Z","downloads":0,"keywords":["computer science - logic in computer science","quantum physics"],"search_terms":["towards","large","scale","functional","verification","universal","quantum","circuits","amy"],"title":"Towards large-scale functional verification of universal quantum circuits","year":2018,"dataSources":["Z5Dp3qAJiMzxtvKMq"]}