Learn More
Using nuclear magnetic resonance (NMR) techniques with three-qubit sample , we have experimentally implemented the highly structured algorithm for the 1-SAT problem proposed by Hogg. A simplified temporal averaging procedure was employed to the three-qubit spin pseudo-pure state. The algorithm was completed with only a single evaluation of structure of the(More)
It is difficult to simulate quantum systems on classical computers, while quantum computers have been proved to be able to efficiently perform such kinds of simulations. We report an NMR implementation simulating the hydrogen molecule (H2) in a minimal basis to obtain its ground-state energy. Using an iterative NMR interferometer to measure the phase shift,(More)
The nitrogen-vacancy defect center (N-V 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(More)
Cryptosporidium is an environmentally robust pathogen that has caused severe waterborne disease outbreaks worldwide. The main source of zoonotic Cryptosporidium parvum oocysts in human drinking water is likely to be from farm animals via catchment pathways with water as the main transport vector. The vast majority of small agricultural catchments are(More)
Using an NMR quantum computer, we experimentally simulate the quantum phase transition of a Heisen-berg spin chain. The Hamiltonian is generated by a multiple-pulse sequence, the nuclear-spin system is prepared in its (pseudopure) ground state, and the effective Hamiltonian varied in such a way that the Heisenberg chain is taken from a product state to an(More)
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(More)
We propose an adiabatic quantum algorithm capable of factorizing numbers, using fewer qubits than Shor's algorithm. We implement the algorithm in a NMR quantum information processor and experimentally factorize the number 21. In the range that our classical computer could simulate, the quantum adiabatic algorithm works well, providing evidence that the(More)
A new method of preparing the pseudo-pure state of a spin system for quantum computation in liquid nuclear magnetic resonance (NMR) was put forward and demonstrated experimentally. Applying appropriately connected line-selective pulses simultaneously and a field gradient pulse techniques we acquired straightforwardly all pseudo-pure states for two qubits in(More)
It has been claimed that quantum computers can mimic quantum systems efficiently in the polynomial scale. Traditionally, those simulations are carried out numerically on classical computers, which are inevitably confronted with the exponential growth of required resources, with the increasing size of quantum systems. Quantum computers avoid this problem,(More)
We have experimentally implemented remote state preparation (RSP) of a qubit from a hydrogen to a carbon nucleus in molecules of carbon-13 labeled chloroform 13 CHCl 3 over interatomic distances using liquid-state nuclear magnetic resonance (NMR) technique. Full RSP of a special ensemble of qubits, i.e., a qubit chosen from equatorial and polar great(More)