Saved in:
| Main Authors: | Aliakbarpour, Maryam, Braverman, Vladimir, Chia, Nai-Hui, Lin, Chia-Ying, Liu, Yuhan, Oufkir, Aadil, Shen, Yu-Ching |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2512.05451 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Adversarially robust quantum state learning and testing
by: Aliakbarpour, Maryam, et al.
Published: (2025)
by: Aliakbarpour, Maryam, et al.
Published: (2025)
3-Local Hamiltonian Problem and Constant Relative Error Quantum Partition Function Approximation: $O(2^{\frac{n}{2}})$ Algorithm Is Nearly Optimal under QSETH
by: Chia, Nai-Hui, et al.
Published: (2025)
by: Chia, Nai-Hui, et al.
Published: (2025)
Efficient Matrix Product State Learning in Logarithmic Depth
by: Lin, Chia-Ying, et al.
Published: (2025)
by: Lin, Chia-Ying, et al.
Published: (2025)
On the Need for Large Quantum Depth
by: Chia, Nai-Hui, et al.
Published: (2019)
by: Chia, Nai-Hui, et al.
Published: (2019)
Fine-Grained Complexity for Quantum Problems from Size-Preserving Circuit-to-Hamiltonian Constructions
by: Chia, Nai-Hui, et al.
Published: (2026)
by: Chia, Nai-Hui, et al.
Published: (2026)
Hamiltonian Property Testing
by: Bluhm, Andreas, et al.
Published: (2024)
by: Bluhm, Andreas, et al.
Published: (2024)
Complexity Theory for Quantum Promise Problems
by: Chia, Nai-Hui, et al.
Published: (2024)
by: Chia, Nai-Hui, et al.
Published: (2024)
Oracle Separation between Noisy Quantum Polynomial Time and the Polynomial Hierarchy
by: Chia, Nai-Hui, et al.
Published: (2024)
by: Chia, Nai-Hui, et al.
Published: (2024)
Certifying and learning quantum Ising Hamiltonians
by: Bluhm, Andreas, et al.
Published: (2025)
by: Bluhm, Andreas, et al.
Published: (2025)
Sample-Optimal Quantum Process Tomography with Non-Adaptive Incoherent Measurements
by: Oufkir, Aadil
Published: (2023)
by: Oufkir, Aadil
Published: (2023)
Pauli Measurements Are Near-Optimal for Single-Qubit Tomography
by: Acharya, Jayadev, et al.
Published: (2025)
by: Acharya, Jayadev, et al.
Published: (2025)
Certifying and learning local quantum Hamiltonians
by: Bluhm, Andreas, et al.
Published: (2026)
by: Bluhm, Andreas, et al.
Published: (2026)
Quantum state testing with restricted measurements
by: Liu, Yuhan, et al.
Published: (2024)
by: Liu, Yuhan, et al.
Published: (2024)
Lower Bounds on Relative Error Quantum Compression and Classical Shadows
by: Sankar, Kaushik
Published: (2025)
by: Sankar, Kaushik
Published: (2025)
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)
Improved Lower Bounds for Learning Quantum Channels in Diamond Distance
by: Oufkir, Aadil, et al.
Published: (2026)
by: Oufkir, Aadil, et al.
Published: (2026)
Certificate Games and Consequences for the Classical Adversary Bound
by: Chakraborty, Sourav, et al.
Published: (2022)
by: Chakraborty, Sourav, et al.
Published: (2022)
Quantum channel coding: Approximation algorithms and strong converse exponents
by: Oufkir, Aadil, et al.
Published: (2024)
by: Oufkir, Aadil, et al.
Published: (2024)
New Quantum Algorithms for Computing Quantum Entropies and Distances
by: Wang, Qisheng, et al.
Published: (2022)
by: Wang, Qisheng, et al.
Published: (2022)
Efficient learning of $t$-doped stabilizer states with single-copy measurements
by: Chia, Nai-Hui, et al.
Published: (2023)
by: Chia, Nai-Hui, et al.
Published: (2023)
On the Complexity of the Succinct State Local Hamiltonian Problem
by: Waite, Gabriel, et al.
Published: (2025)
by: Waite, Gabriel, et al.
Published: (2025)
Experimental relativistic zero-knowledge proofs with unconditional security
by: Weng, Chen-Xun, et al.
Published: (2025)
by: Weng, Chen-Xun, et al.
Published: (2025)
Persistent Tensors and Multiqudit Entanglement Transformation
by: Gharahi, Masoud, et al.
Published: (2022)
by: Gharahi, Masoud, et al.
Published: (2022)
Physically-Motivated Guiding States for Local Hamiltonians
by: Waite, Gabriel, et al.
Published: (2025)
by: Waite, Gabriel, et al.
Published: (2025)
Unentangled stoquastic Merlin-Arthur proof systems: the power of unentanglement without destructive interference
by: Liu, Yupan, et al.
Published: (2026)
by: Liu, Yupan, et al.
Published: (2026)
Efficient approximate unitary designs from random Pauli rotations
by: Haah, Jeongwan, et al.
Published: (2024)
by: Haah, Jeongwan, et al.
Published: (2024)
QMA vs. QCMA and Pseudorandomness
by: Liu, Jiahui, et al.
Published: (2024)
by: Liu, Jiahui, et al.
Published: (2024)
StoqMA vs. MA: the power of error reduction
by: Aharonov, Dorit, et al.
Published: (2020)
by: Aharonov, Dorit, et al.
Published: (2020)
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)
Optimal Fidelity Estimation from Binary Measurements for Discrete and Continuous Variable Systems
by: Fawzi, Omar, et al.
Published: (2024)
by: Fawzi, Omar, et al.
Published: (2024)
Efficiently verifiable quantum advantage on near-term analog quantum simulators
by: Liu, Zhenning, et al.
Published: (2024)
by: Liu, Zhenning, et al.
Published: (2024)
Polynomial-Time Classical Simulation of Noisy IQP Circuits with Constant Depth
by: Rajakumar, Joel, et al.
Published: (2024)
by: Rajakumar, Joel, et al.
Published: (2024)
Quantum Merlin-Arthur proof systems for synthesizing quantum states
by: Delavenne, Hugo, et al.
Published: (2023)
by: Delavenne, Hugo, et al.
Published: (2023)
Space-bounded quantum interactive proof systems
by: Gall, François Le, et al.
Published: (2024)
by: Gall, François Le, et al.
Published: (2024)
Incompressibility and spectral gaps of random circuits
by: Chen, Chi-Fang, et al.
Published: (2024)
by: Chen, Chi-Fang, et al.
Published: (2024)
Strong converse exponent of channel interconversion
by: Oufkir, Aadil, et al.
Published: (2025)
by: Oufkir, Aadil, et al.
Published: (2025)
Optimality of meta-converse for channel simulation
by: Oufkir, Aadil, et al.
Published: (2024)
by: Oufkir, Aadil, et al.
Published: (2024)
Error exponent of activated non-signaling assisted classical-quantum channel coding
by: Oufkir, Aadil, et al.
Published: (2024)
by: Oufkir, Aadil, et al.
Published: (2024)
Exponents for classical-quantum channel simulation in purified distance
by: Oufkir, Aadil, et al.
Published: (2024)
by: Oufkir, Aadil, et al.
Published: (2024)
MIPco=coRE
by: Lin, Junqiao
Published: (2025)
by: Lin, Junqiao
Published: (2025)
Similar Items
-
Adversarially robust quantum state learning and testing
by: Aliakbarpour, Maryam, et al.
Published: (2025) -
3-Local Hamiltonian Problem and Constant Relative Error Quantum Partition Function Approximation: $O(2^{\frac{n}{2}})$ Algorithm Is Nearly Optimal under QSETH
by: Chia, Nai-Hui, et al.
Published: (2025) -
Efficient Matrix Product State Learning in Logarithmic Depth
by: Lin, Chia-Ying, et al.
Published: (2025) -
On the Need for Large Quantum Depth
by: Chia, Nai-Hui, et al.
Published: (2019) -
Fine-Grained Complexity for Quantum Problems from Size-Preserving Circuit-to-Hamiltonian Constructions
by: Chia, Nai-Hui, et al.
Published: (2026)