Computing with highly mixed states (extended abstract)

DOI10.1145/335305.335403zbMath1296.68054OpenAlexW2078323575MaRDI QIDQ3192044

Umesh V. Vazirani, Leonard J. Schulman, Andris Ambainis

Publication date: 26 September 2014

Published in: Proceedings of the thirty-second annual ACM symposium on Theory of computing (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items

Quantum computing without entanglement ⋮ Towards quantum computing based community detection ⋮ Directed graph encoding in quantum computing supporting edge-failures ⋮ On the computational power of probabilistic and quantum branching program

This page was built for publication: Computing with highly mixed states (extended abstract)