University of Cambridge > Talks.cam > CQIF Seminar > Complete criterion for convex-Gaussian-state detection.

Complete criterion for convex-Gaussian-state detection.

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact William Matthews.

Majorana fermions offer a possible way to realize the universal quantum computation. It was shown if the noisy ancillae are convex mixtures of Gaussian fermionic states and the computation involves only non-interacting fermions operations, one can classically simulate such quantum computation. Hence rises the interest in developing a complete criterion that determines whether a state is convex-Gaussian. I will review a criterion by de Melo et al. that aims at characterizing the set of convex-Gaussian state from the outside and introduce a new one that characterizes the set from the inside. If a state fails the first program, it is not convex-Gaussian, and if it is passes the new one, it is convex-Gaussian. Both criteria are complete, i.e. the set of convex-Gaussian states can be approximated with an arbitrary precision by states that pass these criteria.

This talk is part of the CQIF Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2019 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity