Imagen de Portada

The Quantum Query Complexity of Finding a Tarski Fixed Point on the 2D Grid

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Phillips, Reed
Formato:	Preprint
Publicado:	2026
Materias:	Computational Complexity 68Q12 F.2.2
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Quantum algorithms through graph composition
por: Cornelissen, Arjan
Publicado: (2025)

Quantum walks through generalized graph composition
por: Cornelissen, Arjan
Publicado: (2025)

The framework to unify all complexity dichotomy theorems for Boolean tensor networks
por: Xia, Mingji
Publicado: (2026)

The Word Problem for Products of Symmetric Groups
por: Simon, Hans U.
Publicado: (2025)

On Small-depth Frege Proofs for PHP
por: Håstad, Johan
Publicado: (2024)

How do humans succeed in tasks like proving Fermat's Theorem or predicting the Higgs boson?
por: Levin, Leonid A.
Publicado: (2022)

NP-Completeness Proofs of All or Nothing, Water Walk, and Remembered Length Using the T-Metacell Framework
por: Eua-anant, Pakapim, et al.
Publicado: (2025)

How to compute the volume in low dimension?
por: Cornelissen, Arjan, et al.
Publicado: (2025)

DAG Scheduling in the BSP Model
por: Papp, Pál András, et al.
Publicado: (2023)

Explicit separations between randomized and deterministic Number-on-Forehead communication
por: Kelley, Zander, et al.
Publicado: (2023)

NP-hard problems are not in BQP
por: Czerwinski, Reiner
Publicado: (2023)

Character Complexity: A Novel Measure for Quantum Circuit Analysis
por: Shami, Daksh
Publicado: (2024)

Quantum Advantage in Computational Chemistry?
por: Gundlach, Hans, et al.
Publicado: (2025)

Computational Complexity of Determining the Assembly Index
por: Masierak, Piotr
Publicado: (2026)

Red-Blue Pebbling with Multiple Processors: Time, Communication and Memory Trade-offs
por: Böhnlein, Toni, et al.
Publicado: (2024)

On the Parallel Complexity of Group Isomorphism via Weisfeiler-Leman
por: Grochow, Joshua A., et al.
Publicado: (2021)

An SoS Entropy Dichotomy via Windowed Hypercontractivity
por: Lela, Marko
Publicado: (2025)

On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness
por: Grochow, Joshua A., et al.
Publicado: (2025)

Induced Disjoint Paths Without an Induced Minor
por: Aboulker, Pierre, et al.
Publicado: (2025)

Exact and Approximate High-Multiplicity Scheduling on Identical Machines
por: Jansen, Klaus, et al.
Publicado: (2024)

Constraint Satisfaction Problems over Finitely Bounded Homogeneous Structures: a Dichotomy between FO and L-hard
por: Dorochko, Leonid, et al.
Publicado: (2026)

An MDL-Style Cost Functional KC, Distribution-Preserving Reductions ($A2^d$), and an $AC^0$+log Lower Bound for 3SAT via Balanced 3XOR
por: Lela, Marko
Publicado: (2025)

Tight Bounds on the Spooky Pebble Game: Recycling Qubits with Measurements
por: Kornerup, Niels, et al.
Publicado: (2021)

The Optimizer Quotient and the Certification Trilemma
por: Simas, Tristan
Publicado: (2026)

NP-hardness of p-adic linear regression
por: Baker, Gregory D.
Publicado: (2026)

A Complexity Dichotomy for Temporal Valued Constraint Satisfaction Problems
por: Bodirsky, Manuel, et al.
Publicado: (2024)

Functional Lower Bounds in Algebraic Proofs: Symmetry, Lifting, and Barriers
por: Hakoniemi, Tuomas, et al.
Publicado: (2024)

Quantum Search without Global Diffusion
por: Burke, John, et al.
Publicado: (2026)

Counting Martingales for Measure and Dimension in Complexity Classes
por: Hitchcock, John M., et al.
Publicado: (2025)

Evolomino is NP-complete
por: Nikolaev, Andrei V.
Publicado: (2025)

Polynomial Prenexing of QBFs with Non-Monotone Boolean Operators
por: Saffidine, Abdallah, et al.
Publicado: (2025)

Quoridor is PSPACE-Complete
por: Drop, Marius, et al.
Publicado: (2026)

On Solving Reachability in Grid Digraphs using a Psuedoseparator
por: Jain, Rahul, et al.
Publicado: (2019)

Almost Tight Approximation Hardness for Single-Source Directed k-Edge-Connectivity
por: Liao, Chao, et al.
Publicado: (2022)

Minor Embedding in Broken Chimera and Pegasus Graphs is NP-complete
por: Lobe, Elisabeth, et al.
Publicado: (2021)

IECZ-III: Hardcore Condensation Lift with Size-Aware Invariants
por: Lela, Marko
Publicado: (2025)

Towards Single Exponential Time for Temporal and Spatial Reasoning: A Study via Redundancy and Dynamic Programming
por: Lagerkvist, Victor, et al.
Publicado: (2026)

Count-Free Weisfeiler--Leman and Group Isomorphism
por: Collins, Nathaniel A., et al.
Publicado: (2022)

Simple Combinatorial Construction of the $k^{o(1)}$-Lower Bound for Approximating the Parameterized $k$-Clique
por: Chen, Yijia, et al.
Publicado: (2023)

Bounded Distance Decoding for Random Lattices
por: Gao, Shuhong
Publicado: (2025)