9 papers
Quantum Tanner Codes at Moderate Blocklength
Feroz Ahmed Mian, Vaishnavi L. Addala, Arman Meraj +2
We present explicit constructions of quantum Tanner (QT) codes with good rate and distance, obtained through two complementary approaches: the left-right Cayley complex (LRCC) desc…
Efficient Graph State Purification with Factorized Graph-Preserving Operations across Local Clifford Orbits
Mingyuan Wang, Guus Avis, Kenneth Goodenough +1
Graph states form a broad class of multipartite entangled states underlying measurement-based quantum computation, quantum networks, and stabilizer codes. However, systematic entan…
Multivariate Multicycle Codes for Complete Single-Shot Decoding
Feroz Ahmed Mian, Owen Gwilliam, Stefan Krastanov
We introduce multivariate multicycle (MM) codes, a new family of quantum error-correcting codes (QECCs) that unifies bivariate bicycle, multivariate bicycle, abelian two-block grou…
Quantum Hamlets: Distributed Compilation of Large Algorithmic Graph States
Anthony Micciche, Naphan Benchasattabuse, Andrew McGregor +3
We investigate the problem of compiling the generation of graph states to arbitrarily many distributed homogeneous quantum processing units (QPUs), providing a scalable partitionin…
Optimizing compilation of error correction codes for 2xN quantum dot arrays and its NP-hardness
Anthony Micciche, Feroz Ahmed Mian, Anasua Chatterjee +2
The ability to physically move qubits within a register allows the design of hardware-specific error-correction codes, which can achieve fault-tolerance while respecting other cons…
Routing in Non-Isotonic Quantum Networks
Maxwell Tang, Garrett Hinkley, Kenneth Goodenough +2
Optimal routing in quantum-repeater networks requires finding the best path that connects a pair of end nodes. Most previous work on routing in quantum networks assumes utility fun…