6 papers
Efficient Compilation for Hamiltonian Simulation via Global Binary Symplectic Form Simplification
Zhaohui Yang, Yuwei Han, Ruiyun Zhang +4
Hamiltonian simulation is a core quantum workload, underpinning variational quantum algorithms and Trotterized time evolution. Such programs are expressed as Pauli exponential sequ…
Unifying Qubit Routing Across Diverse Quantum ISAs via Canonical Representation
Zhaohui Yang, Kai Zhang, Xinyang Tian +6
Qubit mapping/routing is a critical stage in compilation for both near-term and fault-tolerant quantum computers, yet existing scalable methods typically impose several times the r…
Reconfigurable Quantum Instruction Set Computers for High Performance Attainable on Hardware
Zhaohui Yang, Dawei Ding, Qi Ye +3
The performance of current quantum hardware is severely limited. While expanding the quantum ISA with high-fidelity, expressive basis gates is a key path forward, it imposes signif…
One Gate Scheme to Rule Them All: Introducing a Complex Yet Reduced Instruction Set for Quantum Computing
Jianxin Chen, Dawei Ding, Weiyuan Gong +2
The design and architecture of a quantum instruction set are paramount to the performance of a quantum computer. This work introduces a gate scheme for qubits with coupling…
PHOENIX: Pauli-Based High-Level Optimization Engine for Instruction Execution on NISQ Devices
Zhaohui Yang, Dawei Ding, Chenghong Zhu +2
Variational quantum algorithms (VQA) based on Hamiltonian simulation represent a specialized class of quantum programs well-suited for near-term quantum computing applications due…
Efficient Implementation of Arbitrary Two-Qubit Gates via Unified Control
Zhen Chen, Weiyang Liu, Yanjun Ma +16
The native gate set is fundamental to the performance of quantum devices, as it governs the accuracy of basic quantum operations and dictates the complexity of implementing quantum…