Quantum superpositions of graphs

10/26/2020
by   Pablo Arrighi, et al.
0

We provide a robust notion of quantum superpositions of graphs. Quantum superpositions of graphs crucially require node names for their correct alignment, as we demonstrate through a non-signalling argument. Nevertheless, node names are a fiducial construct, serving a similar purpose to the labelling of points through a choice of coordinates in continuous space. We explain that graph renamings are, indeed, a natively discrete analogue of diffeomorphisms. We show how to impose renaming invariance at the level of graphs and their quantum superpositions.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset