7 papers · 1 filter
Fast Template Matching for Quantum Circuits Using Hypergraph
Xin Hong, Jintao Yu, Runhong He +3
Quantum circuit optimization is a key step toward the efficient execution of quantum algorithms. Template matching has emerged as one of the dominant approaches for simplifying qua…
Oracle Synthesis Based on X-Map Decision Diagrams
Xin Hong, Kezhen Zhang, Aochu Dai +3
Quantum oracles act as reversible black-box operators that encode classical Boolean functions into quantum states, enabling efficient function evaluation in quantum superposition.…
dSABRE: A SABRE-Style Router for Multi-Core Distributed Quantum Computers
Sanjiang Li
Minimising EPR consumption is the dominant objective when routing a quantum circuit on a distributed quantum computer (DQC). We present dSABRE, a SABRE-style router for multi-core…
Quantum State Preparation Based on LimTDD
Xin Hong, Chenjian Li, Aochu Dai +3
Quantum state preparation is a fundamental task in quantum computing and quantum information processing. With the rapid advancement of quantum technologies, efficient quantum state…
Optimal Compilation Strategies for QFT Circuits in Neutral-Atom Quantum Computing
Dingchao Gao, Yongming Li, Shenggang Ying +1
Neutral-atom quantum computing (NAQC) offers distinct advantages such as dynamic qubit reconfigurability, long coherence times, and high gate fidelities, making it a promising plat…
Qubit Mapping: The Adaptive Divide-and-Conquer Approach
Yunqi Huang, Xiangzhen Zhou, Fanxu Meng +1
The qubit mapping problem (QMP) focuses on the mapping and routing of qubits in quantum circuits so that the strict connectivity constraints imposed by near-term quantum hardware a…
DasAtom: A Divide-and-Shuttle Atom Approach to Quantum Circuit Transformation
Yunqi Huang, Dingchao Gao, Shenggang Ying +1
Neutral atom (NA) quantum systems are emerging as a leading platform for quantum computation, offering superior or competitive qubit count and gate fidelity compared to superconduc…