Cover Image

Approximating the quantum value of an LCS game is RE-hard

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Taller, Aviv, Vidick, Thomas
Format:	Preprint
Published:	2025
Subjects:	Computational Complexity Mathematical Physics Quantum Physics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Quantum Interactive Oracle Proofs
by: Sun, Baocheng, et al.
Published: (2026)

Derandomised tensor product gap amplification for quantum Hamiltonians
by: Bergamaschi, Thiago, et al.
Published: (2025)

Non-signalling parallel repetition using de Finetti reductions
by: Arnon, Rotem, et al.
Published: (2014)

Expansion of higher-dimensional cubical complexes with application to quantum locally testable codes
by: Dinur, Irit, et al.
Published: (2024)

Quantum Kolmogorov complexity and quantum correlations in deterministic-control quantum Turing machines
by: Lemus, Mariano, et al.
Published: (2023)

Classically estimating observables of noiseless quantum circuits
by: Angrisani, Armando, et al.
Published: (2024)

Complexity of quantum circuits via sensitivity, magic, and coherence
by: Bu, Kaifeng, et al.
Published: (2022)

Efficient simulation of parametrized quantum circuits under non-unital noise through Pauli backpropagation
by: Martinez, Victor, et al.
Published: (2025)

A polynomial-time classical algorithm for noisy quantum circuits
by: Schuster, Thomas, et al.
Published: (2024)

Optimising quantum circuits is generally hard
by: van de Wetering, John, et al.
Published: (2023)

Proof of Hiding Conjecture in Gaussian Boson Sampling
by: Shou, Laura, et al.
Published: (2025)

On the Computational Complexity of Schrödinger Operators
by: Zheng, Yufan, et al.
Published: (2024)

Stabilizer Testing and Magic Entropy via Quantum Fourier Analysis
by: Bu, Kaifeng, et al.
Published: (2023)

Fermionic Gaussian Testing and Non-Gaussian Measures via Convolution
by: Lyu, Xingjian, et al.
Published: (2024)

Gap-preserving reductions and RE-completeness of independent set games
by: Mančinska, Laura, et al.
Published: (2025)

Rapidly mixing loop representation quantum Monte Carlo for Heisenberg models on star-like bipartite graphs
by: Takahashi, Jun, et al.
Published: (2024)

The status of the quantum PCP conjecture (games version)
by: Natarajan, Anand, et al.
Published: (2024)

Unitary designs in nearly optimal depth
by: Cui, Laura, et al.
Published: (2025)

How to Construct Random Unitaries
by: Ma, Fermi, et al.
Published: (2024)

Rational degree is polynomially related to degree
by: Kothari, Robin, et al.
Published: (2026)

A learning theory for quantum photonic processors and beyond
by: Rosati, Matteo
Published: (2022)

Optimal, Qubit-Efficient Quantum Vehicle Routing via Colored-Permutations
by: Onah, Chinonso, et al.
Published: (2026)

Poincaré Duality and Multiplicative Structures on Quantum Codes
by: Li, Yiming, et al.
Published: (2025)

Classifying Entanglement by Algebraic Geometry
by: Gharahi, Masoud
Published: (2024)

Persistent Tensors and Multiqudit Entanglement Transformation
by: Gharahi, Masoud, et al.
Published: (2022)

Space-bounded quantum state testing via space-efficient quantum singular value transformation
by: Gall, François Le, et al.
Published: (2023)

Complexity and hardness of random peaked circuits
by: Zhang, Yuxuan
Published: (2025)

On the hardness of cloning and connections to representation theory
by: Havlíček, Vojtěch, et al.
Published: (2024)

Convergence efficiency of quantum gates and circuits
by: Kong, Linghang, et al.
Published: (2024)

Quantum Max-Cut is NP hard to approximate
by: Piddock, Stephen
Published: (2025)

How hard is it to verify a classical shadow?
by: Karaiskos, Georgios, et al.
Published: (2025)

DQC1-hardness of estimating correlation functions
by: Moulik, Subhayan Roy, et al.
Published: (2024)

Exact Quantum Circuit Optimization is co-NQP-hard
by: Kjelstrøm, Adam Husted, et al.
Published: (2025)

Exponential improvements to the average-case hardness of BosonSampling
by: Bouland, Adam, et al.
Published: (2024)

Fermionic Independent Set and Laplacian of an independence complex are QMA-hard
by: Rayudu, Chaithanya
Published: (2024)

Fundamental Limitations of QAOA on Constrained Problems and a Route to Exponential Enhancement
by: Onah, Chinonso, et al.
Published: (2025)

A new class of coherent states involving Fox-Wright functions and their generalization in the bicomplex framework
by: Bera, Snehasis, et al.
Published: (2026)

Computational hardness of estimating quantum entropies via binary entropy bounds
by: Liu, Yupan
Published: (2026)

Quon Classical Simulation: Unifying Cliffords, Matchgates and Entanglement
by: Feng, Zixuan, et al.
Published: (2025)

The Complexity of Translationally Invariant Problems beyond Ground State Energies
by: Watson, James D., et al.
Published: (2020)