5 papers · 1 filter
QROB: Quantifying Realization Overhead in Quantum Compilation via Reverse Construction
Jintao Li, Kaiqi Li, Rui Wang +7
Quantum compilation reconciles a program's idealized interaction topology with hardware locality constraints, yet evaluations at scale lack calibrated references for realization ov…
Quantum Algorithm for Elliptic Curve Discrete Logarithms with Space-Efficient Point Addition
Han Luo, Ziyi Yang, Jingquan Luo +5
The Elliptic Curve Discrete Logarithm Problem (ECDLP) is a fundamental problem in cryptography, and reducing the resource requirements of quantum algorithms for solving ECDLP is an…
Scalable Multi-QPU Circuit Design for Dicke State Preparation: Optimizing Communication Complexity and Local Circuit Costs
Ziheng Chen, Junhong Nie, Xiaoming Sun +2
Preparing large-qubit Dicke states is of broad interest in quantum computing and quantum metrology. However, the number of qubits available on a single quantum processing unit (QPU…
Communication Complexity of Distributed Unitary Synthesis
Longcheng Li, Xiaoming Sun, Jialin Zhang +1
We study space-bounded communication complexity for unitary implementation in distributed quantum processors, where we restrict the number of qubits per processor to ensure practic…
Quantum Byzantine Agreement Against Full-information Adversary
Longcheng Li, Xiaoming Sun, Jiadong Zhu
We exhibit that, when given a classical Byzantine agreement protocol designed in the private-channel model, it is feasible to construct a quantum agreement protocol that can effect…