On quantum superpositions of graphs, no-signalling and covariance

Abstract We provide a mathematically and conceptually robust notion of quantum superpositions of graphs. The formalism may be useful for the purpose of modelling a ‘fully quantum internet’ and states of geometry in quantum gravity. We argue that quantum superpositions of graphs do require node names for their correct alignment, which we demonstrate through a no-signalling argument. The need for node names was often overlooked or disagreed upon in previous proposals. Still, node names should remain a fiducial construct, serving a similar purpose to the labelling of points through a choice of coordinates in continuous space. Graph renamings, aka isomorphisms, are understood as a change of coordinates on the graph. We explain how to impose renaming invariance at the level of operators over quantum superpositions of graphs, in a way that still allows us to talk about local operators.

Authors

Institutions

Publication Details

Journal
Journal of Physics A Mathematical and Theoretical
Published
2025-04-02
DOI
https://doi.org/10.1088/1751-8121/adc881
Citations
1
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
2.48

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

On quantum superpositions of graphs, no-signalling and covariance

Pablo Arrighi, Marios Christodoulou, Amélia Durbec
1 citations
Journal of Physics A Mathematical and Theoretical
Quantum Computing Algorithms and Architecture
2.48
article

On quantum superpositions of graphs, no-signalling and covariance

Pablo Arrighi, Marios Christodoulou, Amélia Durbec
article en
1 citations

Abstract

Abstract We provide a mathematically and conceptually robust notion of quantum superpositions of graphs. The formalism may be useful for the purpose of modelling a ‘fully quantum internet’ and states of geometry in quantum gravity. We argue that quantum superpositions of graphs do require node names for their correct alignment, which we demonstrate through a no-signalling argument. The need for node names was often overlooked or disagreed upon in previous proposals. Still, node names should remain a fiducial construct, serving a similar purpose to the labelling of points through a choice of coordinates in continuous space. Graph renamings, aka isomorphisms, are understood as a change of coordinates on the graph. We explain how to impose renaming invariance at the level of operators over quantum superpositions of graphs, in a way that still allows us to talk about local operators.

Journal of Physics A Mathematical and TheoreticalVol. 58(15)
Centre National de la Recherche Scientifique (FR), Université Paris-Saclay (FR), Institute for Quantum Optics and Quantum Information Innsbruck (AT), Vienna Center for Quantum Science and Technology (AT)
John Templeton Foundation
Openalex Percentile: Top 11%
Quantum Computing Algorithms and Architecture
2.48
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.