From the 1 of 7 linked papers with an AI index.
7 papers
Efficient Depth--Ancilla Tradeoffs for Hamming Weight Computation and Symmetric Boolean Functions
Wei Zi, Pei Yuan, Junhong Nie +1
Hamming weight computation maps an -bit input to the number of ones it contains. It is a basic subroutine in quantum computing, and the core building block for symmetric Boolean…
Approximating the Trace Distance Between Product Quantum States
Kun He, Dimitrios Myrisiotis, Junhong Nie +1
We study the trace distance \[D_{\mathrm{tr}}(Ï,Ï) =\frac12\|Ï-Ï\|_1, Ï=\bigotimes_{i=1}^nÏ_i,\quad Ï=\bigotimes_{i=1}^nÏ_i, \] when the two exponentially large states are…
Nearly optimal quantum circuits for Boolean oracles
Junhong Nie, Wei Zi
The paper presents nearly optimal trade‑offs among circuit size, depth, and ancilla count for quantum oracles implementing various classes of Boolean functions, providing asymptoti…
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…
Almost Optimal Synthesis of Reversible Function in Qudit Model
Buji Xu, Junhong Nie, Xiaoming Sun
Quantum oracles are widely adopted in problems, like query oracle in Grover's algorithm, cipher in quantum cryptanalytic and data encoder in quantum machine learning. Notably, the…
Toward Minimum Graphic Parity Networks
Yixin Cao, Yiren Lu, Junhong Nie +2
Quantum circuits composed of CNOT and are fundamental building blocks of many quantum algorithms, so optimizing the synthesis of such quantum circuits is crucial. We address…