Related papers: Solution of the Deutsch-Josza Problem by NMR Ensem…
In dense neutrino gases, which exist for instance in supernovae, the flavour states of different neutrinos may become entangled with one another. The theoretical description of such systems may therefore call for simulations on a quantum…
For a practical quantum computer to operate, it will be essential to properly manage decoherence. One important technique for doing this is the use of "decoherence-free subspaces" (DFSs), which have recently been demonstrated. Here we…
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…
Problems in realization of silicon-based solid-state NMR quantum computer with ensemble addressing to qubits are considered. It is presented the extension of Kane's scheme to ensemble approach version with strip gates. For the…
The nuclear spin is a prime candidate for quantum information applications due to its weak coupling to the environment and inherently long coherence times. However, this weak coupling also challenges the addressability of the nuclear spin.…
Quantum sensing with solid-state systems finds broad applications in diverse areas ranging from material and biomedical sciences to fundamental physics. Several solid-state spin sensors have been developed, facilitating the ultra-sensitive…
We present a computational framework based on geometric structures. No quantum mechanics is involved, and yet the algorithms perform tasks analogous to quantum computation. Tensor products and entangled states are not needed -- they are…
Quantum computing takes fully advantage of the superposition principle to increase greatly (even exponentially) the speed of calculations, relative to the classical approach. The Deutsch-Jozsa algorithm is the simplest quantum algorithm…
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…
We solve analytically the energy eigenvalue problem of narrow semiconductor quantum rings with a general spin-orbit term that includes as a special case the Rashba and Dresselhaus interactions acting simultaneously. The eigenstates and…
We describe the first experimental realization of the Deutsch-Jozsa quantum algorithm to evaluate the properties of a 2-bit boolean function in the framework of one-way quantum computation. For this purpose a novel two-photon six-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…
We have taken significant steps towards the realization of a practical quantum computer: using nuclear spins and magnetic resonance techniques at room temperature, we provided proof of principle of quantum computing in a series of…
We show that one can implement the Deutsch-Josza algorithm, one of the first and simplest quantum algorithms, in a fault-tolerant manner using the smallest quantum error-detecting code -- the $[[4,2,2]]$ code -- without any ancillae. We…
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…
This paper surveys our recent research on quantum information processing by nuclear magnetic resonance (NMR) spectroscopy. We begin with a geometric introduction to the NMR of an ensemble of indistinguishable spins, and then show how this…
Liouville space search algorithm [Bruschweiler, Phys. Rev. Lett. {\bf 85}, 4815(2000).] utilizes mixed initial states of the ensemble, and has been successfully implemented earlier in weakly coupled spins, in which a spin can be identified…
In this paper it has been described how to use the unitary dynamics of quantum mechanics to solve the prime factorization problem on a spin ensemble without any quantum entanglement. The ensemble quantum computation for the prime…
Nuclear magnetic resonance is arguably both the best available quantum technology for implementing simple quantum computing experiments and the worst technology for building large scale quantum computers that has ever been seriously put…
ROM-based quantum computation (QC) is an alternative to oracle-based QC. It has the advantages of being less ``magical'', and being more suited to implementing space-efficient computation (i.e. computation using the minimum number of…