Complete criterion for convex-Gaussian state detection

Abstract

We present a new criterion that determines whether a fermionic state is a convex combination of pure Gaussian states. This criterion is complete and characterizes the set of convex-Gaussian states from the inside. If a state passes a program it is a convex-Gaussian state and any convex-Gaussian state can be approximated with arbitrary precision by states passing the criterion. The criterion is presented in the form of a sequence of solvable semidefinite programs. It is also complementary to the one developed by de Melo, Cwiklinski and Terhal, which aims at characterizing the set of convex-Gaussian states from the outside. Here we present an explicit proof that criterion by de Melo et al. is complete, by estimating a distance between an n-extendible state, a state that passes the criterion, to the set of convex-Gaussian states.

References in corpus (7)

• Non-Abelian Anyons and Topological Quantum Computation
• Signatures of Majorana fermions in hybrid superconductor-semiconductor nanowire devices
• Observation of Majorana Fermions in a Nb-InSb Nanowire-Nb Hybrid Quantum Device
• A complete family of separability criteria
• One-and-a-half quantum de Finetti theorems
• Implementation of Clifford gates in the Ising-anyon topological quantum computer
• Classical simulation of fermionic linear optics augmented with noisy ancillas

Cited by in corpus (1)

• Normal form decomposition for Gaussian-to-Gaussian superoperators