Related papers: Quantum entanglement in the NMR implementation of …
The well-known Deutsch Algorithm (DA) and Deutsch-Jozsha Algorithm (DJA) both are used as an evidence to the power of quantum computers over classical computation mediums. In these theoretical experiments, it has been shown that a quantum…
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…
Universal quantum information processing requires single-qubit rotations and two-qubit interactions as minimal resources. A possible step beyond this minimal scheme is the use of three-qubit interactions. We consider such three-qubit…
We demonstrate the first implementation of a quantum algorithm on a liquid state nuclear magnetic resonance (NMR) quantum computer using almost pure states. This was achieved using a two qubit device where the initial state is an almost…
Here a finite-Lieb-lattice quantum computing circuit consisting of spin-1/2 quantum bits (qubits) and triplet couplers is designed. Important gradient - quantum entanglement - is analysed. This type of design could be realised in a vast…
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…
We use Nuclear Magnetic Resonance (NMR) to experimentally generate a bound entangled (more precisely: pseudo bound entangled) state, i.e. a quantum state which is non-distillable but nevertheless entangled. Our quantum system consists of…
We describe a general framework for regarding oracle-assisted quantum algorithms as tools for discriminating between unitary transformations. We apply this to the Deutsch-Jozsa problem and derive all possible quantum algorithms which solve…
Entanglement forging based variational algorithms leverage the bi-partition of quantum systems for addressing ground state problems. The primary limitation of these approaches lies in the exponential summation required over the numerous…
Quantum correlations have been pointed out as the most likely source of the speed-up in quantum computation. Here we analyzed the presence of quantum correlations in the implementation of Deutsch-Jozsa algorithm running in the DQC1 and DQCp…
Deutsch-Jozsa (DJ) problem is one of the most important problems demonstrating the power of quantum algorithm. DJ problem can be described as a Boolean function $f$: $\{0,1\}^n\rightarrow \{0,1\}$ with promising it is either constant or…
We propose a scheme for implementing quantum gates and entanglement between spin qubits in the outer dots of a triple-dot system with an empty central dot. The voltage applied to the central dot can be tuned to realize the gate. Our scheme…
We undertake experimental detection of the entanglement present in arbitrary three-qubit pure quantum states on an NMR quantum information processor. Measurements of only four observables suffice to experimentally differentiate between the…
By harnessing the superposition and entanglement of physical states, quantum computers could outperform their classical counterparts in solving problems of technological impact, such as factoring large numbers and searching databases. A…
The Deutsch-Jozsa algorithm is experimentally demonstrated for three-qubit functions using pure coherent superpositions of Li$_{2}$ rovibrational eigenstates. The function's character, either constant or balanced, is evaluated by first…
We propose an implementation for quantum logic and computing using trapped atomic spins of two different species, interacting via direct magnetic spin-spin interaction. In this scheme, the spins (electronic or nuclear) of distantly spaced…
The evolution of entanglement in a 3-spin chain with nearest-neighbor Heisenberg-XY interactions for different initial states is investigated here. In an NMR experimental implementation, we generate multipartite entangled states starting…
Quantum algorithms could efficiently solve certain classically intractable problems by exploiting quantum parallelism. To date, whether the quantum entanglement is useful or not for quantum computing is still a question of debate. Here, we…
Geometric phases have been used in NMR, to implement controlled phase shift gates for quantum information processing, only in weakly coupled systems in which the individual spins can be identified as qubits. In this work, we implement…
This thesis addresses the problems of initialization and separability in liquid state NMR based quantum information processors. We prepare pure quantum states lying above the entanglement threshold. Our pure state quantum computer derives…