Imagen de Portada

Two Simple Proofs of Müller's Theorem

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Epstein, Samuel
Formato:	Preprint
Publicado:	2024
Materias:	Computational Complexity Quantum Physics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Two Quantum Paradigms, but Still No Signal
por: Epstein, Samuel
Publicado: (2024)

Semi-Classical Subspaces, The No Synchronization Law, and More
por: Epstein, Samuel
Publicado: (2024)

Some Implications of the Independence Postulate for Physics
por: Epstein, Samuel
Publicado: (2023)

On the Algorithmic Information Between Probabilities
por: Epstein, Samuel
Publicado: (2023)

Quantum Interactive Oracle Proofs
por: Sun, Baocheng, et al.
Publicado: (2026)

Multi-Prover Interactive Proof Systems with Leakage
por: Asadi, Vahid R., et al.
Publicado: (2026)

The Power of Unentangled Quantum Proofs with Non-negative Amplitudes
por: Jeronimo, Fernando Granha, et al.
Publicado: (2024)

Lower Bounds for Unitary Property Testing with Proofs and Advice
por: Weggemans, Jordi
Publicado: (2024)

Unentanglement and Post-Measurement Branching in Quantum Interactive Proofs
por: Grewal, Sabee, et al.
Publicado: (2025)

The Collapse of Unentangled Stoquastic Merlin-Arthur Proof Systems
por: Gay, William, et al.
Publicado: (2026)

Fine-Grained Complexity via Quantum Natural Proofs
por: Chen, Yanlin, et al.
Publicado: (2025)

A Lifting Theorem for Hybrid Classical-Quantum Communication Complexity
por: Wu, Xudong, et al.
Publicado: (2025)

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

Proofs of quantum memory
por: Hhan, Minki, et al.
Publicado: (2025)

Two prover perfect zero knowledge for MIP*
por: Mastel, Kieran, et al.
Publicado: (2024)

Two bases suffice for QMA1-completeness
por: Ma, Henry, et al.
Publicado: (2025)

The Round Complexity of Proofs in the Bounded Quantum Storage Model
por: Grilo, Alex B., et al.
Publicado: (2024)

Classical vs Quantum Advice and Proofs under Classically-Accessible Oracle
por: Li, Xingjian, et al.
Publicado: (2023)

NISQ Security and Complexity via Simple Classical Reasoning
por: Cojocaru, Alexandru, et al.
Publicado: (2025)

Game Derandomization
por: Epstein, Samuel
Publicado: (2024)

On Kolmogorov Structure Functions
por: Epstein, Samuel
Publicado: (2024)

The Randomness Deficiency Function and the Shift Operator
por: Epstein, Samuel
Publicado: (2023)

On the Existence of Anomalies, The Reals Case
por: Epstein, Samuel
Publicado: (2023)

Physically-Motivated Guiding States for Local Hamiltonians
por: Waite, Gabriel, et al.
Publicado: (2025)

Quantum Mass Production Theorems
por: Kretschmer, William
Publicado: (2022)

Search-Driven Clause Learning for Product-State Quantum $k$-SAT (PRODSAT-QSAT)
por: González-Castillo, Samuel, et al.
Publicado: (2026)

Commuting Local Hamiltonians Beyond 2D
por: Bostanci, John, et al.
Publicado: (2024)

Complexity Theory for Quantum Promise Problems
por: Chia, Nai-Hui, et al.
Publicado: (2024)

Quantum PCPs: on Adaptivity, Multiple Provers and Reductions to Local Hamiltonians
por: Buhrman, Harry, et al.
Publicado: (2024)

Dimension Independent Disentanglers from Unentanglement and Applications
por: Jeronimo, Fernando G., et al.
Publicado: (2024)

The Communication Complexity of Approximating Matrix Rank
por: Sherstov, Alexander A., et al.
Publicado: (2024)

Quantum Threshold is Powerful
por: Grier, Daniel, et al.
Publicado: (2024)

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

Local Test for Unitarily Invariant Properties of Bipartite Quantum States
por: Chen, Kean, et al.
Publicado: (2024)

Efficient approximate unitary designs from random Pauli rotations
por: Haah, Jeongwan, et al.
Publicado: (2024)

Quantum 2-SAT on low dimensional systems is $\mathsf{QMA}_1$-complete: Direct embeddings and black-box simulation
por: Rudolph, Dorian, et al.
Publicado: (2024)

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

Oracle Separation between Noisy Quantum Polynomial Time and the Polynomial Hierarchy
por: Chia, Nai-Hui, et al.
Publicado: (2024)

Computational complexity of isometric tensor network states
por: Malz, Daniel, et al.
Publicado: (2024)

A Quantum Unique Games Conjecture
por: Mousavi, Hamoon, et al.
Publicado: (2024)