| Paper Abstract and Keywords |
| Presentation |
2026-01-15 10:25
An overview of the hyperbolic color Floquet code Hideyuki Ozawa, Isamu Kudo, Yuki Takeuchi, Tsuyoshi Yoshida (Mitsubishi Electric) CS2025-61 |
| Abstract |
(in Japanese) |
(See Japanese page) |
| (in English) |
In quantum networks, such as quantum repeater networks and long-distance QKD/distributed synchronization, there is a need for technologies that can operate with high throughput and low latency even under high loss and noise. To this end,efficient quantum error correction is expected to help ensure end-to-end performance. Furthermore, because of the no-cloning theorem and destructive measurement, qubit information cannot be read out directly; instead, one must rely on stabilizer (syndrome) measurements mediated by ancillary qubits. This necessitates repeatedly applying numerous interactions (high-weight parity checks), which increases circuit depth and raises implementation cost. This work proposes a Floquet quantum error correcting code, the hyperbolic color Floquet code, based on the 3-colorable structure of the hyperbolic tiling {????, 3}. Low-weight Pauli two-body XX/ZZ measurements generate ”graph-edge” syndromes, enabling highly efficient decoding via minimum-weight perfect matching. Due to properties of hyperbolic geometry, the code achieves a finite coding rate ????/???? = O (1) (e.g., 1/8 for the {8, 3} tiling), and numerical experiments under circuit-level independent Pauli noise show that the logical error rate decreases as the code size increases. These results indicate the feasibility of combining low-weight, simple measurements with low-latency, high-throughput decoding, marking an important step toward practical QEC operation in quantum networks. |
| Keyword |
(in Japanese) |
(See Japanese page) |
| (in English) |
quantum error correction / hyperbolic tilings / minimum-weight matching / Floquet codes / / / / |
| Reference Info. |
IEICE Tech. Rep., vol. 125, no. 315, CS2025-61, pp. 17-22, Jan. 2026. |
| Paper # |
CS2025-61 |
| Date of Issue |
2026-01-08 (CS) |
| ISSN |
Online edition: ISSN 2432-6380 |
Copyright and reproduction |
All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034) |
| Download PDF |
CS2025-61 |
| Conference Information |
| Committee |
OCS CS |
| Conference Date |
2026-01-15 - 2026-01-16 |
| Place (in Japanese) |
(See Japanese page) |
| Place (in English) |
Hakodate Chamber of Commerce and Industry |
| Topics (in Japanese) |
(See Japanese page) |
| Topics (in English) |
|
| Paper Information |
| Registration To |
CS |
| Conference Code |
2026-01-OCS-CS |
| Language |
Japanese |
| Title (in Japanese) |
(See Japanese page) |
| Sub Title (in Japanese) |
(See Japanese page) |
| Title (in English) |
An overview of the hyperbolic color Floquet code |
| Sub Title (in English) |
|
| Keyword(1) |
quantum error correction |
| Keyword(2) |
hyperbolic tilings |
| Keyword(3) |
minimum-weight matching |
| Keyword(4) |
Floquet codes |
| Keyword(5) |
|
| Keyword(6) |
|
| Keyword(7) |
|
| Keyword(8) |
|
| 1st Author's Name |
Hideyuki Ozawa |
| 1st Author's Affiliation |
Mitsubishi Electric Corporation (Mitsubishi Electric) |
| 2nd Author's Name |
Isamu Kudo |
| 2nd Author's Affiliation |
Mitsubishi Electric Corporation (Mitsubishi Electric) |
| 3rd Author's Name |
Yuki Takeuchi |
| 3rd Author's Affiliation |
Mitsubishi Electric Corporation (Mitsubishi Electric) |
| 4th Author's Name |
Tsuyoshi Yoshida |
| 4th Author's Affiliation |
Mitsubishi Electric Corporation (Mitsubishi Electric) |
| 5th Author's Name |
|
| 5th Author's Affiliation |
() |
| 6th Author's Name |
|
| 6th Author's Affiliation |
() |
| 7th Author's Name |
|
| 7th Author's Affiliation |
() |
| 8th Author's Name |
|
| 8th Author's Affiliation |
() |
| 9th Author's Name |
|
| 9th Author's Affiliation |
() |
| 10th Author's Name |
|
| 10th Author's Affiliation |
() |
| 11th Author's Name |
|
| 11th Author's Affiliation |
() |
| 12th Author's Name |
|
| 12th Author's Affiliation |
() |
| 13th Author's Name |
|
| 13th Author's Affiliation |
() |
| 14th Author's Name |
|
| 14th Author's Affiliation |
() |
| 15th Author's Name |
|
| 15th Author's Affiliation |
() |
| 16th Author's Name |
|
| 16th Author's Affiliation |
() |
| 17th Author's Name |
|
| 17th Author's Affiliation |
() |
| 18th Author's Name |
|
| 18th Author's Affiliation |
() |
| 19th Author's Name |
|
| 19th Author's Affiliation |
() |
| 20th Author's Name |
|
| 20th Author's Affiliation |
() |
| 21st Author's Name |
|
| 21st Author's Affiliation |
() |
| 22nd Author's Name |
|
| 22nd Author's Affiliation |
() |
| 23rd Author's Name |
|
| 23rd Author's Affiliation |
() |
| 24th Author's Name |
|
| 24th Author's Affiliation |
() |
| 25th Author's Name |
|
| 25th Author's Affiliation |
() |
| 26th Author's Name |
/ / |
| 26th Author's Affiliation |
()
() |
| 27th Author's Name |
/ / |
| 27th Author's Affiliation |
()
() |
| 28th Author's Name |
/ / |
| 28th Author's Affiliation |
()
() |
| 29th Author's Name |
/ / |
| 29th Author's Affiliation |
()
() |
| 30th Author's Name |
/ / |
| 30th Author's Affiliation |
()
() |
| 31st Author's Name |
/ / |
| 31st Author's Affiliation |
()
() |
| 32nd Author's Name |
/ / |
| 32nd Author's Affiliation |
()
() |
| 33rd Author's Name |
/ / |
| 33rd Author's Affiliation |
()
() |
| 34th Author's Name |
/ / |
| 34th Author's Affiliation |
()
() |
| 35th Author's Name |
/ / |
| 35th Author's Affiliation |
()
() |
| 36th Author's Name |
/ / |
| 36th Author's Affiliation |
()
() |
| Speaker |
Author-1 |
| Date Time |
2026-01-15 10:25:00 |
| Presentation Time |
25 minutes |
| Registration for |
CS |
| Paper # |
CS2025-61 |
| Volume (vol) |
vol.125 |
| Number (no) |
no.315 |
| Page |
pp.17-22 |
| #Pages |
6 |
| Date of Issue |
2026-01-08 (CS) |
|