Author

Arturo Acuaviva

h-index 3 View on Semantic Scholar

We have 1 of 4 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Aug 2026

CNOT-Distance is NP-complete under all-to-all connectivity

A polynomial-time decoder yields NP-hardness of approximation within every fixed additive constant and, through an L-reduction from Minimum Vertex Cover on cubic graphs, APX-hardness of the associated CNOT-circuit optimisation problem.

Antonio Acuaviva, Arturo Acuaviva, Pablo Acuaviva · 1 citation