Fetching the paper…
Reading the bibliography…
Non-stabilizerness or magic resource characterizes the amount of non-Clifford operations needed to prepare quantum states.
P. W. Shor, Fault-tolerant quantum computation, in Proceedings of 37th Conference on Foundations of Computer Science (IEEE, 1996) pp. 56–65
1996
Earlier work this paper cites.
J. Preskill, Fault-tolerant quantum computation, in Introduction to quantum computation and information (World Scientific, 1998) pp. 213–269
1998
Earlier work this paper cites.
D. Gottesman and I. L. Chuang, Demonstrating the viability of universal quantum computation using teleportation and single-qubit operations, Nature 402
1999
Earlier work this paper cites.
M. A. Nielsen and I. Chuang, Quantum computation and quantum information (2002)
2002
Earlier work this paper cites.
A. K. Ekert, C. M. Alves, D. K. Oi, M. Horodecki, P. Horodecki, and L. C. Kwek, Direct estimations of linear and nonlinear functionals of a quantum state, Physical review letters 88
2002
Earlier work this paper cites.
D. A. Meyer and N. R. Wallach, Global entanglement in multiparticle systems, Journal of Mathematical Physics 43
2002
Earlier work this paper cites.
A. Y. Kitaev, Fault-tolerant quantum computation by anyons, Annals of Physics 303
2003
Earlier work this paper cites.
J. Dehaene and B. De Moor, Clifford group, stabilizer states, and linear and quadratic operations over gf (2), Physical Review A 68
2003
Earlier work this paper cites.
G. K. Brennen, An observable measure of entanglement for pure states of multi-qubit systems, arXiv preprint quant-ph/0305094 (2003)
2003
Earlier work this paper cites.
S. Aaronson and D. Gottesman, Improved simulation of stabilizer circuits, Physical Review A 70
2004
Earlier work this paper cites.
S. Bravyi and A. Kitaev, Universal quantum computation with ideal clifford gates and noisy ancillas, Physical Review A 71
2005
Earlier work this paper cites.
N. Gisin and R. Thew, Quantum communication, Nature photonics 1
2007
Earlier work this paper cites.
I. Nechita, Asymptotics of random density matrices, in Annales Henri Poincaré , Vol. 8 (Springer, 2007) pp. 1521–1538
2007
Earlier work this paper cites.
R. A. Low, Learning and testing algorithms for the clifford group, Physical Review A 80
2009
Earlier work this paper cites.
E. T. Campbell, Catalysis and activation of magic states in fault-tolerant architectures, Physical Review A 83
2011
Earlier work this paper cites.
J. C. Garcia-Escartin and P. Chamorro-Posada, Swap test and hong-ou-mandel effect are equivalent, Physical Review A 87
2013
Earlier work this paper cites.
A. W. Harrow and A. Montanaro, Testing product states, quantum merlin-arthur games and tensor optimization, Journal of the ACM (JACM) 60
2013
Earlier work this paper cites.
M. Howard, J. Wallman, V. Veitch, and J. Emerson, Contextuality supplies the ‘magic’ for quantum computation, Nature 510
2014
Earlier work this paper cites.
V. Veitch, S. H. Mousavian, D. Gottesman, and J. Emerson, The resource theory of stabilizer quantum computation, New Journal of Physics 16
2014
Earlier work this paper cites.
A. Peruzzo, J. McClean, P. Shadbolt, M.-H. Yung, X.-Q. Zhou, P. J. Love, A. Aspuru-Guzik, and J. L. Obrien, A variational eigenvalue solver on a photonic quantum processor, Nature communications 5
2014
Earlier work this paper cites.
D. P. Kingma and J. Ba, Adam: A method for stochastic optimization, arXiv:1412.6980 (2014)
2014
Earlier work this paper cites.
H. Pashayan, J. J. Wallman, and S. D. Bartlett, Estimating outcome probabilities of quantum circuits using quasiprobabilities, Physical review letters 115
2015
Earlier work this paper cites.
N. Delfosse, P. A. Guerin, J. Bian, and R. Raussendorf, Wigner function negativity and contextuality in quantum computation on rebits, Physical Review X 5
2015
Earlier work this paper cites.
R. Islam, R. Ma, P. M. Preiss, M. E. Tai, A. Lukin, M. Rispoli, and M. Greiner, Measuring entanglement entropy in a quantum many-body system, Nature 528
2015
Earlier work this paper cites.
Z. Webb, The clifford group forms a unitary 3-design, arXiv preprint arXiv:1510.02769 (2015)
2015
Earlier work this paper cites.
K. P. Seshadreesan, M. Berta, and M. M. Wilde, Rényi squashed entanglement, discord, and relative entropy differences, Journal of Physics A: Mathematical and Theoretical 48
2015
Earlier work this paper cites.
S. Bravyi, G. Smith, and J. A. Smolin, Trading classical and quantum computational resources, Physical Review X 6
2016
Earlier work this paper cites.
J. J. Wallman and J. Emerson, Noise tailoring for scalable quantum computation via randomized compiling, Physical Review A 94
2016
Earlier work this paper cites.
F. G. Brandao, A. W. Harrow, and M. Horodecki, Local random quantum circuits are approximate polynomial-designs, Communications in Mathematical Physics 346
2016
Cited alongside, same era.
A. M. Kaufman, M. E. Tai, A. Lukin, M. Rispoli, R. Schittko, P. M. Preiss, and M. Greiner, Quantum thermalization through entanglement in an isolated many-body system, Science 353
2016
Cited alongside, same era.
E. T. Campbell, B. M. Terhal, and C. Vuillot, Roads towards fault-tolerant universal quantum computation, Nature 549
2017
Cited alongside, same era.
M. Howard and E. Campbell, Application of a resource theory for magic states to fault-tolerant quantum computing, Physical Review Letters 118
2017
Cited alongside, same era.
A. Montanaro, Learning stabilizer states by bell sampling, arXiv:1707.04012 (2017)
C. D. White, C. Cao, and B. Swingle, Conformal field theories are magical, Physical Review B 103
2021
Later among the works it cites.
S. Endo, Z. Cai, S. C. Benjamin, and X. Yuan, Hybrid quantum-classical algorithms and quantum error mitigation, Journal of the Physical Society of Japan 90
2021
Later among the works it cites.
M. Urbanek, B. Nachman, V. R. Pascuzzi, A. He, C. W. Bauer, and W. A. de Jong, Mitigating depolarizing noise on quantum computers with noise-estimation circuits, Physical Review Letters 127
2021
Later among the works it cites.
B. van Straaten and B. Koczor, Measurement cost of metric-aware variational quantum algorithms, PRX Quantum 2
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…
2017
Cited alongside, same era.
J. Preskill, Quantum computing in the nisq era and beyond, Quantum 2
2018
Cited alongside, same era.
K. Mitarai, M. Negoro, M. Kitagawa, and K. Fujii, Quantum circuit learning, Physical Review A 98
2018
Cited alongside, same era.
J. R. McClean, S. Boixo, V. N. Smelyanskiy, R. Babbush, and H. Neven, Barren plateaus in quantum neural network training landscapes, Nature communications 9
2018
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.
J. R. Seddon and E. T. Campbell, Quantifying magic for multi-qubit operations, Proceedings of the Royal Society A 475
2019
Cited alongside, same era.
M. Heinrich and D. Gross, Robustness of magic and symmetries of the stabiliser polytope, Quantum 3
2019
Cited alongside, same era.
X. Wang, M. M. Wilde, and Y. Su, Quantifying the magic of quantum channels, New Journal of Physics 21
2019
Cited alongside, same era.
Later among the works it cites.
A. Mari, T. R. Bromley, and N. Killoran, Estimating the gradient and higher-order derivatives on quantum hardware, Physical Review A 103
2021
Later among the works it cites.
D. Gross, S. Nezami, and M. 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
Later among the works it cites.
C. O. Marrero, M. Kieferová, and N. Wiebe, Entanglement-induced barren plateaus, PRX Quantum 2
2021
Later among the works it cites.
2021
Later among the works it cites.
2022
Closest in time.
L. Leone, S. F. Oliviero, and A. Hamma, Stabilizer rényi entropy, Physical Review Letters 128
2022
Closest in time.
2022
Closest in time.
O. Hahn, A. Ferraro, L. Hultquist, G. Ferrini, and L. García-Álvarez, Quantifying qubit magic with gottesman-kitaev-preskill encoding, Physical Review Letters 128
2022
Closest in time.
2022
Closest in time.
H. Dai, S. Fu, and S. Luo, Detecting magic states via characteristic functions, International Journal of Theoretical Physics 61
2022
Closest in time.
K. Bharti, A. Cervera-Lierta, T. H. Kyaw, T. Haug, S. Alperin-Lea, A. Anand, M. Degroote, H. Heimonen, J. S. Kottmann, T. Menke, W.-K. Mok, S. Sim, L.-C. Kwek, and A. Aspuru-Guzik, Noisy intermediate-scale quantum algorithms, Rev. Mod. Phys. 94
2022
Closest in time.
Y. Zhao, Y. Ye, H.-L. Huang, Y. Zhang, D. Wu, H. Guan, Q. Zhu, Z. Wei, T. He, S. Cao, et al. , Realization of an error-correcting surface code with superconducting qubits, Physical Review Letters 129
2022
Closest in time.
Z.-W. Liu and A. Winter, Many-body quantum magic, PRX Quantum 3
2022
Closest in time.
D. Aharonov, J. Cotler, and X.-L. Qi, Quantum algorithmic measurement, Nature communications 13
2022
Closest in time.
S. Chen, J. Cotler, H.-Y. Huang, and J. Li, Exponential separations between learning with and without quantum memory, in 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS) (IEEE, 2022) pp. 574–585
2022
Closest in time.
H.-Y. Huang, M. Broughton, J. Cotler, S. Chen, J. Li, M. Mohseni, H. Neven, R. Babbush, R. Kueng, J. Preskill, et al. , Quantum advantage in learning from experiments, Science 376
2022
Closest in time.
M. Fishman, S. White, and E. Stoudenmire, The itensor software library for tensor network calculations, SciPost Physics Codebases , 004 (2022)
2022
Closest in time.
J. Haferkamp, F. Montealegre-Mora, M. Heinrich, J. Eisert, D. Gross, and I. Roth, Efficient unitary designs with a system-size independent number of non-clifford gates, Communications in Mathematical Physics , 1 (2022)
2022
Closest in time.
T. Haug and M. S. Kim, Natural parametrized quantum circuit, Phys. Rev. A 106
2022
Closest in time.
Z. Holmes, K. Sharma, M. Cerezo, and P. J. Coles, Connecting ansatz expressibility to gradient magnitudes and barren plateaus, PRX Quantum 3
2022
Closest in time.
S. True and A. Hamma, Transitions in Entanglement Complexity in Random Circuits, Quantum 6
2022
Closest in time.