5 papers
Quantum Advantage of Permutation-Invariant Functions in Communication Complexity
Yunqi Huang, Zekun Ye
We study how symmetry affects quantum advantage in two-party communication complexity. For any partial function on length- strings over a fixed alphabet of size , invaria…
SSR: A Swapping-Sweeping-and-Rewriting Optimizer for Quantum Circuit Transformation
Yunqi Huang, Xiangzhen Zhou, Fanxu Meng +3
Quantum circuit transformation (QCT), necessary for adapting any quantum circuit to the qubit connectivity constraints of the NISQ device, often introduces numerous additional SWAP…
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…
Quantum and Classical Communication Complexity of Permutation-Invariant Functions
Ziyi Guan, Yunqi Huang, Penghui Yao +1
This paper gives a nearly tight characterization of the quantum communication complexity of the permutation-invariant Boolean functions. With such a characterization, we show that…