Fetching the paper…
Reading the bibliography…
Magic (non-stabilizerness) is a necessary but "expensive" kind of "fuel" to drive universal fault-tolerant quantum computation.
T. Kasami and N. Tokura, “On the weight structure of reed-muller codes,” IEEE Transactions on Information Theory 16
1970
Earlier work this paper cites.
Tadao Kasami, Nobuki Tokura, and Saburo Azumi, “On the weight enumeration of weights less than 2.5d of reed—muller codes,” Information and Control 30
1976
Earlier work this paper cites.
William K Wootters, “A wigner-function formulation of finite-state quantum mechanics,” Annals of Physics 176
1987
Earlier work this paper cites.
Seth Lloyd and Heinz Pagels, “Complexity as thermodynamic depth,” Annals of Physics 188
1988
Earlier work this paper cites.
M Kus, J Mostowski, and F Haake, “Universality of eigenvector statistics of kicked tops of different symmetries,” Journal of Physics A: Mathematical and General 21
1988
Earlier work this paper cites.
Gérard D. Cohen and Simon N. Litsyn, “On the covering radius of reed-muller codes,” Discrete Mathematics 106-107
1992
Earlier work this paper cites.
Don N. Page, “Average entropy of a subsystem,” Phys. Rev. Lett. 71
1993
Earlier work this paper cites.
Daniel Gottesman, Stabilizer codes and quantum error correction , Ph.D. thesis, California Institute of Technology (1997)
1997
Earlier work this paper cites.
V. Vedral, M. B. Plenio, M. A. Rippin, and P. L. Knight, “Quantifying entanglement,” Phys. Rev. Lett. 78
1997
Earlier work this paper cites.
G. Cohen, I. Honkala, S. Litsyn, and A. Lobstein, Covering Codes (North-Holland, 1997)
1997
Earlier work this paper cites.
Daniel Gottesman, “The Heisenberg Representation of Quantum Computers,” arXiv e-prints , quant-ph/9807006 (1998), arXiv:quant-ph/9807006 [quant-ph]
1998
Earlier work this paper cites.
Karol Życzkowski, Paweł Horodecki, Anna Sanpera, and Maciej Lewenstein, “Volume of the set of separable states,” Phys. Rev. A 58
1998
Earlier work this paper cites.
Daniel Gottesman and Isaac L. Chuang, “Demonstrating the viability of universal quantum computation using teleportation and single-qubit operations,” Nature 402
1999
Earlier work this paper cites.
Karol Zyczkowski and Hans-Jürgen Sommers, “Truncations of random unitary matrices,” Journal of Physics A: Mathematical and General 33
2000
Earlier work this paper cites.
Robert Raussendorf and Hans J. Briegel, “A one-way quantum computer,” Phys. Rev. Lett. 86
2001
Earlier work this paper cites.
D. Schlingemann, “Stabilizer codes can be realized as graph codes,” arXiv e-prints , quant-ph/0111080 (2001), arXiv:quant-ph/0111080 [quant-ph]
2001
Earlier work this paper cites.
Somshubhro Bandyopadhyay, P. Oscar Boykin, Vwani Roychowdhury, and Farrokh Vatan, “A new proof for the existence of mutually unbiased bases,” Algorithmica 34
2002
Earlier work this paper cites.
2002
Earlier work this paper cites.
Robert Raussendorf, Daniel E. Browne, and Hans J. Briegel, “Measurement-based quantum computation on cluster states,” Phys. Rev. A 68
2003
Earlier work this paper cites.
Michael Steiner, “Generalized robustness of entanglement,” Phys. Rev. A 67
2003
Earlier work this paper cites.
Aram W. Harrow and Michael A. Nielsen, “Robustness of quantum gates in the presence of noise,” Phys. Rev. A 68
2003
Earlier work this paper cites.
M.L. Mehta, Random Matrices , ISSN (Elsevier Science, 2004)
2004
Earlier work this paper cites.
Scott Aaronson and Daniel Gottesman, “Improved simulation of stabilizer circuits,” Phys. Rev. A 70
2004
Earlier work this paper cites.
Sergey Bravyi and Alexei Kitaev, “Universal quantum computation with ideal clifford gates and noisy ancillas,” Phys. Rev. A 71
2005
Earlier work this paper cites.
D. Gross, “Hudson’s theorem for finite-dimensional quantum systems,” Journal of Mathematical Physics 47
2006
Earlier work this paper cites.
Patrick Hayden, Debbie W. Leung, and Andreas Winter, “Aspects of generic entanglement,” Communications in Mathematical Physics 265
2006
Earlier work this paper cites.
M. Hein, W. Dür, J. Eisert, R. Raussendorf, M. Van den Nest, and H. J. Briegel, “Entanglement in graph states and its applications,” (2006), arXiv:quant-ph/0602096 [quant-ph]
2006
Earlier work this paper cites.
Maarten Van den Nest, Akimasa Miyake, Wolfgang Dür, and Hans J. Briegel, “Universal resources for measurement-based quantum computation,” Phys. Rev. Lett. 97
2006
Earlier work this paper cites.
Patrick Hayden and John Preskill, “Black holes as mirrors: quantum information in random subsystems,” Journal of High Energy Physics 2007
2007
Earlier work this paper cites.
2007
Earlier work this paper cites.
C. Carlet and S. Mesnager, “Improving the upper bounds on the covering radii of binary reed–muller codes,” IEEE Transactions on Information Theory 53
2007
Earlier work this paper cites.
M Van den Nest, W Dür, A Miyake, and H J Briegel, “Fundamentals of universality in one-way quantum computation,” New Journal of Physics 9
2007
Earlier work this paper cites.
Nicholas Kolokotronis, Konstantinos Limniotis, and Nicholas Kalouptsidis, “Efficient computation of the best quadratic approximations of cubic boolean functions,” in Cryptography and Coding , edited by Steven D. Galbraith (Springer Berlin Heidelberg, Berlin, Heidelberg, 2007) pp. 73–91
2007
Earlier work this paper cites.
Sergey Bravyi, David P. DiVincenzo, Roberto Oliveira, and Barbara M. Terhal, “The complexity of stoquastic local hamiltonian problems,” Quantum Inf. Comput. 8
2008
Earlier work this paper cites.
C. Carlet, “Recursive lower bounds on the nonlinearity profile of boolean functions and their applications,” IEEE Transactions on Information Theory 54
2008
Earlier work this paper cites.
Ryszard Horodecki, Paweł Horodecki, Michał Horodecki, and Karol Horodecki, “Quantum entanglement,” Rev. Mod. Phys. 81
2009
Cited alongside, same era.
D. Gross, S. T. Flammia, and J. Eisert, “Most quantum states are too entangled to be useful as computational resources,” Phys. Rev. Lett. 102
2009
Cited alongside, same era.
Michael J. Bremner, Caterina Mora, and Andreas Winter, “Are random pure states useful for quantum computation?” Phys. Rev. Lett. 102
2009
Cited alongside, same era.
M. B. Hastings, “Superadditivity of communication capacity using entangled inputs,” Nature Physics 5
2009
Cited alongside, same era.
N. Kolokotronis, K. Limniotis, and N. Kalouptsidis, “Best affine and quadratic approximations of particular classes of boolean functions,” IEEE Transactions on Information Theory 55
2009
Cited alongside, same era.
2017
Later among the works it cites.
Shawn X. Cui, Daniel Gottesman, and Anirudh Krishna, “Diagonal gates in the clifford hierarchy,” Phys. Rev. A 95
2017
Later among the works it cites.
Nicole Yunger Halpern, “Toward physical realizations of thermodynamic resource theories,” in Information and Interaction: Eddington, Wheeler, and the Limits of Knowledge , edited by Ian T. Durham and Dean Rickles (Springer International Publishing, Cham, 2017) pp. 135–166
2017
Later among the works it cites.
Adam Nahum, Jonathan Ruhman, Sagar Vijay, and Jeongwan Haah, “Quantum entanglement growth under random unitary dynamics,” Phys. Rev. X 7
2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Claude Carlet, “Boolean functions for cryptography and error-correcting codes,” in Boolean Models and Methods in Mathematics, Computer Science, and Engineering , Encyclopedia of Mathematics and its Applications, edited by Yves Crama and Peter L.Editors Hammer (Cambridge University Press, 2010) p. 257–397
2010
Cited alongside, same era.
Michael A. Nielsen and Isaac L. Chuang, Quantum Computation and Quantum Information: 10th Anniversary Edition , 10th ed. (Cambridge University Press, New York, NY, USA, 2011)
2011
Cited alongside, same era.
Bei Zeng, Andrew Cross, and Isaac L. Chuang, “Transversality versus universality for additive quantum codes,” IEEE Transactions on Information Theory 57
2011
Cited alongside, same era.
2011
Cited alongside, same era.
Claude Carlet, “Nonlinearity of boolean functions,” in Encyclopedia of Cryptography and Security , edited by Henk C. A. van Tilborg and Sushil Jajodia (Springer US, Boston, MA, 2011) pp. 848–849
2011
Cited alongside, same era.
Victor Veitch, Christopher Ferrie, David Gross, and Joseph Emerson, “Negative quasi-probability as a resource for quantum computation,” New Journal of Physics 14
2012
Cited alongside, same era.
Michael Levin and Zheng-Cheng Gu, “Braiding statistics approach to symmetry-protected topological phases,” Phys. Rev. B 86
2012
Cited alongside, same era.
2017
Later among the works it cites.
Tzu-Chieh Wei, “Quantum spin models for measurement-based quantum computation,” Advances in Physics: X 3
2018
Later among the works it cites.
Zi-Wen Liu, Seth Lloyd, Elton Zhu, and Huangjun Zhu, “Entanglement, quantum randomness, and complexity beyond scrambling,” Journal of High Energy Physics 2018
2018
Later among the works it cites.
Adam Nahum, Sagar Vijay, and Jeongwan Haah, “Operator spreading in random unitary circuits,” Phys. Rev. X 8
2018
Later among the works it cites.
Adam R. Brown and Leonard Susskind, “Second law of quantum complexity,” Phys. Rev. D 97
2018
Later among the works it cites.
2018
Later among the works it cites.
María García Díaz, Kun Fang, Xin Wang, Matteo Rosati, Michalis Skotiniotis, John Calsamiglia, and Andreas Winter, “Using and reusing coherence to realize quantum processes,” Quantum 2
2018
Later among the works it cites.
Jacob Miller and Akimasa Miyake, “Latent computational complexity of symmetry-protected topological order with fractional symmetry,” Phys. Rev. Lett. 120
2018
Later among the works it cites.
Sergey Bravyi, Dan Browne, Padraic Calpin, Earl Campbell, David Gosset, and Mark Howard, “Simulation of quantum circuits by low-rank stabilizer decompositions,” Quantum 3
2019
Later among the works it cites.
Xin Wang, Mark M Wilde, and Yuan Su, “Quantifying the magic of quantum channels,” New Journal of Physics 21
2019
Later among the works it cites.
James R. Seddon and Earl T. Campbell, “Quantifying magic for multi-qubit operations,” Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 475
2019
Later among the works it cites.
Markus Heinrich and David Gross, “Robustness of Magic and Symmetries of the Stabiliser Polytope,” Quantum 3
2019
Later among the works it cites.
Zi-Wen Liu, Kaifeng Bu, and Ryuji Takagi, “One-shot operational quantum resource theory,” Phys. Rev. Lett. 123
2019
Later among the works it cites.
Robert Raussendorf, Cihan Okay, Dong-Sheng Wang, David T. Stephen, and Hendrik Poulsen Nautrup, “Computationally universal phase of quantum matter,” Phys. Rev. Lett. 122
2019
Later among the works it cites.
Yuki Takeuchi, Tomoyuki Morimae, and Masahito Hayashi, “Quantum computational universality of hypergraph states with pauli-x and z basis measurements,” Scientific Reports 9
2019
Later among the works it cites.
Mariami Gachechiladze, Otfried Gühne, and Akimasa Miyake, “Changing the circuit-depth complexity of measurement-based quantum computation with hypergraph states,” Phys. Rev. A 99
2019
Later among the works it cites.
Xin Wang, Mark M. Wilde, and Yuan Su, “Efficiently computable bounds for magic state distillation,” Phys. Rev. Lett. 124
2020
Closest in time.
S Sarkar, C Mukhopadhyay, and A Bayat, “Characterization of an operational quantum resource in a critical many-body system,” New Journal of Physics 22
2020
Closest in time.
Wenbin Zhou and Francesco Buscemi, “General state transitions with exact resource morphisms: a unified resource-theoretic approach,” Journal of Physics A: Mathematical and Theoretical 53
2020
Closest in time.
Kohdai Kuroiwa and Hayata Yamasaki, “General Quantum Resource Theories: Distillation, Formation and Consistent Resource Measures,” Quantum 4
2020
Closest in time.
Gilad Gour and Marco Tomamichel, “Optimal extensions of resource measures and their applications,” Phys. Rev. A 102
2020
Closest in time.
James R. Seddon, Bartosz Regula, Hakop Pashayan, Yingkai Ouyang, and Earl T. Campbell, “Quantifying quantum speedups: Improved classical simulation from tighter magic monotones,” PRX Quantum 2
2021
Closest in time.
Arne Heimendahl, Felipe Montealegre-Mora, Frank Vallentin, and David Gross, “Stabilizer extent is not multiplicative,” Quantum 5
2021
Closest in time.
Sisi Zhou, Zi-Wen Liu, and Liang Jiang, “New perspectives on covariant quantum error correction,” Quantum 5
2021
Closest in time.
Tyler D. Ellison, Kohtaro Kato, Zi-Wen Liu, and Timothy H. Hsieh, “Symmetry-protected sign problem and magic in quantum phases of matter,” Quantum 5
2021
Closest in time.
Christopher David White, ChunJun Cao, and Brian Swingle, “Conformal field theories are magical,” Phys. Rev. B 103
2021
Closest in time.
Aram W. Harrow, Linghang Kong, Zi-Wen Liu, Saeed Mehraban, and Peter W. Shor, “Separation of out-of-time-ordered correlation and entanglement,” PRX Quantum 2
2021
Closest in time.
Fernando G.S.L. Brandão, Wissam Chemissany, Nicholas Hunter-Jones, Richard Kueng, and John Preskill, “Models of quantum complexity growth,” PRX Quantum 2
2021
Closest in time.
Ludovico Lami and Bartosz Regula, “No second law of entanglement manipulation after all,” (2021), arXiv[quant-ph]:2111.02438
2021
Closest in time.
David Gross, Sepehr Nezami, and Michael Walter, “Schur–weyl duality for the clifford group with applications: Property testing, a robust hudson theorem, and de finetti representations,” Communications in Mathematical Physics 385
2021
Closest in time.