Image de couverture de livre

No distributed quantum advantage for approximate graph coloring

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Coiteux-Roy, Xavier, d'Amore, Francesco, Gajjala, Rishikesh, Kuhn, Fabian, Gall, François Le, Lievonen, Henrik, Modanese, Augusto, Renou, Marc-Olivier, Schmid, Gustav, Suomela, Jukka
Format:	Preprint
Publié:	2023
Sujets:	Distributed, Parallel, and Cluster Computing Computational Complexity Discrete Mathematics Emerging Technologies Quantum Physics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Online Locality Meets Distributed Quantum Computing
par: Akbari, Amirreza, et autres
Publié: (2024)

Distributed Quantum Advantage for Local Problems
par: Balliu, Alkida, et autres
Publié: (2024)

Improved upper bounds for the Heilbronn's Problem for $k$-gons
par: Gajjala, Rishikesh, et autres
Publié: (2024)

Distributed Quantum Advantage in Locally Checkable Labeling Problems
par: Balliu, Alkida, et autres
Publié: (2025)

New Limits on Distributed Quantum Advantage: Dequantizing Linear Programs
par: Balliu, Alkida, et autres
Publié: (2025)

Counterexamples to an Extremal Conjecture for Random Cycle-Factors
par: Gajjala, Rishikesh
Publié: (2026)

Distributed Algorithms for Potential Problems
par: Balliu, Alkida, et autres
Publié: (2025)

CNFs and DNFs with Exactly $k$ Solutions
par: Chandran, L. Sunil, et autres
Publié: (2025)

Graph-theoretic insights on the constructability of complex entangled states
par: Chandran, L. Sunil, et autres
Publié: (2023)

Is a LOCAL algorithm computable?
par: Cruciani, Antonio, et autres
Publié: (2026)

Local problems in trees across a wide range of distributed models
par: Dhar, Anubhav, et autres
Publié: (2024)

Krenn-Gu conjecture for sparse graphs
par: Chandran, L. Sunil, et autres
Publié: (2024)

Comparing Quantum Annealing and Spiking Neuromorphic Computing for Sampling Binary Sparse Coding QUBO Problems
par: Henke, Kyle, et autres
Publié: (2024)

On the Limits of Distributed Quantum Computing
par: d'Amore, Francesco
Publié: (2025)

Model Discovery and Graph Simulation: A Lightweight Gateway to Chaos Engineering
par: Krasnovsky, Anatoly A.
Publié: (2025)

Quantization in Spiking Neural Networks
par: Moser, Bernhard A., et autres
Publié: (2023)

Reachability in Restricted Chemical Reaction Networks
par: Alaniz, Robert M., et autres
Publié: (2022)

Phase transition of the 3-majority opinion dynamics with noisy interactions
par: d'Amore, Francesco, et autres
Publié: (2021)

Classification of Local Optimization Problems in Directed Cycles
par: Boudier, Thomas, et autres
Publié: (2026)

Rainbow polygons for colored point sets in the plane
par: Flores-Peñaloza, David, et autres
Publié: (2020)

Enigma: Application-Layer Privacy for Quantum Optimization on Untrusted Computers
par: Ayanzadeh, Ramin, et autres
Publié: (2023)

Empirical Quantum Advantage in Constrained Optimization from Encoded Unitary Designs
par: Onah, Chinonso, et autres
Publié: (2025)

On the generalized coloring numbers
par: Siebertz, Sebastian
Publié: (2025)

On the geometric $k$-colored crossing number of $K_n$
par: Hahn, Benedikt, et autres
Publié: (2025)

Critical window for approximate counting in dense Ising models
par: Galanis, Andreas, et autres
Publié: (2026)

Phase Transition of a Non-Linear Opinion Dynamics with Noisy Interactions
par: d'Amore, Francesco, et autres
Publié: (2020)

Complexity of approximate conflict-free, linearly-ordered, and nonmonochromatic hypergraph colourings
par: Nakajima, Tamio-Vesa, et autres
Publié: (2025)

Exact Spin Elimination in Ising Hamiltonians and Energy-Based Machine Learning
par: Berloff, Natalia G.
Publié: (2025)

Distributed $(Δ+1)$-Coloring in Graphs of Bounded Neighborhood Independence
par: Fuchs, Marc, et autres
Publié: (2025)

W-state graphs: Structure and Algorithms
par: Gajjala, Rishikesh, et autres
Publié: (2026)

Orientation does not help with 3-coloring a grid in online-LOCAL
par: Boudier, Thomas, et autres
Publié: (2025)

Blockchain‐Enabled Modified Bi‐Directional Recurrent Neural Network for Intelligent Crop Recommendation
par: Rishikesh, et autres
Publié: (2026)

Large Language Models integration in Smart Grids
par: Madani, Seyyedreza, et autres
Publié: (2025)

The complexity of strong conflict-free vertex-connection $k$-colorability
par: Hsieh, Sun-Yuan, et autres
Publié: (2024)

A Dynamic Tree Structure for Hierarchical On-Chain Asset Management
par: Eshghie, Mojtaba, et autres
Publié: (2024)

New Hardness Results for the LOCAL Model via a Simple Self-Reduction
par: Balliu, Alkida, et autres
Publié: (2025)

A note on approximating the average degree of bounded arboricity graphs
par: Eden, Talya, et autres
Publié: (2026)

On the tractability and approximability of non-submodular cardinality-based $s$-$t$ cut problems in hypergraphs
par: Bengali, Vedangi, et autres
Publié: (2024)

Intersection patterns of set systems on manifolds with slowly growing homological shatter functions
par: Avvakumov, Sergey, et autres
Publié: (2026)

A spiking photonic neural network of 40.000 neurons, trained with rank-order coding for leveraging sparsity
par: Talukder, Ria, et autres
Publié: (2024)