New Journal of Physics · 2013 · 40 citations · 37 references
Natural SciencesPhysicsQuantum ComputingQuantum MechanicsTheoretical PhysicsQuantum ComputationQuantum EntanglementQuantum Information TheoryQuantum StatesEntanglement TheoryGaussian StatesUniversal Quantum Computation
We consider the realization of universal quantum computation through braiding of Majorana fermions supplemented by unprotected preparation of noisy ancillae. It has been shown by Bravyi (2006 Phys. Rev. A 73 042313) that under the assumption of perfect braiding operations, universal quantum computation is possible if the noise rate on a particular four-fermion ancilla is below 40%. We show that beyond a noise rate of 89% on this ancilla the quantum computation can be efficiently simulated classically: we explicitly show that the noisy ancilla is a convex mixture of Gaussian fermionic states in this region, while for noise rates below 53% we prove that the state is not a mixture of Gaussian states. These results are obtained by generalizing concepts in entanglement theory to the setting of Gaussian states and their convex mixtures. In particular, we develop a complete set of criteria, namely the existence of a Gaussian-symmetric extension, which determine whether a state is a convex mixture of Gaussian states.
37
Separability Criterion for Density Matrices
Asher Peres · Physical Review Letters · 1996 · 5.2K citations · Full text
Separability of mixed states: necessary and sufficient conditions
Physics Letters A · 1996 · 3.6K citations · Full text
A Separability of mixed states: necessary and sufficient conditions
1996 · 2.3K citations
Universal quantum computation with ideal Clifford gates and noisy ancillas
Sergey Bravyi, Alexei Kitaev · Physical Review A · 2005 · 1.5K citations · Full text
Computing, Computer Science, Physics +14