Fast Constructions of Quantum Codes Based on Residues Pauli Block Matrices
We demonstrate how to fast construct quantum error-correction codes based on quadratic residues Pauli block transforms. The present quantum codes have an advantage of being fast designed from Abelian groups on the basis of Pauli block matrices that can be yielded from quadratic residues with much ef...
Saved in:
| Main Authors: | Ying Guo, Guihu Zeng, MoonHo Lee |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2010-01-01
|
| Series: | Advances in Mathematical Physics |
| Online Access: | http://dx.doi.org/10.1155/2010/469124 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Pauli decomposition via the fast Walsh-Hadamard transform
by: Timothy N Georges, et al.
Published: (2025-01-01) -
Efficient Pauli Channel Estimation with Logarithmic Quantum Memory
by: Sitan Chen, et al.
Published: (2025-05-01) -
Quantum simulation of Pauli channels and dynamical maps: Algorithm and implementation.
by: Tomás Basile, et al.
Published: (2024-01-01) -
Variational quantum algorithm for low-dimensional systems in the Pauli basis
by: D.O. Golov, et al.
Published: (2024-12-01) -
Bosonic Pauli+: Efficient Simulation of Concatenated Gottesman-Kitaev-Preskill Codes
by: Florian Hopfmueller, et al.
Published: (2024-11-01)