Eliminating intermediate measurements in space-bounded Quantum computation

DOI10.1145/3406325.3451051arXiv2006.03530OpenAlexW3037599677WikidataQ130912919 ScholiaQ130912919MaRDI QIDQ6065258

Bill Fefferman, Unnamed Author

Publication date: 14 November 2023

Published in: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

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

zbMATH Keywords

quantum computationapproximation algorithmsspace complexityalgorithms for linear algebra

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (2)

Quantum circuits with classical channels and the principle of deferred measurements ⋮ The parallel reversible pebbling game: analyzing the post-quantum security of iMHFs

This page was built for publication: Eliminating intermediate measurements in space-bounded Quantum computation