Related papers: Implementation of NMR quantum computation with par…
Quantum machine learning algorithms have emerged to be a promising alternative to their classical counterparts as they leverage the power of quantum computers. Such algorithms have been developed to solve problems like electronic structure…
In bulk quantum computation one can manipulate a large number of indistinguishable quantum computers by parallel unitary operations and measure expectation values of certain observables with limited sensitivity. The initial state of each…
The propagation of excitation along a one-dimensional chain of atoms is simulated by means of NMR. The physical system used as an analog quantum computer is a nucleus of 133-Cs (spin 7/2) in a liquid crystalline matrix. The Hamiltonian of…
Twirl operations, which convert impure singlet states into Werner states, play an important role in many schemes for entanglement purification. In this paper we describe strategies for implementing twirl operations, with an emphasis on…
A three-qubit 13C solid-state nuclear magnetic resonance (NMR) system for quantum information processing, based on the malonic acid molecule, is used to demonstrate high-fidelity universal quantum control via strongly-modulating…
We report the first use of "logical labeling" to perform a quantum computation with a room-temperature bulk system. This method entails the selection of a subsystem which behaves as if it were at zero temperature - except for a decrease in…
We report the first experimental demonstration of an all-optical one-way implementation of Deutsch's quantum algorithm on a four-qubit cluster state. All the possible configurations of a balanced or constant function acting on a two-qubit…
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…
Quantum computers, which take advantage of the superposition and entanglement of physical states, could outperform their classical counterparts in solving problems with technological impact, such as factoring large numbers and searching…
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}$…
Quantum Information processing by NMR with small number of qubits is well established. Scaling to higher number of qubits is hindered by two major requirements (i) mutual coupling among qubits and (ii) qubit addressability. It has been…
We give out a proposal of quantum simulation of pairing model on an NMR quantum computer. In our proposal, we choose an appropriate initial state which can be easily prepared in experiment. Making use of feature of NMR measure and the…
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…
Quantum-classical hybrid algorithms are emerging as promising candidates for near-term practical applications of quantum information processors in a wide variety of fields ranging from chemistry to physics and materials science. We report…
Recently quantum states discrimination has been frequently studied. In this paper we study them from the other way round, the likeness of two quantum states. The fidelity is used to describe the likeness of two quantum states. Then we…
Magic-angle spinning (MAS) solid state nuclear magnetic resonance (NMR) spectroscopy is shown to be a promising technique for implementing quantum computing. The theory underlying the principles of quantum computing with nuclear spin…
We discuss quantum state tomography via a stepwise reconstruction of the eigenstates of the mixed states produced in experiments. Our method is tailored to the experimentally relevant class of nearly pure states or simple mixed states,…
We demonstrate an implementation of a quantum search algorithm on a two qubit NMR quantum computer based on cytosine.
The phenomenon of quantum entanglement is fundamental to the implementation of quantum computation, and requires at least two qubits for its demonstration. However, both Deutsch algorithm and Grover's search algorithm for two bits do not…
Any physical quantum device for quantum information processing is subject to errors in implementation. In order to be reliable and efficient, quantum computers will need error correcting or error avoiding methods. Fault-tolerance achieved…