Swan Klein
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Swan Klein has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
Andrew N. Glaudell
Photonic Inc Vancouver BC Canada
1 shared publication- Michael Jarret
Department of Mathematical Sciences George Mason University Fairfax VA USA
1 shared publication - Mingzhen Tian
Quantum Science and Engineering Center George Mason University Fairfax VA USA
1 shared publication - Samuel S. Mendelson
Department of Mathematical Sciences George Mason University Fairfax VA USA
1 shared publication - T. C. Mooney
Department of Physics University of Maryland College Park MD USA
1 shared publication
Latest Publications
- Open Access
High-Performance Exact Synthesis of Two-Qubit Quantum Circuits
Exact synthesis provides unconditional optimality and canonical structure, but is often limited to small, carefully scoped regimes. We present an exact synthesis framework for two-qubit circuits over the Clifford+$T$ gate set that optimizes $T$-count exactly. Our approach exhausts a bounded search space, exploits algebraic canonicalization to avoid redundancy, and constructs a lookup table of optimal implementations that turns synthesis into a query. Algorithmically, we combine meet-in-the-middle ideas with provable pruning rules and problem-specific arithmetic designed for modern hardware. The result is an exact, reusable synthesis engine with substantially improved practical performance.
Open AccessHigh-Performance Exact Synthesis of Two-Qubit Quantum Circuits
Exact synthesis provides unconditional optimality and canonical structure, but is often limited to small, carefully scoped regimes. We present an exact synthesis framework for two-qubit circuits over the Clifford+$T$ gate set that optimizes $T$-count exactly. Our approach exhausts a bounded search space, exploits algebraic canonicalization to avoid redundancy, and constructs a lookup table of optimal implementations that turns synthesis into a query. Algorithmically, we combine meet-in-the-middle ideas with provable pruning rules and problem-specific arithmetic designed for modern hardware. The result is an exact, reusable synthesis engine with substantially improved practical performance.