Demonstration of the No-Hiding Theorem on the 5 Qubit IBM Quantum Computer in a Category Theoretic Framework

TL;DR

This paper experimentally demonstrates the quantum no-hiding theorem on IBM's 5-qubit quantum computer, utilizing category theory and ZX calculus for visualization, confirming the recovery of hidden information.

Contribution

First experimental verification of the no-hiding theorem on a superconducting quantum processor using a category theoretic framework and ZX calculus visualization.

Findings

Successful demonstration of information recovery after hiding.

Use of category theory enhances understanding of quantum information flow.

Validation of the no-hiding theorem in a new quantum computing architecture.

Abstract

Quantum no-Hiding theorem, first proposed by Braunstein and Pati [Phys. Rev. Lett. 98, 080502 (2007)], was verified experimentally by Samal et al. [Phys. Rev. Lett. 186, 080401 (2011)] using NMR quantum processor. Till then, this fundamental test has not been explored in any of the experimental architecture. Here, we demonstrate the above no-hiding theorem using the IBM 5Q quantum processor. Categorical algebra developed by Coecke and Duncan [New J. Phys. 13, 043016 (2011)] has been used for better visualization of the no-hiding theorem by analyzing the quantum circuit using the ZX calculus. The experimental results confirm the recovery of missing information by the application of local unitary operations on the ancillary qubits.