arXiv subjects

Nanyang Xu

Publications and source records attributed to Nanyang Xu.

27 records · Page 2Linked to original sources

arXiv2012

Coherence-protected Quantum Gate by Continuous Dynamical Decoupling in Diamond

To implement reliable quantum information processing, quantum gates have to be protected together with the qubits from decoherence. Here we demonstrate experimentally on nitrogen-vacancy system that by using continuous wave dynamical decoupling method, not only the coherence time is prolonged by about 20 times, but also the quantum gates is protected for the duration of controlling time. This protocol shares the merits of retaining the superiority of prolonging the coherence time and at the same time easily combining with quantum logic tasks. It is expected to be useful in task where duration of quantum controlling exceeds far beyond the dephasing time.

quant-ph↗

arXiv2012

Quantum Discord for Investigating Quantum Correlations without Entanglement in Solids

Quantum systems unfold diversified correlations which have no classical counterparts. These quantum correlations have various different facets. Quantum entanglement, as the most well known measure of quantum correlations, plays essential roles in quantum information processing. However, it has recently been pointed out that quantum entanglement cannot describe all the nonclassicality in the correlations. Thus the study of quantum correlations in separable states attracts widely attentions. Herein, we experimentally investigate the quantum correlations of separable thermal states in terms of quantum discord. The sudden change of quantum discord is observed, which captures ambiguously the critical point associated with the behavior of Hamiltonian. Our results display the potential applications of quantum correlations in studying the fundamental properties of quantum system, such as quantum criticality of non-zero temperature.

quant-ph↗

arXiv2011

Quantum Factorization of 143 on a Dipolar-Coupling NMR system

Quantum algorithms could be much faster than classical ones in solving the factoring problem. Adiabatic quantum computation for this is an alternative approach other than Shor's algorithm. Here we report an improved adiabatic factoring algorithm and its experimental realization to factor the number 143 on a liquid crystal NMR quantum processor with dipole-dipole couplings. We believe this to be the largest number factored in quantum-computation realizations, which shows the practical importance of adiabatic quantum algorithms.

quant-ph↗

arXiv2011

Simulation of chemical reaction dynamics on an NMR quantum computer

Quantum simulation can beat current classical computers with minimally a few tens of qubits and will likely become the first practical use of a quantum computer. One promising application of quantum simulation is to attack challenging quantum chemistry problems. Here we report an experimental demonstration that a small nuclear-magnetic-resonance (NMR) quantum computer is already able to simulate the dynamics of a prototype chemical reaction. The experimental results agree well with classical simulations. We conclude that the quantum simulation of chemical reaction dynamics not computable on current classical computers is feasible in the near future.

quant-ph↗

arXiv2010

Room-temperature implementation of the Deutsch-Jozsa algorithm with a single electronic spin in diamond

The nitrogen-vacancy defect center (NV center) is a promising candidate for quantum information processing due to the possibility of coherent manipulation of individual spins in the absence of the cryogenic requirement. We report a room-temperature implementation of the Deutsch-Jozsa algorithm by encoding both a qubit and an auxiliary state in the electron spin of a single NV center. By thus exploiting the specific S=1 character of the spin system, we demonstrate how even scarce quantum resources can be used for test-bed experiments on the way towards a large-scale quantum computing architecture.

quant-ph↗

arXiv2009

Implementation of a Quantum-simulation Algorithm of Calculating Molecular Ground-state Energy on an NMR Quantum Computer

It is exponentially hard to simulate quantum systems by classical algorithms, while quantum computer could in principle solve this problem polynomially. We demonstrate such an quantum-simulation algorithm on our NMR system to simulate an hydrogen molecule and calculate its ground-state energy. We utilize the NMR interferometry method to measure the phase shift and iterate the process to get a high precision. Finally we get 17 precise bits of the energy value, and we also analyze the source of the error in the simulation.

quant-ph↗

arXiv2008

Complete Adiabatic Quantum Search in Unsorted Databases

We propose a new adiabatic algorithm for the unsorted database search problem. This algorithm saves two thirds of qubits than Grover's algorithm in realizations. Meanwhile, we analyze the time complexity of the algorithm by both perturbative method and numerical simulation. The results show it provides a better speedup than the previous adiabatic search algorithm.

quant-ph↗

arXiv2008

A Non-Oracle Quantum Search Algorithm and Its Experimental Implementation

Grover's algorithm has achieved great success. But quantum search algorithms still are not complete algorithms because of Grover's Oracle. We concerned on this problem and present a new quantum search algorithm in adiabatic model without Oracle. We analyze the general difficulties in quantum search algorithms and show how to solve them in the present algorithm. As well this algorithm could deal with both single-solution and multi-solution searches without modification. We also implement this algorithm on NMR quantum computer. It is the first experiment which perform a real quantum database search rather than a marked-state search.

quant-ph↗

arXiv2008

A Quantum Adiabatic Algorithm for Factorization and Its Experimental Implementation

We propose an adiabatic quantum algorithm capable of factorizing numbers, using fewer qubits than Shor's algorithm. We implement the algorithm in an NMR quantum information processor and experimentally factorize the number 21. Numerical simulations indicate that the running time grows only quadratically with the number of qubits.

quant-ph↗