Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Demonstration of the Quantum No-Hiding Theorem in a Category Theoretic Framework: An IBM Quantum Experience

Amolak Ratan Kalra, Shiroman Prakash, Bikash K. Behera, Prasanta Kumar Panigrahi

Published Sep 27, 2017• 2 citations
Publisher

Abstract

In this note, we demonstrate the quantum no-hiding theorem of Braunstein and Pati [Phys. Rev. Lett. 98, 080502 (2007)] using the IBM 5Q quantum processor. We also analyze the circuit using the ZX calculus of Coecke and Duncan [New J Phys. 13(4), 043016 (2011)], which provides a pictorial/category-theoretic demonstration of the no-hiding theorem.

DOI
10.20944/preprints201709.0138.v1

Related papers

Demonstration of the no-hiding theorem on the 5-Qubit IBM quantum computer in a category-theoretic framework

Amolak Ratan Kalra, Navya Gupta, Bikash K. Behera +2 more

arXiv:1707.09462•Quantum Information Processing•Apr 22, 2019•22 citations

Two complete axiomatisations of pure-state qubit quantum computing

Amar Hadzihasanovic, Kang Feng Ng, Quanlong Wang

Categorical quantum mechanics places finite-dimensional quantum theory in the context of compact closed categories, with an emphasis on diagrammatic reasoning. In this framework, two equational diagrammatic calculi have been proposed for pure-state qubit quantum computing: the ZW calculus, developed by Coecke, Kissinger and the first author for the purpose of qubit entanglement classification, and the ZX calculus, introduced by Coecke and Duncan to give an abstract description of complementary observables. Neither calculus, however, provided a complete axiomatisation of their model.

ACM/IEEE Symposium on Logic in Computer Science (LICS)•Jun 27, 2018•74 citations

Proof theory for minimal quantum logic: A remark

Mitio Takano

International Journal of Theoretical Physics•Apr 1, 1995•6 citations

ZX-Calculus and Extended Hypergraph Rewriting Systems I: A Multiway Approach to Categorical Quantum Information Theory

Jonathan Gorard, Manojna Namuduri, Xerxes D. Arsiwalla

Categorical quantum mechanics and the Wolfram model offer distinct but complementary approaches to studying the relationship between diagrammatic rewriting systems over combinatorial structures and the foundations of physics; the objective of the present article is to begin elucidating the formal correspondence between the two methodologies in the context of the ZX-calculus formalism of Coecke and Duncan for reasoning diagrammatically about linear maps between qubits. After briefly summarizing the relevant formalisms, and presenting a categorical formulation of the Wolfram model in terms of adhesive categories and double-pushout rewriting systems, we illustrate how the diagrammatic rewritings of the ZX-calculus can be embedded and realized within the broader context of Wolfram model multiway systems, and illustrate some of the capabilities of the software framework (ZXMultiwaySystem) that we have developed specifically for this purpose. Finally, we present a proof (along with an explicitly computed example) based on the methods of Dixon and Kissinger that the multiway evolution graphs and branchial graphs of the Wolfram model are naturally endowed with a monoidal structure based on rulial composition that is, furthermore, compatible with the monoidal product of ZX-diagrams.

arXiv:2010.02752•Oct 5, 2020•10 citations

Implementing Classical Logic in a Quantum Environment

Christopher T. Dunne

This paper is meant to serve as an introductory guide on how to implement simple logic gates in a quantum environment. Uncompressed circuits for each statement can be found in the appendix.

American Journal of Science & Engineering•Jun 6, 2022•0 citations

Proof theory for minimal quantum logic II

Hirokazu Nishimura

International Journal of Theoretical Physics•Jul 1, 1994•12 citations
In this note, we demonstrate the quantum no-hiding theorem of Braunstein and Pati [Phys. Rev. Lett. 98, 080502 (2007)] using the IBM 5Q quantum processor. We also analyze the circuit using the ZX calculus of Coecke and Duncan [New J Phys. 13(4), 043016 (2011)], which provides a pictorial/category-theoretic demonstration of the no-hiding theorem.
Categorical quantum mechanics places finite-dimensional quantum theory in the context of compact closed categories, with an emphasis on diagrammatic reasoning. In this framework, two equational diagrammatic calculi have been proposed for pure-state qubit quantum computing: the ZW calculus, developed by Coecke, Kissinger and the first author for the purpose of qubit entanglement classification, and the ZX calculus, introduced by Coecke and Duncan to give an abstract description of complementary observables. Neither calculus, however, provided a complete axiomatisation of their model.
Categorical quantum mechanics and the Wolfram model offer distinct but complementary approaches to studying the relationship between diagrammatic rewriting systems over combinatorial structures and the foundations of physics; the objective of the present article is to begin elucidating the formal correspondence between the two methodologies in the context of the ZX-calculus formalism of Coecke and Duncan for reasoning diagrammatically about linear maps between qubits. After briefly summarizing the relevant formalisms, and presenting a categorical formulation of the Wolfram model in terms of adhesive categories and double-pushout rewriting systems, we illustrate how the diagrammatic rewritings of the ZX-calculus can be embedded and realized within the broader context of Wolfram model multiway systems, and illustrate some of the capabilities of the software framework (ZXMultiwaySystem) that we have developed specifically for this purpose. Finally, we present a proof (along with an explicitly computed example) based on the methods of Dixon and Kissinger that the multiway evolution graphs and branchial graphs of the Wolfram model are naturally endowed with a monoidal structure based on rulial composition that is, furthermore, compatible with the monoidal product of ZX-diagrams.