[en] The Deutsch-like algorithm [Phys. Rev. A. 63 (2001) 034101] distinguishes between even and odd query functions using fewer function calls than its possible classical counterpart in a two-qubit system. But the similar method cannot be applied to a multi-qubit system. We propose a new approach for solving Deutsch-like problem using ensemble computing. The proposed algorithm needs an ancillary qubit and can be easily extended to multi-qubit system with one query. Our ensemble algorithm beginning with a easily-prepared initial state has three main steps. The classifications of the functions can be obtained directly from the spectra of the ancilla qubit. We also demonstrate the new algorithm in a four-qubit molecular system using nuclear magnetic resonance (NMR). One hydrogen and three carbons are selected as the four qubits, and one of carbons is ancilla qubit. We choice two unitary transformations, corresponding to two functions (one odd function and one even function), to validate the ensemble algorithm. The results show that our experiment is successfully and our ensemble algorithm for solving the Deutsch-like problem is virtual

[en] Recent years, remarkable progresses in experimental realization of quantum information have been made, especially based on nuclear magnetic resonance (NMR) theory. In all quantum algorithms, Deutsch-Jozsa algorithm has been widely studied. It can be realized on NMR quantum computer and also can be simplified by using the Cirac's scheme. At first the principle of Deutsch-Jozsa quantum algorithm is analyzed, then the authors implement the seven-qubit Deutsch-Jozsa algorithm on NMR quantum computer

[en] The Brueschweiler quantum search [Phys. Rev. Lett. 85, 4815 (2000)] offers an exponential speedup over the corresponding classical search. In the Brueschweiler search, the data bits and measurement bit (the ancillary bit) are different bits. We propose a modified method, in which no ancillary bit is needed to reach exponential speedup. The modified Brueschweiler search can be easier to design and realize. We also demonstrate the modified search in a three-qubit molecular system using nuclear magnetic resonance

[en] In recent years, quantum computing research has made big progress, which exploit quantum mechanical laws, such as interference, superposition and parallelism, to perform computing tasks. The most inducing thing is that the quantum computing can provide large rise to the speedup in quantum algorithm. Quantum computing can solve some problems, which are impossible or difficult for the classical computing. The problem of searching for a specific item in an unsorted database can be solved with certain quantum algorithm, for example, Grover quantum algorithm and Brueschweiler quantum algorithm. The former gives a quadratic speedup, and the latter gives an exponential speedup comparing with the corresponding classical algorithm. In Brueschweiler quantum searching algorithm, the data qubit and the read-out qubit (the ancilla qubit) are different qubits. The authors have studied Brueschweiler algorithm and proposed a modified version, in which no ancilla qubit is needed to reach exponential speedup in the searching, the data and the read-out qubit are the same qubits. The modified Brueschweiler algorithm can be easier to design and realize. The authors also demonstrate the modified Brueschweiler algorithm in a 3-qubit molecular system by Nuclear Magnetic Resonance (NMR) experiment

[en] The precision of measurements for two incompatible observables in a physical system can be improved with the assistance of quantum memory. In this paper, we investigate the quantum-memory-assisted entropic uncertainty relation for a spin-1 Heisenberg model in the presence of external magnetic fields, the systemic quantum entanglement (characterized by the negativity) is analyzed as contrast. Our results show that for the XY spin chain in thermal equilibrium, the entropic uncertainty can be reduced by reinforcing the coupling between the two particles or decreasing the temperature of the environment. At zero-temperature, the strong magnetic field can result in the growth of the entropic uncertainty. Moreover, in the Ising case, the variation trends of the uncertainty are relied on the choices of anisotropic parameters. Taking the influence of intrinsic decoherence into account, we find that the strong coupling accelerates the inflation of the uncertainty over time, whereas the high magnetic field contributes to its reduction during the temporal evolution. Furthermore, we also verify that the evolution behavior of the entropic uncertainty is roughly anti-correlated with that of the entanglement in the whole dynamical process. Our results could offer new insights into quantum precision measurement for the high spin solid-state systems. (letter)

[en] Using an extended version of the optimal-control-based gradient ascent pulse engineering algorithm, cooperative (COOP) pulses are designed for multi-scan experiments to prepare pseudo-pure states in quantum computation. COOP pulses can cancel undesired signal contributions, complementing and generalizing phase cycles. They also provide more flexibility and, in particular, eliminate the need to select specific individual target states and achieve the fidelity of theoretical limit by flexibly choosing appropriate number of scans and duration of pulses. The COOP approach is experimentally demonstrated for three-qubit and four-qubit systems.

[en] This Letter presents a three-qubit quantum error correction scheme that adopts the optimal universal 1->2 quantum cloning transformation U to encode an unknown state vertical bar φ> vertical bar 0> vertical bar 0> into a three-qubit state U vertical bar φ> vertical bar 0> vertical bar 0>. The encoded state could protect against collective decoherences that any two qubits in a three-qubit system are affected by either phase error or bit flip error, or simultaneously affected by both of them. To recover the original unknown state, we just need to perform a Bell measurement on the first two qubits and rotate the third qubit along a suitable axis. Specially, our scheme for the first time shows that quantum cloning is useful for quantum error correction