activity
20242026
collaborators

13 papers

quant-ph2026

Sampling hard circuits with verifiably high fidelity

Simon Martiel, Jay-U Chung, Alireza Seif +6

Sampling-based proposals are prominent candidates for demonstrating quantum computations beyond the reach of classical supercomputers. However, it has been difficult to combine the…

quant-ph2026

Theory and Architecture of Syndrome-Resolved Logical Gates

Nobuyuki Yoshioka, Alireza Seif, Peter Groszkowski +2

We introduce a general framework for weak transversal gates, namely syndrome-resolved implementation of logical unitaries realized by local physical unitaries, and demonstrate its…

quant-ph2026

GeneCS: Synthesizing Resource-Efficient Code Surgery for Arbitrary Quantum Stabilizer Codes

Junyu Zhou, Ali Javadi-Abhari, Gushu Li

Efficiently realizing logical operations on general stabilizer codes remains a long-standing challenge in fault tolerant quantum computing. While code surgery provides a general fr…

cs.ET2026

AlphaSyndrome: Tackling the Syndrome Measurement Circuit Scheduling Problem for QEC Codes

Yuhao Liu, Shuohao Ping, Junyu Zhou +8

Quantum error correction (QEC) is essential for scalable quantum computing, yet repeated syndrome-measurement cycles dominate its spacetime and hardware cost. Although stabilizers…

quant-ph2025

Optimizing the non-Clifford-count in unitary synthesis using Reinforcement Learning

David Kremer, Ali Javadi-Abhari, Priyanka Mukhopadhyay

In this paper we study the potential of using reinforcement learning (RL) in order to synthesize quantum circuits, while optimizing the T-count and CS-count, of unitaries that are…

quant-ph2025

Basic entanglement distillation with realistic noise

Vikesh Siddhu, Erick Winston, David C. McKay +1

Entanglement distillation is a key component of modular quantum computing and long-range quantum communications. However, this powerful tool to reduce noise in entangled states is…