Fetching the paper…

Reading the bibliography…

2015

Reducing the overhead for quantum computation when noise is biased

Webster, Paul, Bartlett, Stephen D., Poulin, David

Original
PDF
Post on X

Understand

We analyse a model for fault-tolerant quantum computation with low overhead suitable for situations where the noise is biased.

The basis for this scheme is a gadget for the fault-tolerant preparation of magic states that enable universal fault-tolerant quantum computation using only Clifford gates that preserve the noise bias.
We analyse the distillation of $|T\rangle$-type magic states using this gadget at the physical level, followed by concatenation with the 15-qubit quantum Reed-Muller code, and comparing our results with standard constructions.
In the regime where the noise bias (rate of Pauli $Z$ errors relative to other single-qubit errors) is greater than a factor of 10, our scheme has lower overhead across a broad range of relevant noise rates.

Reducing the overhead for quantum computation when noise is biased · Around

Built on

F. J. Macwilliams and N. J. A. Sloane, “The Theory of Error-Correcting Codes”, North-Holland Publishing Company, 1977
1977
Earlier work this paper cites.
E. Knill, “Quantum computing with realistically noisy devices,” Nature 434
2005
Earlier work this paper cites.
D. Bacon, “Operator Quantum Error Correcting Subsystems for Self-Correcting Quantum Memories”, Phys. Rev. A 73
2006
Earlier work this paper cites.
R. Raussendorf, J. Harrington, and K. Goyal, “Topological fault-tolerance in cluster state quantum computation,” New J. Phys. 9
2007
Earlier work this paper cites.
P. Aliferis, D. Gottesman, and J. Preskill, “Accuracy threshold for postselected quantum computation,” Quant. Inf. Comput. 8
2008
Earlier work this paper cites.
P. Aliferis, J. Preskill, “Fault-tolerant quantum computation against biased noise”, Phys. Rev. A. 78
Original
2008
Earlier work this paper cites.
P. Aliferis et al
Original
2009
Earlier work this paper cites.

Similar

A. G. Fowler, M. Mariantoni, J. M. Martinis, and A. N. Cleland, “Surface codes: Towards practical large-scale quantum computation,” Phys. Rev. A 86
Original
2012
Cited alongside, same era.
S. Bravyi and J. Haah, “Magic state distillation with low overhead”, Phys. Rev. A 86
Original
2012
Cited alongside, same era.
M. Shulman et al
Original
2012
Cited alongside, same era.
T. Jochym-O’Connor, Y. Yu, B. Helou, R. Laflamme, “The robustness of magic state distillation against errors in Clifford gates”, Quant. Inf. Comput. 13
Original
2013
Cited alongside, same era.
C. Jones, “Multilevel distillation of magic states for quantum computing”, Phys. Rev. A 87
Original

Then

P. Brooks, “Quantum error correction with biased noise”, Ph.D. thesis, California Institute of Technology, 2013. http://resolver.caltech.edu/CaltechTHESIS:05302013-143644943
2013
Later among the works it cites.
P. Brooks and J. Preskill, “Fault-tolerant quantum computation with asymmetric Bacon-Shor codes”, Phys. Rev. A 87
Original
2013
Later among the works it cites.
D. Gottesman, “Fault-Tolerant Quantum Computation with Constant Overhead”, Quant. Inf. Comput. 14
Original
2014
Later among the works it cites.
D. Nigg et al
Original
2014
Later among the works it cites.
N. Delfosse and J.-P. Tillich, “A decoding algorithm for CSS codes using the X/Z correlations”, Proc. of the IEEE International Symposium of Information Theory 2014

Beyond the bibliography

alphaXiv searches the wider corpus for related work and actual follow-ups.

Open on alphaXiv

alphaXiv is searching for related work…

2013

Cited alongside, same era.

A. M. Meier, B. Eastin, and E. Knill, “Magic-state distillation with the four-qubit code”, Quant. Inf. Comput. 13

2013

Cited alongside, same era.

2014

Later among the works it cites.

G. Duclos-Cianci, D. Poulin, “Reducing the quantum computing overhead with complex gate distillation”, Phys. Rev. A 91

2015

Closest in time.