Published June 2019
| Version v1
Journal article
Demonstration of the no-hiding theorem on the 5-Qubit IBM quantum computer in a category-theoretic framework
Creators
- 1. Dayalbagh Educational Institute, Department of Electrical Engineering (India)
- 2. Indian Institute of Technology, Department of Physics (India)
- 3. Indian Institute of Science Education and Research Kolkata, Department of Physical Sciences (India)
Description
The 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 other experimental architectures. 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.
Additional details
Identifiers
Publishing Information
- Journal Title
- Quantum Information Processing (Print)
- Journal Volume
- 18
- Journal Issue
- 6
- Journal Page Range
- p. 1-13
- ISSN
- 1570-0755
INIS
- Country of Publication
- Netherlands
- Country of Input or Organization
- International Atomic Energy Agency (IAEA)
- INIS RN
- 52037920
- Subject category
- S71: CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSICS;
- Descriptors DEI
- EXPERIMENT RESULTS; NUCLEAR MAGNETIC RESONANCE; QUANTUM COMPUTERS; QUBITS
- Descriptors DEC
- COMPUTERS; INFORMATION; MAGNETIC RESONANCE; QUANTUM INFORMATION; RESONANCE
Optional Information
- Copyright
- Copyright (c) 2019 Springer Science+Business Media, LLC, part of Springer Nature
- Notes
- http://www.springer-ny.com