11 citations · 26 across the 12 of their papers we have counts for
14 papers
Demand-Driven Routing Space for Lattice-Surgery Compilation
Hanyu Wang, Wan-Hsuan Lin, Zihan Chen +2
Lattice-surgery compilation places logical qubits on a grid of surface-code tiles and routes their interactions. Sparse static layouts limit routing contention but reserve space th…
FT-Weave: Real-Time Compilation Framework for Reconfigurable Fault-Tolerant Quantum Architectures
Wan-Hsuan Lin, Milan Kornjača, Chen Zhao +2
Fault-tolerant quantum computing (FTQC) is essential for large-scale quantum computation, but realizing useful application throughput requires coordinating resource preparation, as…
Architecture and Compilation Co-Design for High-Rate Quantum Product Codes on Neutral Atom Arrays
Adrian Liu, Wan-Hsuan Lin, Daniel Bochen Tan +2
Achieving fault-tolerant quantum computing at a practical scale demands quantum error correction (QEC) codes with high encoding rates. Quantum low-density parity-check (qLDPC) code…
Strategic Plan for Neutral Atom Quantum Computation
Adrian J. Menssen, Tout Wang, Michael Gullans +53
We present a strategic plan for neutral atom quantum computation, bringing together hardware development and theory advancements to achieve the goal of practical quantum advantage.…
Compilation of QCrank Encoding Algorithm for a Dynamically Programmable Qubit Array Processor
Jan Balewski, Wan-Hsuan Lin, Anupam Mitra +5
Algorithm and hardware-aware compilation co-design is essential for the efficient deployment of near-term quantum programs. We present a compilation case-study implementing QCrank…
MediQ-GAN: Quantum-Inspired GAN for High Resolution Medical Image Generation
Qingyue Jiao, Yongcan Tang, Jun Zhuang +2
Machine learning-assisted diagnosis shows promise, yet medical imaging datasets are often scarce, imbalanced, and constrained by privacy, making data augmentation essential. Classi…
A High-Performance Multilevel Framework for Quantum Layout Synthesis
Shuohao Ping, Naren Sathishkumar, Wan-Hsuan Lin +2
Quantum Layout Synthesis (QLS) is a critical compilation stage that adapts quantum circuits to hardware constraints with an objective of minimizing the SWAP overhead. While heurist…
Routing-Aware Placement for Zoned Neutral Atom-based Quantum Computing
Yannick Stade, Wan-Hsuan Lin, Jason Cong +1
Quantum computing promises to solve previously intractable problems, with neutral atoms emerging as a promising technology. Zoned neutral atom architectures allow for immense paral…
Assessing Quantum Layout Synthesis Tools via Known Optimal-SWAP Cost Benchmarks
Shuohao Ping, Wan-Hsuan Lin, Daniel Bochen Tan +1
Quantum layout synthesis (QLS) is a critical step in quantum program compilation for superconducting quantum computers, involving the insertion of SWAP gates to satisfy hardware co…
Reuse-Aware Compilation for Zoned Quantum Architectures Based on Neutral Atoms
Wan-Hsuan Lin, Daniel Bochen Tan, Jason Cong
Quantum computing architectures based on neutral atoms offer large scales and high-fidelity operations. They can be heterogeneous, with different zones for storage, entangling oper…
Quantum State Preparation Circuit Optimization Exploiting Don't Cares
Hanyu Wang, Daniel Bochen Tan, Jason Cong
Quantum state preparation initializes the quantum registers and is essential for running quantum algorithms. Designing state preparation circuits that entangle qubits efficiently w…
ML-QLS: Multilevel Quantum Layout Synthesis
Wan-Hsuan Lin, Jason Cong
Quantum Layout Synthesis (QLS) plays a crucial role in optimizing quantum circuit execution on physical quantum devices. As we enter the era where quantum computers have hundreds o…
Compilation for Dynamically Field-Programmable Qubit Arrays with Efficient and Provably Near-Optimal Scheduling
Daniel Bochen Tan, Wan-Hsuan Lin, Jason Cong
Dynamically field-programmable qubit arrays based on neutral atoms feature high fidelity and highly parallel gates for quantum computing. However, it is challenging for compilers t…
Depth-Optimal Addressing of 2D Qubit Array with 1D Controls Based on Exact Binary Matrix Factorization
Daniel Bochen Tan, Shuohao Ping, Jason Cong
Reducing control complexity is essential for achieving large-scale quantum computing. However, reducing control knobs may compromise the ability to independently address each qubit…