Learning stabilizer structure of quantum states
Fuente:
arXiv
Saved in:
| Main Authors: | Arunachalam, Srinivasan, Dutt, Arkopal |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Polynomial-time tolerant testing stabilizer states
by: Arunachalam, Srinivasan, et al.
Published: (2024)
by: Arunachalam, Srinivasan, et al.
Published: (2024)
A note on polynomial-time tolerant testing stabilizer states
by: Arunachalam, Srinivasan, et al.
Published: (2024)
by: Arunachalam, Srinivasan, et al.
Published: (2024)
Testing and learning structured quantum Hamiltonians
by: Arunachalam, Srinivasan, et al.
Published: (2024)
by: Arunachalam, Srinivasan, et al.
Published: (2024)
Learning depth-3 circuits via quantum agnostic boosting
by: Arunachalam, Srinivasan, et al.
Published: (2025)
by: Arunachalam, Srinivasan, et al.
Published: (2025)
Learning low-degree quantum objects
by: Arunachalam, Srinivasan, et al.
Published: (2024)
by: Arunachalam, Srinivasan, et al.
Published: (2024)
Distributed inner product estimation with limited quantum communication
by: Arunachalam, Srinivasan, et al.
Published: (2024)
by: Arunachalam, Srinivasan, et al.
Published: (2024)
Trade-offs between Entanglement and Communication
by: Arunachalam, Srinivasan, et al.
Published: (2023)
by: Arunachalam, Srinivasan, et al.
Published: (2023)
Random regular graph states are complex at almost any depth
by: Ghosh, Soumik, et al.
Published: (2024)
by: Ghosh, Soumik, et al.
Published: (2024)
Quantum search by continuous-time quantum walk on t-designs
by: Lugão, Pedro H. G., et al.
Published: (2023)
by: Lugão, Pedro H. G., et al.
Published: (2023)
Matrix hypercontractivity, streaming algorithms and LDCs: the large alphabet case
by: Arunachalam, Srinivasan, et al.
Published: (2021)
by: Arunachalam, Srinivasan, et al.
Published: (2021)
Quantum complexity of the Kronecker coefficients
by: Bravyi, Sergey, et al.
Published: (2023)
by: Bravyi, Sergey, et al.
Published: (2023)
The Subgraph Isomorphism Problem for Port Graphs and Quantum Circuits
by: Mondada, Luca, et al.
Published: (2023)
by: Mondada, Luca, et al.
Published: (2023)
A SAT Solver and Computer Algebra Attack on the Minimum Kochen-Specker Problem
by: Li, Zhengyu, et al.
Published: (2023)
by: Li, Zhengyu, et al.
Published: (2023)
Polynomial time classical versus quantum algorithms for representation theoretic multiplicities
by: Panova, Greta
Published: (2025)
by: Panova, Greta
Published: (2025)
Algorithmic Polynomial Freiman-Ruzsa Theorems
by: Arunachalam, Srinivasan, et al.
Published: (2025)
by: Arunachalam, Srinivasan, et al.
Published: (2025)
The Tensor as an Informational Resource
by: Christandl, Matthias
Published: (2023)
by: Christandl, Matthias
Published: (2023)
Learning junta distributions, quantum junta states, and QAC$^0$ circuits
by: Bao, Jinge, et al.
Published: (2024)
by: Bao, Jinge, et al.
Published: (2024)
Quasi-quantum states and the quasi-quantum PCP theorem
by: Arad, Itai, et al.
Published: (2024)
by: Arad, Itai, et al.
Published: (2024)
Performance of Gaussian Boson Sampling on Planted Bipartite Clique Detection
by: Chen, Yu-Zhen Janice, et al.
Published: (2025)
by: Chen, Yu-Zhen Janice, et al.
Published: (2025)
Efficient Algorithms for Weakly-Interacting Quantum Spin Systems
by: Mann, Ryan L., et al.
Published: (2026)
by: Mann, Ryan L., et al.
Published: (2026)
Algorithmic Cluster Expansions for Quantum Problems
by: Mann, Ryan L., et al.
Published: (2023)
by: Mann, Ryan L., et al.
Published: (2023)
Space-bounded quantum state testing via space-efficient quantum singular value transformation
by: Gall, François Le, et al.
Published: (2023)
by: Gall, François Le, et al.
Published: (2023)
Quantum Merlin-Arthur proof systems for synthesizing quantum states
by: Delavenne, Hugo, et al.
Published: (2023)
by: Delavenne, Hugo, et al.
Published: (2023)
An algorithmic Polynomial Freiman-Ruzsa theorem
by: Castro-Silva, Davi, et al.
Published: (2026)
by: Castro-Silva, Davi, et al.
Published: (2026)
Learning quantum states and unitaries of bounded gate complexity
by: Zhao, Haimeng, et al.
Published: (2023)
by: Zhao, Haimeng, et al.
Published: (2023)
Beyond Bell sampling: stabilizer state learning and quantum pseudorandomness lower bounds on qudits
by: Allcock, Jonathan, et al.
Published: (2024)
by: Allcock, Jonathan, et al.
Published: (2024)
Learning quantum states prepared by shallow circuits in polynomial time
by: Landau, Zeph, et al.
Published: (2024)
by: Landau, Zeph, et al.
Published: (2024)
Adversarially robust quantum state learning and testing
by: Aliakbarpour, Maryam, et al.
Published: (2025)
by: Aliakbarpour, Maryam, et al.
Published: (2025)
Efficient witnessing and testing of magic in mixed quantum states
by: Haug, Tobias, et al.
Published: (2025)
by: Haug, Tobias, et al.
Published: (2025)
On the complexity of unique quantum witnesses and quantum approximate counting
by: Anshu, Anurag, et al.
Published: (2024)
by: Anshu, Anurag, et al.
Published: (2024)
Classical versus quantum queries in quantum PCPs with classical proofs
by: Buhrman, Harry, et al.
Published: (2024)
by: Buhrman, Harry, et al.
Published: (2024)
Collapses in quantum-classical probabilistically checkable proofs and the quantum polynomial hierarchy
by: Anand, Kartik, et al.
Published: (2025)
by: Anand, Kartik, et al.
Published: (2025)
Efficiently verifiable quantum advantage on near-term analog quantum simulators
by: Liu, Zhenning, et al.
Published: (2024)
by: Liu, Zhenning, et al.
Published: (2024)
The role of shared randomness in quantum state certification with unentangled measurements
by: Liu, Yuhan, et al.
Published: (2024)
by: Liu, Yuhan, et al.
Published: (2024)
Symmetric quantum computation
by: Castro-Silva, Davi, et al.
Published: (2025)
by: Castro-Silva, Davi, et al.
Published: (2025)
Quantum state isomorphism problems for groups
by: Gheorghiu, Alexandru, et al.
Published: (2026)
by: Gheorghiu, Alexandru, et al.
Published: (2026)
Quantum state testing with restricted measurements
by: Liu, Yuhan, et al.
Published: (2024)
by: Liu, Yuhan, et al.
Published: (2024)
Hardness of approximation for ground state problems
by: Gharibian, Sevag, et al.
Published: (2024)
by: Gharibian, Sevag, et al.
Published: (2024)
Efficient quantum circuits for high-dimensional representations of SU(n) and Ramanujan quantum expanders
by: Iyer, Vishnu, et al.
Published: (2026)
by: Iyer, Vishnu, et al.
Published: (2026)
The power of quantum circuits in sampling
by: Blanc, Guy, et al.
Published: (2025)
by: Blanc, Guy, et al.
Published: (2025)
Similar Items
-
Polynomial-time tolerant testing stabilizer states
by: Arunachalam, Srinivasan, et al.
Published: (2024) -
A note on polynomial-time tolerant testing stabilizer states
by: Arunachalam, Srinivasan, et al.
Published: (2024) -
Testing and learning structured quantum Hamiltonians
by: Arunachalam, Srinivasan, et al.
Published: (2024) -
Learning depth-3 circuits via quantum agnostic boosting
by: Arunachalam, Srinivasan, et al.
Published: (2025) -
Learning low-degree quantum objects
by: Arunachalam, Srinivasan, et al.
Published: (2024)