Imagen de Portada

Online Locality Meets Distributed Quantum Computing

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Akbari, Amirreza, Coiteux-Roy, Xavier, d'Amore, Francesco, Gall, François Le, Lievonen, Henrik, Melnyk, Darya, Modanese, Augusto, Pai, Shreyas, Renou, Marc-Olivier, Rozhoň, Václav, Suomela, Jukka
Formato:	Preprint
Publicado:	2024
Materias:	Distributed, Parallel, and Cluster Computing Computational Complexity Probability Quantum Physics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

No distributed quantum advantage for approximate graph coloring
por: Coiteux-Roy, Xavier, et al.
Publicado: (2023)

Distributed Quantum Advantage for Local Problems
por: Balliu, Alkida, et al.
Publicado: (2024)

New Limits on Distributed Quantum Advantage: Dequantizing Linear Programs
por: Balliu, Alkida, et al.
Publicado: (2025)

Distributed Quantum Advantage in Locally Checkable Labeling Problems
por: Balliu, Alkida, et al.
Publicado: (2025)

Local problems in trees across a wide range of distributed models
por: Dhar, Anubhav, et al.
Publicado: (2024)

Is a LOCAL algorithm computable?
por: Cruciani, Antonio, et al.
Publicado: (2026)

On the Limits of Distributed Quantum Computing
por: d'Amore, Francesco
Publicado: (2025)

Distributed Algorithms for Potential Problems
por: Balliu, Alkida, et al.
Publicado: (2025)

Phase transition of the 3-majority opinion dynamics with noisy interactions
por: d'Amore, Francesco, et al.
Publicado: (2021)

Classification of Local Optimization Problems in Directed Cycles
por: Boudier, Thomas, et al.
Publicado: (2026)

Invitation to Local Algorithms
por: Rozhoň, Václav
Publicado: (2024)

Phase Transition of a Non-Linear Opinion Dynamics with Noisy Interactions
por: d'Amore, Francesco, et al.
Publicado: (2020)

Maximum Separation of Quantum Communication Complexity With and Without Shared Entanglement
por: Hasegawa, Atsuya, et al.
Publicado: (2025)

New Hardness Results for the LOCAL Model via a Simple Self-Reduction
por: Balliu, Alkida, et al.
Publicado: (2025)

Orientation does not help with 3-coloring a grid in online-LOCAL
por: Boudier, Thomas, et al.
Publicado: (2025)

Shared Randomness Helps with Local Distributed Problems
por: Balliu, Alkida, et al.
Publicado: (2024)

Search via Parallel Lévy Walks on $\mathbb{Z}^2$
por: Clementi, Andrea, et al.
Publicado: (2020)

Centroid Approximation with Multidimensional Approximate Agreement Protocols
por: Cambus, Melanie, et al.
Publicado: (2023)

On the $h$-majority dynamics with many opinions
por: d'Amore, Francesco, et al.
Publicado: (2025)

DejaVu: A Minimalistic Mechanism for Distributed Plurality Consensus
por: d'Amore, Francesco, et al.
Publicado: (2026)

Testing Spreading Behavior in Networks with Arbitrary Topologies
por: Modanese, Augusto, et al.
Publicado: (2023)

DecentPeeR: A Self-Incentivised & Inclusive Decentralized Peer Review System
por: Gruendler, Johannes, et al.
Publicado: (2024)

It does not matter how you define locally checkable labelings
por: Cruciani, Antonio, et al.
Publicado: (2026)

Distributed MIS Algorithms for Rational Agents using Games
por: Salevemula, Nithin, et al.
Publicado: (2025)

Approximate Agreement Algorithms for Byzantine Collaborative Learning
por: Cambus, Mélanie, et al.
Publicado: (2025)

Centroid Approximation for Byzantine-Tolerant Federated Learning
por: Cambus, Mélanie, et al.
Publicado: (2025)

The genuinely multipartite nonlocality of graph states is model-dependent
por: Coiteux-Roy, Xavier, et al.
Publicado: (2024)

On the Universality of Round Elimination Fixed Points
por: Balliu, Alkida, et al.
Publicado: (2025)

Polynomially Over-Parameterized Convolutional Neural Networks Contain Structured Strong Winning Lottery Tickets
por: da Cunha, Arthur, et al.
Publicado: (2023)

Deterministic Distributed Algorithms and Measurable Combinatorics on $Δ$-Regular Forests
por: Brandt, Sebastian, et al.
Publicado: (2022)

On Homomorphism Graphs
por: Brandt, Sebastian, et al.
Publicado: (2021)

2-Coloring Cycles in One Round
por: Flin, Maxime, et al.
Publicado: (2026)

Resilient Byzantine Agreement with Predictions
por: Dallot, Julien, et al.
Publicado: (2026)

Bolzano: Case Studies in LLM-Assisted Mathematical Research
por: Balko, Martin, et al.
Publicado: (2026)

The Logical Expressiveness of Topological Neural Networks
por: Akbari, Amirreza, et al.
Publicado: (2026)

Meta-Theorems for Cuttable Distributed Problems
por: Bonamy, Marthe, et al.
Publicado: (2026)

Classical Algorithms for Constant Approximation of the Ground State Energy of Local Hamiltonians
por: Gall, François Le
Publicado: (2024)

Low-Bandwidth Matrix Multiplication: Faster Algorithms and More General Forms of Sparsity
por: Gupta, Chetan, et al.
Publicado: (2024)

Strong and Hiding Distributed Certification of Bipartiteness
por: Jauregui, Benjamin, et al.
Publicado: (2025)

Distributed Computation with Local Advice
por: Balliu, Alkida, et al.
Publicado: (2024)