相关论文: A Cavity QED Implementation of Deutsch-Jozsa Algor…
A new approach to the implementation of a quantum computer by high-resolution nuclear magnetic resonance (NMR) is described. The key feature is that two or more line-selective radio-frequency pulses are applied simultaneously. A three-qubit…
We propose a scheme feasible with current technology to implement a quantum delayed-choice experiment in the realm of cavity QED. Our scheme uses two-level atoms interacting on and off resonantly with a single mode of a high Q cavity. At…
Lloyd's algorithm is an iterative method that solves the quantization problem, i.e. the approximation of a target probability measure by a discrete one, and is particularly used in digital applications. This algorithm can be interpreted as…
Cavity QED is a versatile tool to explore small scale quantum information processing. Within this setting, we describe a particular protocol for implementing a Toffoli gate with Rydberg atoms and a cavity field. Our scheme uses both…
We propose a scheme for quantum computing using high-Q cavities in which the qubits are represented by single cavity modes restricted in the space spanned by the two lowest Fock states. We show that single qubit operations and universal…
We propose a scheme to implement the $1\to2$ universal quantum cloning machine of Buzek et.al [Phys. Rev.A 54, 1844(1996)] in the context of cavity QED. The scheme requires cavity-assisted collision processes between atoms, which cross…
Probably the simplest and most frequently used way to illustrate the power of quantum computing is to solve the so-called {\it Deutsch's problem}. Consider a Boolean function $f: \{0,1\} \to \{0,1\}$ and suppose that we have a (classical)…
This article describes a very high-level language for clear description of distributed algorithms and optimizations necessary for generating efficient implementations. The language supports high-level control flows where complex…
A quantum algorithm to solve the parity problem is better than its most efficient classical counter- part with a separation that is polynomial in the number of queries. This was shown by E. Bernstein and U. Vazirani and was one of the…
Quipper is a recently released quantum programming language. In this report, we explore Quipper's programming framework by implementing the Deutsch's, Deutsch-Jozsa's, Simon's, Grover's, and Shor's factoring algorithms. It will help new…
Quantum Computing is a new and exciting field at the intersection of mathematics, computer science and physics. It concerns a utilization of quantum mechanics to improve the efficiency of computation. Here we present a gentle introduction…
We propose an effective realization of a complete set of elementary quantum gates in the solid-state quantum computer based on the multi-atomic coherent (MAC-) ensembles in the QED cavity. Here, we use the two-ensemble qubit encoding and…
Time evolution of quantum systems is of interest in physics, in chemistry, and, more recently, in computer science. Quantum computers are suggested as one route to propagating quantum systems far more efficiently than ordinary numerical…
In the framework of cavity QED, we propose a quantum repeater scheme that uses coherent light and atoms coupled to optical cavities. In contrast to conventional schemes, we exploit solely the cavity QED evolution for the entire quantum…
Quantum computing is evolving so rapidly that it forces us to revisit, rewrite, and update the foundations of the theory. \emph{Basic Quantum Algorithms} revisits the earliest quantum algorithms. The journey began in 1985 with Deutsch…
In this paper we discuss how we can design Hamiltonians to implement quantum algorithms, in particular we focus in Deutsch and Grover algorithms. As main result of this paper, we show how Hamiltonian inverse quantum engineering method allow…
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 describe a quantum computer emulator for a generic, general purpose quantum computer. This emulator consists of a simulator of the physical realization of the quantum computer and a graphical user interface to program and control the…
Quantum algorithms can be analyzed in a query model to compute Boolean functions where input is given in a black box, but the aim is to compute function value for arbitrary input using as few queries as possible. In this paper we…
One of the most promising and versatile approaches to creating new quantum algorithms is based on the quantum hidden subgroup (QHS) paradigm, originally suggested by Alexei Kitaev. This class of quantum algorithms encompasses the…