Pseudoentanglement Ain't Cheap

Both Toffoli and Controlled-NOT need little help to do universal quantum computation, 2002

Yaoyun Shi · 2002

Earlier work this paper cites.

Quantum Circuits That Can Be Simulated Classically in Polynomial Time

Leslie G. Valiant · 2002

Earlier work this paper cites.

Improved Simulation of Stabilizer Circuits

Scott Aaronson and Daniel Gottesman · 2004

Earlier work this paper cites.

Entanglement in the stabilizer formalism, 2004

David Fattal, Toby S. Cubitt, Yoshihisa Yamamoto, Sergey Bravyi, and Isaac L. Chuang · 2004

Earlier work this paper cites.

Universal quantum computation with ideal Clifford gates and noisy ancillas

Sergey Bravyi and Alexei Kitaev · 2005

Earlier work this paper cites.

A sharp continuity estimate for the von Neumann entropy

Koenraad M. R. Audenaert · 2007

Earlier work this paper cites.

Identifying Stabilizer States, 2008

Scott Aaronson and Daniel Gottesman · 2008

Earlier work this paper cites.

Cryptography with Constant Computational Overhead

Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, and Amit Sahai · 2008

Earlier work this paper cites.

Improved Classical Simulation of Quantum Circuits Dominated by Clifford Gates

Sergey Bravyi and David Gosset · 2016

Earlier work this paper cites.

Learning stabilizer states by Bell sampling, 2017

Original

Ashley Montanaro · 2017

Earlier work this paper cites.

Simulation of quantum circuits by low-rank stabilizer decompositions

Sergey Bravyi, Dan Browne, Padraic Calpin, Earl Campbell, David Gosset, and Mark Howard · 2019

Cited alongside, same era.

Simulation of qubit quantum circuits via Pauli propagation

Patrick Rall, Daniel Liang, Jeremy Cook, and William Kretschmer · 2019

Cited alongside, same era.

Schur–Weyl duality for the Clifford group with applications: Property testing, a robust Hudson theorem, and de Finetti representations

David Gross, Sepehr Nezami, and Michael Walter · 2021

Cited alongside, same era.

The Exact Complexity of Pseudorandom Functions and the Black-Box Natural Proof Barrier for Bootstrapping Results in Computational Complexity

Zhiyuan Fan, Jiatu Li, and Tianqi Yang · 2022

Cited alongside, same era.

Learning Quantum Circuits of Some T T Gates

Ching-Yi Lai and Hao-Chung Cheng · 2022

Cited alongside, same era.

Efficient Learning of Quantum States Prepared With Few Non-Clifford Gates II: Single-Copy Measurements, 2023

Original

Sabee Grewal, Vishnu Iyer, William Kretschmer, and Daniel Liang · 2023

Later among the works it cites.

Improved Stabilizer Estimation via Bell Difference Sampling, 2023

Original

Sabee Grewal, Vishnu Iyer, William Kretschmer, and Daniel Liang · 2023

Later among the works it cites.

Low-Stabilizer-Complexity Quantum States Are Not Pseudorandom

Sabee Grewal, Vishnu Iyer, William Kretschmer, and Daniel Liang · 2023

Later among the works it cites.

Pseudorandomness from subset states, 2023

Original

Tudor Giurgica-Tiron and Adam Bouland · 2023

Later among the works it cites.

Bell sampling from quantum circuits, 2023

Original