It is my understanding that topological quantum computers are capable of executing an arbitrary quantum circuit with a polynomial overhead of translating the circuit to the native topological operations.

What is the tightest bound on this translation? Any references?



Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Browse other questions tagged or ask your own question.