3 citations · 3 across the 4 of their papers we have counts for
4 papers · 1 filter
Harnessing problem structure for end-to-end quantum speed-ups
Qifan Jiang, Xiao-Ming Zhang, Debin Xiang +3
Quantum algorithms can offer substantial computational speed-ups, yet these advantages may disappear once the cost of structure-agnostic classical data encoding is taken into accou…
Shared Phase Arithmetic for Parallel Quantum Rotations
Anbang Wu, Liqiang Lu, Pu Pang +3
A layer of diagonal quantum gates can be specified by an integer-valued function on computational basis states. This description suggests implementing the layer by evaluating that…
Experimental realization of the bucket-brigade quantum random access memory
Fanhao Shen, Yujie Ji, Debin Xiang +20
Quantum random access memory (QRAM) enables efficient classical data access for quantum computers -- a prerequisite for many quantum algorithms to achieve quantum speedup. Despite…
Choco-Q: Commute Hamiltonian-based QAOA for Constrained Binary Optimization
Debin Xiang, Qifan Jiang, Liqiang Lu +2
Constrained binary optimization aims to find an optimal assignment to minimize or maximize the objective meanwhile satisfying the constraints, which is a representative NP problem…