Fetching the paper…
Reading the bibliography…
Quantum Supremacy is a demonstration of a computation by a quantum computer that can not be performed by the best classical computer in a reasonable time.
R. Penrose, Applications of negative dimensional tensors, in Combinatorial Mathematics and its Applications (Academic Press, 1971) pp. 221–244
1971
Earlier work this paper cites.
D. W. Matula, The employee party problem, Notices Of The American Mathematical Society 19
1972
Earlier work this paper cites.
J. B. Shearer, A note on the independence number of triangle-free graphs, Discrete Mathematics 46
1983
Earlier work this paper cites.
2005
Earlier work this paper cites.
B. Coecke and R. Duncan, Interacting quantum observables, in Proceedings of the 37th International Colloquium on Automata, Languages and Programming (ICALP) , Lecture Notes in Computer Science (2008)
2008
Earlier work this paper cites.
D. Shepherd and M. J. Bremner, Temporally unstructured quantum computation, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 465
2009
Earlier work this paper cites.
M. J. Bremner, R. Jozsa, and D. J. Shepherd, Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 467
2011
Earlier work this paper cites.
B. Coecke and R. Duncan, Interacting quantum observables: categorical algebra and diagrammatics, New Journal of Physics 13
2011
Earlier work this paper cites.
2012
Earlier work this paper cites.
M. Backens, The ZX-calculus is complete for stabilizer quantum mechanics, New Journal of Physics 16
2014
Earlier work this paper cites.
M. J. Bremner, A. Montanaro, and D. J. Shepherd, Average-Case Complexity Versus Approximate Simulation of Commuting Quantum Computations, Physical Review Letters 117
2016
Cited alongside, same era.
S. Bravyi and D. Gosset, Improved classical simulation of quantum circuits dominated by Clifford gates, Physical Review Letters 116
2016
Cited alongside, same era.
S. Bravyi, G. Smith, and J. A. Smolin, Trading classical and quantum computational resources, Physical Review X 6
2016
Cited alongside, same era.
M. J. Bremner, A. Montanaro, and D. J. Shepherd, Achieving quantum supremacy with sparse and noisy commuting quantum computations, Quantum 1
2017
Cited alongside, same era.
M. Xiao and H. Nagamochi, Exact algorithms for maximum independent set, Information and Computation 255
2017
Cited alongside, same era.
A. Kissinger and J. van de Wetering, Reducing the number of non-Clifford gates in quantum circuits, Physical Review A 102
2020
Later among the works it cites.
N. de Beaudrap, X. Bian, and Q. Wang, Techniques to Reduce π / 4 \pi/4 -Parity-Phase Circuits, Motivated by the ZX Calculus, in Proceedings 16th International Conference on Quantum Physics and Logic, Chapman University, Orange, CA, USA., 10-14 June 2019 , Electronic Proceedings in Theoretical Computer Science, Vol. 318, edited by B. Coecke and M. Leifer (Open Publishing Association, 2020) pp. 131–149
2020
Later among the works it cites.
2021
Later among the works it cites.
2021
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2018
Cited alongside, same era.
E. Jeandel, S. Perdrix, and R. Vilmart, A Complete Axiomatisation of the ZX-calculus for Clifford+T Quantum Mechanics, in Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science (ACM, 2018) pp. 559–568
2018
Cited alongside, same era.
F. Arute, K. Arya, R. Babbush, D. Bacon, J. C. Bardin, R. Barends, R. Biswas, S. Boixo, F. G. Brandao, D. A. Buell, et al. , Quantum supremacy using a programmable superconducting processor, Nature 574
2019
Cited alongside, same era.
S. Bravyi, D. Browne, P. Calpin, E. Campbell, D. Gosset, and M. Howard, Simulation of quantum circuits by low-rank stabilizer decompositions, Quantum 3
2019
Cited alongside, same era.
H. Qassim, H. Pashayan, and D. Gosset, Improved upper bounds on the stabilizer rank of magic states, Quantum 5
Cited in the paper.
H. Qassim, H. Pashayan, and D. Gosset, Improved upper bounds on the stabilizer rank of magic states, Quantum 5
Cited in the paper.
Later among the works it cites.
M. Backens, H. Miller-Bakewell, G. de Felice, L. Lobski, and J. van de Wetering, There and back again: A circuit extraction tale, Quantum 5
2021
Later among the works it cites.
F. Pan, K. Chen, and P. Zhang, Solving the sampling problem of the sycamore quantum circuits, Phys. Rev. Lett. 129
2022
Closest in time.
A. Kissinger and J. van de Wetering, Simulating quantum circuits with ZX-calculus reduced stabiliser decompositions, Quantum Science and Technology 7
2022
Closest in time.
A. Kissinger, J. van de Wetering, and R. Vilmart, Classical Simulation of Quantum Circuits with Partial and Graphical Stabiliser Decompositions, in 17th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2022) , Leibniz International Proceedings in Informatics (LIPIcs), Vol. 232, edited by F. Le Gall and T. Morimae (Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2022) pp. 5:1–5:13
2022
Closest in time.
S. Bravyi, D. Gosset, and Y. Liu, How to simulate quantum measurement without computing marginals, Phys. Rev. Lett. 128
2022
Closest in time.