Related papers: NMR experimental realization of seventh-order coup…
We show how to control and perform universal three-qubit quantum computation with trapped electron quantum states. The three qubits are the electron spin, and the first two quantum states of the cyclotron and axial harmonic oscillators. We…
We consider a family of unstructured problems, for which we propose a method for constructing analog, continuous-time quantum algorithms that are more efficient than their classical counterparts. In this family of problems, which we refer…
We present a proposal for generation of a robust tripartite Greenberger-Horne-Zeilinger state among three-individual neutral Rydberg atoms. By modulating the relation between two-photon detuning and Rydberg interaction strength $U_{ij}(r)$,…
Dynamic nuclear polarization is widely used to enhance the sensitivity of nuclear magnetic resonance. It is presently the method of choice for enhancing the sensitivity of high-field solid state NMR experiments performed under cryogenic…
Quantum circuit network is a set of circuits that implements a certain computation task. Being at the center of the quantum circuit network, the multi-qubit controlled phase shift is one of the most important quantum gates. In this paper,…
We propose a practical implementation of a two-qubit entanglement engine which denotes a scheme to generate quantum correlations through purely dissipative processes. On a diamond platform, the electron spin transitions of two…
We propose a physical scheme for implementing the Deutsch-Jozsa algorithm using atomic ensembles and optical devices. The scheme has inherent fault tolerance to the realistic noise and efficient scaling with the number of ensembles for some…
It is presently shown that the Deutsch-Jozsa algorithm is connected to the concept of bent function. Particularly, it is noticeable that the quantum circuit used to denote the well known quantum algorithm is by itself the quantum computer…
We present an experimentally implementable method to couple Josephson charge qubits and to generate and detect macroscopic entangled states. A large-junction superconducting quantum interference device is used in the qubit circuit for both…
The number of steps any classical computer requires in order to find the prime factors of an $l$-digit integer $N$ increases exponentially with $l$, at least using algorithms known at present. Factoring large integers is therefore…
This paper generalizes both the binary Deutsch-Jozsa and Grover algorithms to $n$-valued logic using the quantum Fourier transform. Our extended Deutsch-Jozsa algorithm is not only able to distinguish between constant and balanced Boolean…
Nuclear magnetic resonance is arguably both the best available quantum technology for implementing simple quantum computing experiments and the worst technology for building large scale quantum computers that has ever been seriously put…
The optimal use of quantum and classical computational techniques together is important to address problems that cannot be easily solved by quantum computations alone. This is the case of the ground state problem for quantum many-body…
Entangled states with a large number of $N$ atomic spins are a key ingredient for quantum information processing and quantum metrology. Nowadays, the preparation of such states has mainly relied on the quadratic nonlinear dynamics. Here, we…
A generalized quantum search algorithm, where phase inversions for the marked state and the prepared state are replaced by $\pi/2$ phase rotations, is realized in a 2-qubit NMR heteronuclear system. The quantum algorithm searches a marked…
We have studied transition metal clusters from a quantum information theory perspective using the density-matrix renormalization group (DMRG) method. We demonstrate the competition between entanglement and interaction localization. We also…
We propose and experimentally realize an algorithmic benchmark that demonstrates coherent control with a sequence of quantum operations that first generates and then decodes the cat state (|000...>+|111...>)/sqrt(2) to the standard initial…
Using an NMR quantum computer, we experimentally simulate the quantum phase transition of a Heisenberg spin chain. The Hamiltonian is generated by a multiple pulse sequence, the nuclear spin system is prepared in its (pseudo-pure) ground…
Quantum algorithms on near-term quantum processors are typically executed using shallow quantum circuits composed of one- and two-qubit gates. However, as circuit depth and gate number increase, gate imperfections and qubit decoherence…
In previous work, we have developed a dynamic learning paradigm for "programming" a general quantum computer. A learning algorithm is used to find a set of parameters for a coupled qubit system such that the system at an initial time…