Fetching the paper…
Reading the bibliography…
We consider the following task: suppose an algorithm is given copies of an unknown $n$-qubit quantum state $|\psi\rangle$ promised $(i)$ $|\psi\rangle$ is $\varepsilon_1$-close to a stabilizer state in fidelity or $(ii)$ $|\psi\rangle$ is $\varepsilon_2$-far from all stabilizer states, decide which is the case.
Self-testing/correcting with applications to numerical problems
M. Blum, M. Luby, and R. Rubinfeld · 1990
Earlier work this paper cites.
A statistical theorem of set addition
Antal Balog and Endre Szemerédi · 1994
Earlier work this paper cites.
An analog of Freiman’s theorem in groups
Imre Ruzsa · 1999
Earlier work this paper cites.
Efficient testing of large graphs
Noga Alon, Eldar Fischer, Michael Krivelevich, and Mario Szegedy · 2000
Earlier work this paper cites.
A new proof of Szemerédi’s theorem
William T Gowers · 2001
Earlier work this paper cites.
Testing low-degree polynomials over GF(2)
Noga Alon, Tali Kaufman, Michael Krivelevich, Simon Litsyn, and Dana Ron · 2003
Earlier work this paper cites.
Three theorems regarding testing graph properties
Oded Goldreich and Luca Trevisan · 2003
Earlier work this paper cites.
Entanglement in the stabilizer formalism
David Fattal, Toby S Cubitt, Yoshihisa Yamamoto, Sergey Bravyi, and Isaac L Chuang · 2004
Earlier work this paper cites.
Testing Juntas
Eldar Fischer, Guy Kindler, Dana Ron, Shmuel Safra, and Alex Samorodnitsky · 2004
Earlier work this paper cites.
Tolerant versus intolerant testing for Boolean properties
Eldar Fischer and Lance Fortnow · 2005
Earlier work this paper cites.
Tolerant property testing and distance approximation
Michal Parnas, Dana Ron, and Ronitt Rubinfeld · 2006
Earlier work this paper cites.
Gowers uniformity, influence of variables, and PCPs
Alex Samorodnitsky and Luca Trevisan · 2006
Earlier work this paper cites.
Additive Combinatorics
Terence Tao and Van H. Vu · 2006
Earlier work this paper cites.
Testing for Concise Representations
Ilias Diakonikolas, Homin K. Lee, Kevin Matulef, Krzysztof Onak, Ronitt Rubinfeld, Rocco A. Servedio, and Andrew Wan · 2007
Earlier work this paper cites.
Low-degree tests at large distances
Alex Samorodnitsky · 2007
Earlier work this paper cites.
An inverse theorem for the Gowers U 3 ( G ) U^{3}(G) norm
Ben Green and Terence Tao · 2008
Earlier work this paper cites.
The Gowers norm in the testing of Boolean functions
Victor Yen-Wen Chen · 2009
Earlier work this paper cites.
The distribution of polynomials over finite fields, with applications to the Gowers norms
Ben Green and Terence Tao · 2009
Earlier work this paper cites.
Guest column: Additive combinatorics and theoretical computer science
Luca Trevisan · 2009
Cited alongside, same era.
Pseudorandom bits for polynomials
Andrej Bogdanov and Emanuele Viola · 2010
Cited alongside, same era.
Selected Results in Additive Combinatorics: An Exposition
Emanuele Viola · 2011
Cited alongside, same era.
Testing product states, quantum Merlin-Arthur games and tensor optimization
Aram W. Harrow and Ashley Montanaro · 2013
Cited alongside, same era.
Quadratic Goldreich–Levin Theorems
Madhur Tulsiani and Julia Wolf · 2014
Cited alongside, same era.
Learning stabilizer states by Bell sampling
Ashley Montanaro · 2017
Cited alongside, same era.
Testing matrix product states
Mehdi Soleimanifar and John Wright · 2022
Later among the works it cites.
Optimal Algorithms for Learning Quantum Phase States
Srinivasan Arunachalam, Sergey Bravyi, Arkopal Dutt, and Theodore J. Yoder · 2023
Later among the works it cites.
WT Gowers, Ben Green, Freddie Manners, and Terence Tao · 2023
Later among the works it cites.
Efficient learning of quantum states prepared with few non-Clifford gates
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.
Cubic Goldreich-Levin
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Shadow tomography of quantum states
Scott Aaronson · 2018
Cited alongside, same era.
Higher-order fourier analysis and applications
Hamed Hatami, Pooya Hatami, Shachar Lovett, et al · 2019
Cited alongside, same era.
Efficient estimation of Pauli channels
Steven T Flammia and Joel J Wallman · 2020
Cited alongside, same era.
Distributional Property Testing in a Quantum World
András Gilyén and Tongyang Li · 2020
Cited alongside, same era.
Sample-efficient learning of interacting quantum systems
Anurag Anshu, Srinivasan Arunachalam, Tomotaka Kuwahara, and Mehdi Soleimanifar · 2021
Cited alongside, same era.
Improved quantum data analysis
Costin Bădescu and Ryan O’Donnell · 2021
Cited alongside, same era.
Dain Kim, Anqi Li, and Jonathan Tidor · 2023
Later among the works it cites.
A note on polynomial-time tolerant testing stabilizer states, 2024
Srinivasan Arunachalam, Sergey Bravyi, and Arkopal Dutt · 2024
Closest in time.
Towards tolerant testing stabilizer states (v2)
Srinivasan Arunachalam and Arkopal Dutt · 2024
Closest in time.
Quantum worst-case to average-case reductions for all linear problems
Vahid R Asadi, Alexander Golovnev, Tom Gur, Igor Shinkar, and Sathyawageeswar Subramanian · 2024
Closest in time.
Zongbo Bao, Philippe van Dordrecht, and Jonas Helsen · 2024
Closest in time.
Optimal tradeoffs for estimating Pauli observables
Sitan Chen, Weiyuan Gong, and Qi Ye · 2024
Closest in time.
Stabilizer bootstrapping: A recipe for efficient agnostic tomography and magic estimation
Sitan Chen, Weiyuan Gong, Qi Ye, and Zhihan Zhang · 2024
Closest in time.
Marton’s conjecture in Abelian groups with bounded torsion
WT Gowers, Ben Green, Freddie Manners, and Terence Tao · 2024
Closest in time.
Improved Stabilizer Estimation via Bell Difference Sampling
Sabee Grewal, Vishnu Iyer, William Kretschmer, and Daniel Liang · 2024
Closest in time.
Triply efficient shadow tomography
Robbie King, David Gosset, Robin Kothari, and Ryan Babbush · 2024
Closest in time.
Improved Exponent for Marton’s Conjecture in 𝔽 2 n \mathbb{F}_{2}^{n}
Jyun-Jie Liao · 2024
Closest in time.
Improved bounds for testing low stabilizer complexity states, 2024
Saeed Mehraban and Mehrdad Tahmasbi · 2024
Closest in time.
Quadratic lower bounds on the approximate stabilizer rank: A probabilistic approach
Saeed Mehraban and Mehrdad Tahmasbi · 2024
Closest in time.