10 citations · 47 across the 22 of their papers we have counts for
Showing 2001Show all
2 papers · 1 filter
quant-ph2001★ 10 cited
A polynomial-time solution to the parity problem on an NMR quantum computer
Xijia Miao
An efficient quantum algorithm is proposed to solve in polynomial time the parity problem, one of the hardest problems both in conventional quantum computation and in classical com…
quant-ph2001★ 4 cited
Universal construction for the unsorted quantum search algorithms
Xijia Miao
The multiple-quantum operator algebra formalism has been exploited to construct generally an unsorted quantum search algorithm. The exponential propagator and its corresponding eff…