activity
20002003
most citedSolving the quantum search problem in polynomial time on an NMR quantum computer

5 citations · 7 across the 2 of their papers we have counts for

collaborators

8 papers

quant-ph20032 cited

A prime factorization based on quantum dynamics on a spin ensemble (I)

Xijia Miao

In this paper it has been described how to use the unitary dynamics of quantum mechanics to solve the prime factorization problem on a spin ensemble without any quantum entanglemen…

quant-ph20025 cited

Solving the quantum search problem in polynomial time on an NMR quantum computer

Xijia Miao

The quantum search problem is an important problem due to the fact that a general NP problem can be solved efficiently by an unsorted quantum search algorithm. Here it has been sho…

quant-ph2002

Ultra-broadband Heteronuclear Hartmann-Hahn polarization transfer

Xijia Miao

It is showed on the basis of the multiple-quantum operator algebra space formalism that ultra-broadband heteronuclear Hartmann-Hahn polarization transfer could be achieved by the a…

quant-ph2001

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

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…

quant-ph2000

A convenient method to prepare the effective pure state in a quantum ensemble

Xijia Miao

A simple method is proposed to prepare conveniently the effective pure state |00...0><0...00| with any number of qubits in a quantum ensemble. The preparation is based on the tempo…