activity
20242026
most citedCompilation for Dynamically Field-Programmable Qubit Arrays with Efficient and Provably Near-Optimal Scheduling

11 citations · 26 across the 12 of their papers we have counts for

collaborators
Showing 2024Show all

5 papers · 1 filter

quant-ph2024★ 8 cited

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…

quant-ph2024

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…

quant-ph2024

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…

cs.ET2024★ 11 cited

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…

cs.ET2024★ 5 cited

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…