The Weakness of CTC Qubits and the Power of Approximate Counting

From MaRDI portal

Revision as of 09:05, 8 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4973873

Jump to:navigation, search

DOI10.1145/3196832zbMath1427.68090OpenAlexW2804020262WikidataQ130926780 ScholiaQ130926780MaRDI QIDQ4973873

Ryan O'Donnell, A. C. Cem Say

Publication date: 6 December 2019

Published in: ACM Transactions on Computation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3196832

zbMATH Keywords

quantum channels quantum computation closed timelike curves postselection approximate counting BPP-path

Mathematics Subject Classification ID

Quantum computation (81P68) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Quantum algorithms and complexity in the theory of computing (68Q12)

This page was built for publication: The Weakness of CTC Qubits and the Power of Approximate Counting

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4973873&oldid=19409675"