2013
DOI: 10.1088/1367-2630/15/1/013015
|View full text |Cite
|
Sign up to set email alerts
|

The power of noisy fermionic quantum computation

Abstract: 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 expli… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

2
82
0

Year Published

2014
2014
2017
2017

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 33 publications
(84 citation statements)
references
References 34 publications
2
82
0
Order By: Relevance
“…Is there anything else? We will prove that for one mode, any channel satisfying (27) can be written as a dilatation composed with a completely positive channel, possibly composed with the transposition (29), see Fig. 2.…”
Section: Characterization Of Gaussian-to-gaussian Mapsmentioning
confidence: 97%
See 2 more Smart Citations
“…Is there anything else? We will prove that for one mode, any channel satisfying (27) can be written as a dilatation composed with a completely positive channel, possibly composed with the transposition (29), see Fig. 2.…”
Section: Characterization Of Gaussian-to-gaussian Mapsmentioning
confidence: 97%
“…Another example of transformation not fulfilling the CP requirement (45) but respecting (27) is the (complete) transposition…”
Section: Characterization Of Gaussian-to-gaussian Mapsmentioning
confidence: 99%
See 1 more Smart Citation
“…From the proof of Proposition 1 ( [12]) and the proof of Theorem 2 that we provide later, one can lower bound ǫ as a function of m. We can say that for any state ρ ∈ C 2m there exists ǫ ≥…”
Section: Set Upmentioning
confidence: 99%
“…Both criteria are based on the notion of 'extendibility' and approach the target set (convex-Gaussian or separable states) from the outside. The criterion in [12] is presented in the form of a sequence of solvable semi-definite programs. The authors in [14] presented another characterization of the set of convex-Gaussian states in a particular case when a state space is on 4 fermionic modes, i.e.…”
Section: Introductionmentioning
confidence: 99%