相关论文: Implementation of Conditional Phase Shift gate for…
We review recent progress made in quantum information processing (QIP) which can be applied in the simulation of quantum systems and chemical phenomena. The review is focused on quantum algorithms which are useful for quantum simulation of…
A continuous, analog version of the Grover algorithm is realized using NMR. The system studied is 23Na in a liquid crystal medium. The presence of quadrupolar coupling makes the spin I=3/2 nucleus a 2-qubit system. Applying a specially…
This paper describes recent progress using nuclear magnetic resonance (NMR) as a platform for implementing quantum information processing (QIP) tasks. The basic ideas of NMR QIP are detailed, examining the successes and limitations of…
Compared with classical search algorithms, Grover quantum algorithm [ Phys. Rev. Lett., 79, 325(1997)] achieves quadratic speedup and Bruschweiler hybrid quantum algorithm [Phys. Rev. Lett., 85, 4815(2000)] achieves an exponential speedup.…
A misunderstanding that an arbitrary phase rotation of the marked state together with the inversion about average operation in Grover's search algorithm can be used to construct a (less efficient) quantum search algorithm is cleared. The…
We propose a novel scheme to implement a quantum controlled phase gate for trapped ions in thermal motion with one standing wave laser pulse. Instead of applying the rotating wave approximation this scheme makes use of the counter-rotating…
In the model of gate-based quantum computation, the qubits are controlled by a sequence of quantum gates. In superconducting qubit systems, these gates can be implemented by voltage pulses. The success of implementing a particular gate can…
Adiabatic geometric phase gates offer enhanced robustness against fluctuations compared to con- ventional Rydberg blockade-based phase gates that rely on dynamical phase accumulation. We theoretically demonstrate two- and multi-qubit phase…
We proposed a scheme to realize a controlled-NOT quantum logic gate in a dimer of exchange coupled single-molecule magnets, $[\textrm{Mn}_4]_2$. We chosen the ground state and the three low-lying excited states of a dimer in a finite…
We present a general technique to implement products of many qubit operators communicating via a joint harmonic oscillator degree of freedom in a quantum computer. By conditional displacements and rotations we can implement Hamiltonians…
The ability to implement the Quantum Fourier Transform (QFT) efficiently on a quantum computer facilitates the advantages offered by a variety of fundamental quantum algorithms, such as those for integer factoring, computing discrete…
Each iteration in Grover's original quantum search algorithm contains 4 steps: two Hadamard-Walsh transformations and two amplitudes inversions. When the inversion of the marked state is replaced by arbitrary phase rotation \theta and the…
We develop a new class of genetic algorithm that computationally determines efficient pulse sequences to implement a quantum gate U in a three-qubit system. The method is shown to be quite general, and the same algorithm can be used to…
Numerous conceptually important quantum algorithms rely on a black-box device known as an oracle, which is typically difficult to construct without knowing the answer to the problem that the algorithm is intended to solve. A notable example…
Quantum computing exploits fundamentally new models of computation based on quantum mechanical properties instead of classical physics, and it is believed that quantum computers are able to dramatically improve computational power for…
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…
Grover's quantum search algorithm promises a quadratic speedup for unstructured search over its classical counterpart. But this advantage is affected by noise acting on the search space. Here, we show that a quantum switch can act as a…
In the domain of variational quantum algorithms, quantum Fourier models (QFMs) provide a mathematically well defined structure for quantum machine learning (QML). There has been a substantial amount of work on the scalability and…
Generalized Grover's searching algorithm for the case in which there are multiple marked states is demonstrated on a nuclear magnetic resonance (NMR) quantum computer. The entangled basis states (EPR states) are synthesized using the…
How to effectively construct robust quantum gates for time-varying noise is a very important but still outstanding problem. Here we develop a systematic method to find pulses for quantum gate operations robust against both low- and…