On the Addressability Problem on CSS Codes
Quantum 10, 2145 (2026). Recent discoveries in asymptotically good quantum codes have intensified research on their application in quantum computation and fault-tolerant operations. This study…
Read the full articleYou might also wanna read
Depth hierarchy theorem proves increasing depth strictly increases power in constant-depth quantum circuits
Circuit depth is a central resource in complexity theory. While bounded-depth classical circuits admit well-understood hierarchy theorems, t

Bosonic Cyclic Codes: Trading Error Protection for Logical Phase Gates in Quantum Error Correction
Bosonic codes offer hardware-efficient approaches to quantum error correction, with the best encodings offering effective protection of idle

Verification of Quantum Computations: Hardware-Efficient Security Proofs
How can a user with limited quantum resources verify the output of an untrusted, fully quantum server? This manuscript provides a conceptual
Tree-Code Method Enables Faster Quantum Encoding and Decoding for Long-Distance Communication
Hierarchical tree-codes allow for top-to-bottom fast quantum encoding/decoding, reducing losses at repeater stations.
Fault-Tolerant Operation of a Quantum Error Correction Code
“Fault-Tolerant Operation of a Quantum Error-Correction Code,” L. N. Egan, D. M. Debroy, C. Noel, A. Risinger, D. Zhu, D. Biswas, M. Newman,
Quantum Crosstalk Noise Modeling Reveals Higher Error Rates in Fault-Tolerant Computing
Error rates in logical qubits demonstrably increase when coherent crosstalk noise is accounted for, a finding at odds with prior analyses re

Comments
Sign in to join the conversation.
No comments yet. Be the first.