Fetching the paper…
Reading the bibliography…
Magic states, pivotal for universal quantum computation via classically simulable Clifford gates, often undergo decomposition into resourceless stabilizer states, facilitating simulation through classical means.
“Über das Paulische Äquivalenzverbot”
P. Jordan and E. Wigner · 1928
Earlier work this paper cites.
“An introduction to complex analysis in several variables”
L. Hormander · 1973
Earlier work this paper cites.
“Functional analysis”
Walter Rudin · 1991
Earlier work this paper cites.
“The heisenberg representation of quantum computers” (1998)
Daniel Gottesman · 1998
Earlier work this paper cites.
“Applications of second-order cone programming”
Miguel Sousa Lobo, Lieven Vandenberghe, Stephen Boyd, and Hervé Lebret · 1998
Earlier work this paper cites.
“Quantum computers that can be simulated classically in polynomial time”
Leslie G Valiant · 2001
Earlier work this paper cites.
“Fermionic linear optics and matchgates” (2001)
Emanuel Knill · 2001
Earlier work this paper cites.
“Second-order cone programming”
F. Alizadeh and Donald Goldfarb · 2001
Earlier work this paper cites.
“Classical simulation of noninteracting-fermion quantum circuits”
Barbara M. Terhal and David P. DiVincenzo · 2002
Earlier work this paper cites.
“Lagrangian representation for fermionic linear optics”
Sergey Bravyi · 2004
Earlier work this paper cites.
“Randomizing quantum states: Constructions and applications”
Patrick Hayden, Debbie Leung, Peter W. Shor, and Andreas Winter · 2004
Cited alongside, same era.
“Convex optimization”
Stephen Boyd and Lieven Vandenberghe · 2004
Cited alongside, same era.
“Classical simulation of quantum supremacy circuits” (2020)
Cupjin Huang, Fang Zhang, Michael Newman, Junjie Cai, Xun Gao, Zhengxiong Tian, Junyin Wu, Haihong Xu, Huanjun Yu, Bo Yuan, Mario Szegedy, Yaoyun Shi, and Jianxin Chen · 2005
Cited alongside, same era.
“Universal quantum computation with ideal clifford gates and noisy ancillas”
Sergey Bravyi and Alexei Kitaev · 2005
Cited alongside, same era.
“Matchgates and classical simulation of quantum circuits”
Richard Jozsa and Akimasa Miyake · 2008
Cited alongside, same era.
“Extending matchgates into universal quantum computation”
“Simulation of quantum circuits by low-rank stabilizer decompositions”
Sergey Bravyi, Dan Browne, Padraic Calpin, Earl Campbell, David Gosset, and Mark Howard · 2019
Later among the works it cites.
“SciPy 1.0: Fundamental Algorithms for Scientific Computing in Python”
Pauli Virtanen, Ralf Gommers, Travis E. Oliphant, Matt Haberland, Tyler Reddy, David Cournapeau, Evgeni Burovski, Pearu Peterson, Warren Weckesser, Jonathan Bright, Stéfan J. van der Walt, Matthew Brett, Joshua Wilson, K. Jarrod Millman, Nikolay Mayorov, Andrew R. J. Nelson, Eric Jones, Robert Kern, Eric Larson, C J Carey, İlhan Polat, Yu Feng, Eric W. Moore, Jake VanderPlas, Denis Laxalde, Josef Perktold, Robert Cimrman, Ian Henriksen, E. A. Quintero, Charles R. Harris, Anne M. Archibald, Antônio H. Ribeiro, Fabian Pedregosa, Paul van Mulbregt, and SciPy 1.0 Contributors · 2020
Later among the works it cites.
“Stabilizer extent is not multiplicative”
Arne Heimendahl, Felipe Montealegre-Mora, Frank Vallentin, and David Gross · 2021
Later among the works it cites.
“Stabilizer rank and higher-order fourier analysis”
Farrokh Labib · 2022
Later among the works it cites.
“New techniques for bounding stabilizer rank”
Benjamin Lovitz and Vincent Steffan · 2022
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Daniel J Brod and Ernesto F Galvao · 2011
Cited alongside, same era.
“Classical simulation complexity of extended clifford circuits” (2013)
Richard Jozsa and Maarten Van den Nest · 2013
Cited alongside, same era.
“Trading classical and quantum computational resources”
Sergey Bravyi, Graeme Smith, and John A. Smolin · 2016
Cited alongside, same era.
“Improved classical simulation of quantum circuits dominated by clifford gates”
Sergey Bravyi and David Gosset · 2016
Cited alongside, same era.
“All pure fermionic non-gaussian states are magic states for matchgate computations”
M. Hebenstreit, R. Jozsa, B. Kraus, S. Strelchuk, and M. Yoganathan · 2019
Cited alongside, same era.
“Quantum supremacy using a programmable superconducting processor”
Frank Arute, Kunal Arya, Ryan Babbush, Dave Bacon, Joseph C. Bardin, Rami Barends, Rupak Biswas, Sergio Boixo, Fernando G. S. L. Brandao, David A. Buell, Brian Burkett, Yu Chen, Zijun Chen, Ben Chiaro, Roberto Collins, William Courtney, Andrew Dunsworth, Edward Farhi, Brooks Foxen, Austin Fowler, Craig Gidney, Marissa Giustina, Rob Graff, Keith Guerin, Steve Habegger, Matthew P. Harrigan, Michael J. Hartmann, Alan Ho, Markus Hoffmann, Trent Huang, Travis S. Humble, Sergei V. Isakov, Evan Jeffrey, Zhang Jiang, Dvir Kafri, Kostyantyn Kechedzhi, Julian Kelly, Paul V. Klimov, Sergey Knysh, Alexander Korotkov, Fedor Kostritsa, David Landhuis, Mike Lindmark, Erik Lucero, Dmitry Lyakh, Salvatore Mandrà, Jarrod R. McClean, Matthew McEwen, Anthony Megrant, Xiao Mi, Kristel Michielsen, Masoud Mohseni, Josh Mutus, Ofer Naaman, Matthew Neeley, Charles Neill, Murphy Yuezhen Niu, Eric Ostby, Andre Petukhov, John C. Platt, Chris Quintana, Eleanor G. Rieffel, Pedram Roushan, Nicholas C. Rubin, Daniel Sank, Kevin J. Satzinger, Vadim Smelyanskiy, Kevin J. Sung, Matthew D. Trevithick, Amit Vainsencher, Benjamin Villalonga, Theodore White, Z. Jamie Yao, Ping Yeh, Adam Zalcman, Hartmut Neven, and John M. Martinis
Cited in the paper.
“Lower bounds on stabilizer rank”
Shir Peleg, Amir Shpilka, and Ben Lee Volk · 2022
Later among the works it cites.
“Evidence for the utility of quantum computing before fault tolerance”
Youngseok Kim, Andrew Eddins, Sajant Anand, Ken Xuan Wei, Ewout van den Berg, Sami Rosenblatt, Hasan Nayfeh, Yantao Wu, Michael Zaletel, Kristan Temme, and Abhinav Kandala · 2023
Closest in time.
“Quadratic lower bounds on the approximate stabilizer rank: A probabilistic approach” (2023)
Saeed Mehraban and Mehrdad Tahmasbi · 2023
Closest in time.
Oliver Reardon-Smith, Michał Oszmaniec, and Kamil Korzekwa · 2023
Closest in time.
“Classical simulation of non-Gaussian fermionic circuits” (2023) arXiv:2307.12912
Beatriz Dias and Robert Koenig · 2023
Closest in time.