Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/4862
PIRA download icon_1.1View/Download Full Text
Title: Recursive encoding and decoding of the noiseless subsystem and decoherence-free subspace
Authors: Li, CK
Nakahara, M
Poon, YT
Sze, NS 
Tomita, H
Issue Date: Oct-2011
Source: Physical review. A, Atomic, molecular, and optical physics, Oct. 2011, v. 84, no. 4, 044301, p. 1-4
Abstract: When an environmental disturbance to a quantum system has a wavelength much larger than the system size, all qubits in the system are under the action of the same error operator. The noiseless subsystem and decoherence-free subspace are immune to such collective noise. We construct simple quantum circuits that implement these error-avoiding codes for a small number n of physical qubits. A single logical qubit is encoded with n=3 and 4, while two and three logical qubits are encoded with n=5 and 7, respectively. Recursive relations among subspaces employed in these codes play essential roles in our implementation.
Keywords: Logic gates
Quantum electronics
Quantum optics
Publisher: American Physical Society
Journal: Physical review. A, Atomic, molecular, and optical physics 
ISSN: 1050-2947
EISSN: 1094-1622
DOI: 10.1103/PhysRevA.84.044301
Rights: Physical Review A © 2011 The American Physical Society. The Journal's web site is located at http://pra.aps.org/
Appears in Collections:Journal/Magazine Article

Files in This Item:
File Description SizeFormat 
Li_Recursive_Noiseless_Decoherence-free.pdf378.44 kBAdobe PDFView/Open
Open Access Information
Status open access
File Version Version of Record
Access
View full-text via PolyU eLinks SFX Query
Show full item record

Page views

114
Last Week
1
Last month
Citations as of Apr 14, 2024

Downloads

143
Citations as of Apr 14, 2024

SCOPUSTM   
Citations

10
Last Week
0
Last month
0
Citations as of Apr 19, 2024

WEB OF SCIENCETM
Citations

11
Last Week
0
Last month
0
Citations as of Apr 18, 2024

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.