Generalised Clifford groups and simulation of associated quantum circuits

Physics – Quantum Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

21 pages

Scientific paper

Quantum computations that involve only Clifford operations are classically simulable despite the fact that they generate highly entangled states; this is the content of the Gottesman-Knill theorem. Here we isolate the ingredients of the theorem and provide generalisations of some of them with the aim of identifying new classes of simulable quantum computations. In the usual construction, Clifford operations arise as projective normalisers of the first and second tensor powers of the Pauli group. We consider replacing the Pauli group by an arbitrary finite subgroup G of U(d). In particular we seek G such that G tensor G has an entangling normaliser. Via a generalisation of the Gottesman-Knill theorem the resulting normalisers lead to classes of quantum circuits that can be classically efficiently simulated. For the qubit case d=2 we exhaustively treat all finite subgroups of U(2) and find that the only ones (up to unitary equivalence and trivial phase extensions) with entangling normalisers are the groups G_n generated by X and the n^th root of Z.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Generalised Clifford groups and simulation of associated quantum circuits does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Generalised Clifford groups and simulation of associated quantum circuits, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Generalised Clifford groups and simulation of associated quantum circuits will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-189238

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.