Related papers: Quantum entanglement in the NMR implementation of …
We want in this article to show the usefulness of Quantum Turing Machine (QTM) in a high-level didactic context as well as in theoretical studies. We use QTM to show its equivalence with quantum circuit model for Deutsch and Deutsch-Jozsa…
The use of nuclear spins for quantum computation is limited by the difficulty in creating genuine quantum entanglement between distant nuclei. Current demonstrations of nuclear entanglement in semiconductors rely upon coupling the nuclei to…
We demonstrate that, in the case of Shor's algorithm for factoring, highly mixed states will allow efficient quantum computation, indeed factorization can be achieved efficiently with just one initial pure qubit and a supply of initally…
Entanglement plays a crucial role in quantum physics and is the key resource in quantum information processing. However, entanglement detection and quantification are believed to be hard due to the operational impracticality of existing…
We propose a modular quantum computation architecture based on utilizing multipartite entanglement. Each module consists of a small-scale quantum computer comprising data, memory and entangling qubits. Entangling qubits are used to…
Gate model quantum computers promise to solve currently intractable computational problems if they can be operated at scale with long coherence times and high fidelity logic. Neutral atom hyperfine qubits provide inherent scalability due to…
In liquid-state NMR quantum computation, a selective entanglement operator between qubits 2 and 3 of a three-qubit molecule is conventionally realized by applying a pair of short $\pi$-pulses to qubit 1. This method, called refocusing, is…
Singlet-triplet states in double quantum dots are promising realizations of qubits, and capacitive coupling can be used to create entanglement between these qubits. We propose an entangling three-qubit gate of singlet-triplet qubits in a…
Deutsch's algorithm is the simplest quantum algorithm which shows the acceleration of quantum computer. In this paper, we theoretically advance a scheme to implement quantum Deutsch's algorithm in spin-orbital angular momentum space. Our…
We implement an embedding quantum simulator (EQS) in nuclear spin systems. The experiment consists of a simulator of up to three qubits, plus a single ancillary qubit, where we are able to efficiently measure the concurrence and the…
A quantum state's entanglement across a bipartite cut can be quantified with entanglement entropy or, more generally, Schmidt norms. Using only Schmidt decompositions, we present a simple iterative algorithm to maximize Schmidt norms.…
We examine the "Guessing Secrets" problem arising in internet routing, in which the goal is to discover two or more objects from a known finite set. We propose a quantum algorithm using O(1) calls to an O(logN) oracle. This improves upon…
We report the first experimental demonstration of quantum delayed-choice experiment via nuclear magnetic resonance techniques. An ensemble of molecules each with two spin-1/2 nuclei are used as target and the ancilla qubits to perform the…
This letter presents a two-dimensional nuclear magnetic resonance(NMR) approach for constructing a two-logical-qubit decoherence-free subspace (DFS) based on the fact that the three protons in a CH3 spin system can not be resolved in…
In a lattice ${\cal L}$ of nuclear spins with ABCABCABC... type periodic structure embedded in a single-crystal solid, each ABC-unit can be used to store quantum information and the information can be moved around via some cellular shifting…
A dipolar recoupling technique is introduced as a new approach to quantum gate operation in solid-state NMR under magic angle spinning. The default-off property of inter-qubit interaction provides a simple way to controlled operation…
Quantum entanglement is a key ingredient for quantum information processing with capabilities beyond that of classical computation. We study the generation and role of entanglement in the dynamics of spin-1/2 models, both for the design of…
Quantum computing tries to exploit entanglement and interference to process information more efficiently than the best known classical solutions. Experiments demonstrating the feasibility of this approach have already been performed.…
Entanglement lies at the core of quantum algorithms designed to solve problems that are intractable by classical approaches. One such algorithm, quantum annealing (QA), provides a promising path to a practical quantum processor. We have…
A hybrid model of the Deutsch-Jozsa algorithm is presented, inspired by the proposals of hybrid computation by S. Lloyd and P. van Loock et. al. The model is based on two observations made about both the discrete and continuous algorithms…