Related papers: Introduction to NMR Quantum Information Processing
Although a universal quantum computer is still far from reach, the tremendous advances in controllable quantum devices, in particular with solid-state systems, make it possible to physically implement "quantum simulators". Quantum…
Recently developed quantum algorithms suggest that in principle, quantum computers can solve problems such as simulation of physical systems more efficiently than classical computers. Much remains to be done to implement these conceptual…
The procedure for simulating the nuclear magnetic resonance spectrum linked to the spin system of a molecule for a certain nucleus entails diagonalizing the associated Hamiltonian matrix. As the dimensions of said matrix grow exponentially…
Measurement-based quantum computation utilizes an initial entangled resource state and proceeds with subsequent single-qubit measurements. It is implicitly assumed that the interactions between qubits can be switched off so that the…
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…
A proposal for a scalable, solid-state implementation of a quantum computer is presented. Qubits are fluorine nuclear spins in a solid crystal of fluorapatite [Ca_5 F(PO_4)_3] with resonant frequencies separated by a large field gradient.…
Quantum computing promises to provide machine learning with computational advantages. However, noisy intermediate-scale quantum (NISQ) devices pose engineering challenges to realizing quantum machine learning (QML) advantages. Recently, a…
Nuclear magnetic resonance spectroscopy is one of the few remaining areas of physical chemistry for which polynomially scaling simulation methods have not so far been available. Here, we report such a method and illustrate its performance…
Optimal labeling schemes lead to efficient experimental protocols for quantum information processing by nuclear magnetic resonance (NMR). A systematic approach of finding optimal labeling schemes for a given computation is described here.…
The Quantum Fourier Transformation ($QFT$) is a key building block for a whole wealth of quantum algorithms. Despite its proven efficiency, only a few proof-of-principle demonstrations have been reported. Here we utilize $QFT$ to enhance…
We review the theoretical and the experimental aspects regarding the quantification and identification of quantum correlations in liquid-state nuclear magnetic resonance (NMR) systems at room temperature. We start by introducing a formal…
The nuclear spins in nanostructured semiconductors play a central role in quantum applications. The nuclear spins represent a useful resource for generating local magnetic fields but nuclear spin noise represents a major source of dephasing…
Algorithmic Cooling is a method that uses novel data compression techniques and simplecquantum computing devices to improve NMR spectroscopy, and to offer scalable NMR quantum computers. The algorithm recursively employs two steps. A…
We report the realization of a nuclear magnetic resonance (NMR) quantum computer which combines the quantum Fourier transform (QFT) with exponentiated permutations, demonstrating a quantum algorithm for order-finding. This algorithm has the…
We present the first NMR implementation of a scheme for selective and efficient quantum process tomography without ancilla. We generalize this scheme such that it can be implemented efficiently using only a set of measurements involving…
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…
The quantum Fourier transform (QFT) has been implemented on a three bit nuclear magnetic resonance (NMR) quantum computer, providing a first step towards the realization of Shor's factoring and other quantum algorithms. Implementation of…
Quantum signal processing (QSP) is a powerful toolbox for the design of quantum algorithms and can lead to asymptotically optimal computational costs. Its realization on noisy quantum computers without fault tolerance, however, is…
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…
The universal quantum homogeniser can transform a qubit from any state to any other state with arbitrary accuracy, using only unitary transformations to perform this task. Here we present an implementation of a finite quantum homogeniser…