T-Count Optimization and Reed–Muller Codes

DOI10.1109/TIT.2019.2906374zbMath1432.94189arXiv1601.07363WikidataQ128208194 ScholiaQ128208194MaRDI QIDQ5224110

Matthew Amy, Michele Mosca

Publication date: 19 July 2019

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1601.07363

zbMATH Keywords

minimum distance decodingn-qubit quantum circuitrelationship between Reed-Muller codes and single-qubit phase gatesT-count optimization

Mathematics Subject Classification ID

Combinatorial codes (94B25) Decoding (94B35) Switching theory, applications of Boolean algebras to circuits and networks (94C11)

Related Items (7)

Hierarchies of resources for measurement-based quantum computation ⋮ Optimal diagonal qutrit gates for creating Wigner negativity ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item

This page was built for publication: T-Count Optimization and Reed–Muller Codes