Papers
Topics
Authors
Recent
2000 character limit reached

Tolerant testing of stabilizer states with a polynomial gap via a generalized uncertainty relation (2410.21811v1)

Published 29 Oct 2024 in quant-ph

Abstract: We prove a conjecture of Arunachalam & Dutt ([AD24]) on the existence of a tolerant stabilizer testing algorithm, and achieve an exponential improvement in the parameters of the tester. Key to our argument is a generalized uncertainty relation for sets of Pauli operators, based on the Lovasz theta function.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (11)
  1. Srinivasan Arunachalam, Sergey Bravyi and Arkopal Dutt. A note on polynomial-time tolerant testing stabilizer states. In preparation, 2024.
  2. Towards tolerant testing stabilizer states. arXiv preprint arXiv:2408.06289v2, 2024.
  3. Low-stabilizer-complexity quantum states are not pseudorandom. arXiv preprint arXiv:2209.14530, 2022.
  4. Improved stabilizer estimation via bell difference sampling. In Proceedings of the 56th Annual ACM Symposium on Theory of Computing, pages 1352–1363, 2024.
  5. Schur–weyl duality for the clifford group with applications: Property testing, a robust hudson theorem, and de finetti representations. Communications in Mathematical Physics, 385(3):1325–1393, 2021.
  6. Optimizing strongly interacting fermionic hamiltonians. In Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, pages 776–789, 2022.
  7. Donald E Knuth. The sandwich theorem. arXiv preprint math/9312214, 1993.
  8. Entanglement can increase asymptotic rates of zero-error classical communication over classical channels. Communications in Mathematical Physics, 311:97–111, 2012.
  9. László Lovász. On the shannon capacity of a graph. IEEE Transactions on Information theory, 25(1):1–7, 1979.
  10. Igal Sason. Observations on graph invariants with the lovász ϑitalic-ϑ\varthetaitalic_ϑ-function. arXiv preprint arXiv:2310.19169, 2023.
  11. Emanuele Viola. Selected results in additive combinatorics: An exposition. Theory of Computing, pages 1–15, 2011.
Citations (3)

Summary

We haven't generated a summary for this paper yet.

Whiteboard

Video Overview

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 1 tweet with 2 likes about this paper.