Fetching the paper…
Reading the bibliography…
For a quantum computer acting on d-dimensional systems, we analyze the computational power of circuits wherein stabilizer operations are perfect and we allow access to imperfect non-stabilizer states or operations.
Annals of Physics 176
W. K. Wootters, “A Wigner-function formulation of finite-state quantum mechanics” · 1987
Earlier work this paper cites.
B. Chazelle, “An optimal convex hull algorithm and new results on cuttings”, Proceedings of Thirty- Second Annual IEEE Symposium on Foundations of Computer Science (FOCS) (1991), pp. 29–38
1991
Earlier work this paper cites.
K. Fukuda, and A. Prodon, “Double description method revisited” in Combinatorics and Computer Science , (editors: Deza, Michel and Euler, Reinhardt and Manoussakis, Ioannis), Lecture Notes in Computer Science, volume 1120, (Springer Berlin / Heidelberg 1996) pp. 91–111
1996
Earlier work this paper cites.
D. Gottesman, “Fault-Tolerant Quantum Computation with Higher-Dimensional Systems”, in Quantum Computing and Quantum Communications , (editor: Colin Williams), Lecture Notes in Computer Science, Volume 1509, (Springer Berlin / Heidelberg, 1999), pp. 302–313
1999
Earlier work this paper cites.
Quantum Computation and Quantum Information
M. A. Nielsen and I. L. Chuang, · 2000
Earlier work this paper cites.
D. Avis, “A revised implementation of the reverse search vertex enumeration algorithm” in Polytopes - Combinatorics and Computation (Oberwolfach Seminars) , (editors: Kalai, G. and Ziegler, G.), pp. 177–198, Birkhäuser Basel, (2000)
2000
Earlier work this paper cites.
S. Bandyopadhyay, P. O. Boykin, V. Roychowdhury, and F. Vatan, “A New Proof for the Existence of Mutually Unbiased Bases”, Algorithmica, Volume 34, issue 4, pp. 512–528, (2002)
2002
Earlier work this paper cites.
R. Jozsa and N. Linden, “On the role of entanglement in quantum-computational speed-up”, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences Volume 459, number 2036, pp. 2011–2032, (2003)
2003
Earlier work this paper cites.
Phys. Rev. A. 67
E. Bagan, M. Baig, and R. Muñoz-Tapia, “Minimal measurements of the gate fidelity of a qudit map”, · 2003
Earlier work this paper cites.
Quantum Inf. Comput. 3
Ll. Masanes, “Tight Bell inequality for d-outcome measurements correlations.” · 2003
Earlier work this paper cites.
Phys. Rev. A. 70
K. S. Gibbons, M. J. Hoffman, and W. K. Wootters, “Discrete phase space based on finite fields” · 2004
Earlier work this paper cites.
Nature 434
E. Knill , “Quantum Computing with Realistically Noisy Devices” · 2005
Earlier work this paper cites.
Phys. Rev. A 71
S. Bravyi and A. Kitaev, “ Universal quantum computation with ideal Clifford gates and noisy ancillas”, · 2005
Earlier work this paper cites.
Quant. Inf. Proc., 4
Ben W. Reichardt, “ Quantum universality from magic states distillation applied to CSS codes”, · 2005
Cited alongside, same era.
Phys. Rev. A. 71
E. F. Galvão, “Discrete Wigner functions and quantum computational speedup” · 2005
Cited alongside, same era.
H. Buhrman, R. Cleve, M. Laurent, N. Linden, A. Schrijver and F. Unger, “New Limits on Fault-Tolerant Quantum Computation”, Annual IEEE Symposium on Foundations of Computer Science, pp. 411–419, (2006)
2006
Cited alongside, same era.
Phys. Rev. B 73
M. Freedman, C. Nayak and K. Walker, “Towards universal topological quantum computation in the ν = ( 5 / 2 ) \nu=(5/2) fractional quantum Hall state”, · 2006
Cited alongside, same era.
Phys. Rev. B 74
L. S. Georgiev, “Topologically protected gates for quantum computation with non-abelian anyons in the Pfaffian quantum Hall state”, · 2006
Cited alongside, same era.
Phys. Rev. A. 73
C. Cormick, E. F. Galvão, D. Gottesman, J. Pablo Paz, and Arthur O. Pittenger , “Classicality in discrete Wigner functions” · 2006
R. Raussendorf, “Quantum computation, discreteness, and contextuality”, arXiv:quant-ph/0907.5449, (2009)
2009
Later among the works it cites.
Algorithmica 55
B. Reichardt, “Error-Detection-Based Quantum Fault-Tolerance Threshold” · 2009
Later among the works it cites.
Quantum Inf. Comput. 9
B. Reichardt, “Quantum universality by state distillation ” · 2009
Later among the works it cites.
E. T. Campbell and D. E. Browne, “On the Structure of Protocols for Magic State Distillation”, in Theory of Quantum Computation, Communication, and Cryptography , (editor: Childs, Andrew and Mosca, Michele), Lecture Notes in Computer Science, Volume 5906, (Springer Berlin / Heidelberg, 2009), pp. 20–32
2009
Later among the works it cites.
Phys. Rev. Lett. 103
W. van Dam and M. Howard, “Tight Noise Thresholds for Quantum Computation with Perfect Stabilizer Operations” · 2009
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
J. Math. Phys. 47
D. Gross, “Hudson’s theorem for finite-dimensional quantum systems” · 2006
Cited alongside, same era.
S. Beigi, M. Bahramgiri, “Graph States Under the Action of Local Clifford Group in Non-Binary Case”, arXiv:quant-ph/0610267v2, (2006)
2006
Cited alongside, same era.
Phys. Rev. Lett. 98
P. Aliferis and A. W. Cross, “Subsystem Fault Tolerance with the Bacon-Shor Code” · 2007
Cited alongside, same era.
Phys. Rev. A. 78
P. Aliferis and J. Preskill, “Fault-tolerant quantum computation against biased noise” · 2008
Cited alongside, same era.
Phys. Rev. A. 78
A. Casaccino, E. F. Galvão, and S. Severini, “Extrema of discrete Wigner functions and applications” · 2008
Cited alongside, same era.
D. M. Appleby, I. Bengtsson and S. Chaturvedi, “Spectra of phase point operators in odd prime dimensions and the extended Clifford group”, Journal of Mathematical Physics, Volume 49, number 1, pp. 012102, (2008)
2008
Cited alongside, same era.
D. M. Appleby, “Properties of the extended Clifford group with applications to SIC-POVMs and MUBs”, arXiv:quant-ph/0909.5233, (2009)
2009
Later among the works it cites.
B. Eastin, “Simulating Concordant Computations”, arXiv:quant-ph/1006.4402, (2010)
2010
Closest in time.
New Journal of Physics 12
M. B. Plenio and S. Virmani, “Upper bounds on fault tolerance thresholds of noisy Clifford-based quantum computers” · 2010
Closest in time.
Phys. Rev. A. 82
K. Fujii and K. Yamamoto, “Topological one-way quantum computation on verified logical cluster states” · 2010
Closest in time.
Phys. Rev. Lett. 104
E. T. Campbell and D. E. Browne, “Bound States for Magic State Distillation in Fault-Tolerant Quantum Computation” · 2010
Closest in time.
2010
Closest in time.
Phys. Rev. A. 83
D. S. Wang, A. G. Fowler and L. C. L. Hollenberg, “Surface code quantum computing with error rates over 1 % \% ” · 2011
Closest in time.