Suppose you have a general state of n-qubits, and you have a second copy with the same state, but with the qubits permuted in some order. Suppose you have given lots of copies of these pairs. What is the minimum number of such copies needed to find the permutation with high certainty as a function of n?(adsbygoogle = window.adsbygoogle || []).push({});

Note that this is a GENERAL state, not a tensor product of n qubits. In the case of a tensor product, the number of copies needed to be almost certain grows linearly with n.

**Physics Forums - The Fusion of Science and Community**

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Permuting Qubits

Loading...

Similar Threads - Permuting Qubits | Date |
---|---|

A Qubit error rate of QKD BB84 protocol | Jan 16, 2018 |

I Permutation operator and Hamiltonian | Nov 1, 2016 |

Cyclic permutation and operators | Oct 10, 2012 |

Transformation of observables by permutation | May 25, 2012 |

Permutation operator | Nov 16, 2007 |

**Physics Forums - The Fusion of Science and Community**