Searcharxiv⌕ Search

arXiv subjects

Xinhua Peng

Publications and source records attributed to Xinhua Peng.

At least 91 records · Page 5Linked to original sources

Experimental quantum Zeno effect in NMR with entanglement-based measurement

We experimentally demonstrate a new dynamic fashion of quantum Zeno effect in nuclear magnetic resonance systems. The frequent measurements are implemented through quantum entanglement between the target qubit(s) and the measuring qubit, which dynamically results from the unitary evolution of duration $τ_{m}$ due to dispersive-coupling. Experimental results testify the presence of "the critical measurement time effect", that is, the quantum Zeno effect does not occur when $τ_{m}$ takes the some critical values, even if the measurements are frequent enough. Moreover, we provide a first experimental demonstration of an entanglement preservation mechanism based on such dynamic quantum Zeno effect.

quant-ph↗

Experimental realization of quantum algorithm for solving linear systems of equations

Quantum computers have the potential of solving certain problems exponentially faster than classical computers. Recently, Harrow, Hassidim and Lloyd proposed a quantum algorithm for solving linear systems of equations: given an $N\times{N}$ matrix $A$ and a vector $\vec b$, find the vector $\vec x$ that satisfies $A\vec x = \vec b$. It has been shown that using the algorithm one could obtain the solution encoded in a quantum state $|x$ using $O(\log{N})$ quantum operations, while classical algorithms require at least O(N) steps. If one is not interested in the solution $\vec{x}$ itself but certain statistical feature of the solution ${x}|M|x$ ($M$ is some quantum mechanical operator), the quantum algorithm will be able to achieve exponential speedup over the best classical algorithm as $N$ grows. Here we report a proof-of-concept experimental demonstration of the quantum algorithm using a 4-qubit nuclear magnetic resonance (NMR) quantum information processor. For all the three sets of experiments with different choices of $\vec b$, we obtain the solutions with over 96% fidelity. This experiment is a first implementation of the algorithm. Because solving linear systems is a common problem in nearly all fields of science and engineering, we will also discuss the implication of our results on the potential of using quantum computers for solving practical linear systems.

quant-ph↗

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↗

An Efficient Deterministic Quantum Algorithm for the Integer Square-free Decomposition Problem

Quantum computers are known to be qualitatively more powerful than classical computers, but so far only a small number of different algorithms have been discovered that actually use this potential. It would therefore be highly desirable to develop other types of quantum algorithms that widen the range of possible applications. Here we propose an efficient and deterministic quantum algorithm for finding the square-free part of a large integer - a problem for which no efficient classical algorithm exists. The algorithm relies on properties of Gauss sums and uses the quantum Fourier transform. We give an explicit quantum network for the algorithm. Our algorithm introduces new concepts and methods that have not been used in quantum information processing so far and may be applicable to a wider class of problems.

quant-ph↗

High fidelity quantum memory via dynamical decoupling: theory and experiment

Quantum information processing requires overcoming decoherence---the loss of "quantumness" due to the inevitable interaction between the quantum system and its environment. One approach towards a solution is quantum dynamical decoupling---a method employing strong and frequent pulses applied to the qubits. Here we report on the first experimental test of the concatenated dynamical decoupling (CDD) scheme, which invokes recursively constructed pulse sequences. Using nuclear magnetic resonance, we demonstrate a near order of magnitude improvement in the decay time of stored quantum states. In conjunction with recent results on high fidelity quantum gates using CDD, our results suggest that quantum dynamical decoupling should be used as a first layer of defense against decoherence in quantum information processing implementations, and can be a stand-alone solution in the right parameter regime.

quant-ph↗

Solving Quantum Ground-State Problems with Nuclear Magnetic Resonance

Quantum ground-state problems are computationally hard problems; for general many-body Hamiltonians, there is no classical or quantum algorithm known to be able to solve them efficiently. Nevertheless, if a trial wavefunction approximating the ground state is available, as often happens for many problems in physics and chemistry, a quantum computer could employ this trial wavefunction to project the ground state by means of the phase estimation algorithm (PEA). We performed an experimental realization of this idea by implementing a variational-wavefunction approach to solve the ground-state problem of the Heisenberg spin model with an NMR quantum simulator. Our iterative phase estimation procedure yields a high accuracy for the eigenenergies (to the 10^-5 decimal digit). The ground-state fidelity was distilled to be more than 80%, and the singlet-to-triplet switching near the critical field is reliably captured. This result shows that quantum simulators can better leverage classical trial wavefunctions than classical computers.

quant-ph↗

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↗

NMR Experimental Demonstration of Probabilistic Quantum Cloning

The method of quantum cloning is divided into two main categories: approximate and probabilistic quantum cloning. The former method is used to approximate an unknown quantum state deterministically, and the latter can be used to faithfully copy the state probabilistically. So far, many approximate cloning machines have been experimentally demonstrated, but probabilistic cloning remains an experimental challenge, as it requires more complicated networks and a higher level of precision control. In this work, we designed an efficient quantum network with a limited amount of resources, and performed the first experimental demonstration of probabilistic quantum cloning in an NMR quantum computer. In our experiment, the optimal cloning efficiency proposed by Duan and Guo [Phys. Rev. Lett. \textbf{80}, 4999 (1998)] is achieved.

quant-ph↗

Observation of the ground-state-geometric phase in a Heisenberg XY model

Geometric phases play a central role in a variety of quantum phenomena, especially in condensed matter physics. Recently, it was shown that this fundamental concept exhibits a connection to quantum phase transitions where the system undergoes a qualitative change in the ground state when a control parameter in its Hamiltonian is varied. Here we report the first experimental study using the geometric phase as a topological test of quantum transitions of the ground state in a Heisenberg XY spin model. Using NMR interferometry, we measure the geometric phase for different adiabatic circuits that do not pass through points of degeneracy.

quant-ph↗

Performance comparison of dynamical decoupling sequences for a qubit in a rapidly fluctuating spin-bath

Avoiding the loss of coherence of quantum mechanical states is an important prerequisite for quantum information processing. Dynamical decoupling (DD) is one of the most effective experimental methods for maintaining coherence, especially when one can access only the qubit-system and not its environment (bath). It involves the application of pulses to the system whose net effect is a reversal of the system-environment interaction. In any real system, however, the environment is not static, and therefore the reversal of the system-environment interaction becomes imperfect if the spacing between refocusing pulses becomes comparable to or longer than the correlation time of the environment. The efficiency of the refocusing improves therefore if the spacing between the pulses is reduced. Here, we quantify the efficiency of different DD sequences in preserving different quantum states. We use 13C nuclear spins as qubits and an environment of 1H nuclear spins as the environment, which couples to the qubit via magnetic dipole-dipole couplings. Strong dipole-dipole couplings between the proton spins result in a rapidly fluctuating environment with a correlation time of the order of 100 us. Our experimental results show that short delays between the pulses yield better performance if they are compared with the bath correlation time. However, as the pulse spacing becomes shorter than the bath correlation time, an optimum is reached. For even shorter delays, the pulse imperfections dominate over the decoherence losses and cause the quantum state to decay.

quant-ph↗

Quantum simulation of a system with competing two- and three-body interactions

Quantum phase transitions occur at zero temperature, when the ground state of a Hamiltonian undergoes a qualitative change as a function of a control parameter. We consider a particularly interesting system with competing one-, two- and three-body interactions. Depending on the relative strength of these interactions, the ground state of the system can be a product state, or it can exhibit genuine tripartite entanglement. We experimentally simulate such a system in an NMR quantum simulator and observe the different ground states. By adiabatically changing the strength of one coupling constant, we push the system from one ground state to a qualitatively different ground state. We show that these ground states can be distinguished and the transitions between them observed by measuring correlations between the spins or the expectation values of suitable entanglement witnesses.

quant-ph↗

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↗

Experimental demonstration of deterministic one-way quantum computing on a NMR quantum computer

One-way quantum computing is an important and novel approach to quantum computation. By exploiting the existing particle-particle interactions, we report the first experimental realization of the complete process of deterministic one-way quantum Deutsch-Josza algorithm in NMR, including graph state preparation, single-qubit measurements and feed-forward corrections. The findings in our experiment may shed light on the future scalable one-way quantum computation.

quant-ph↗

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↗

Quantitative complementarity between local and nonlocal character of quantum states in a three-qubit system

Local or nonlocal character of quantum states can be quantified and is subject to various bounds that can be formulated as complementarity relations. Here, we investigate the local vs. nonlocal character of pure three-qubit states by a four-way interferometer. The complete entanglement in the system can be measured as the entanglement of a specific qubit with the subsystem consisting of the other two qubits. The quantitative complementarity relations are verified experimentally in an NMR quantum information processor.

quant-ph↗

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↗

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↗

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↗