Related papers: Two-bit Deutsch-Jozsa algorithm using an atomic en…
Quantum information processing based on Rydberg atoms emerged as a promising direction two decades ago. Recent experimental and theoretical progresses have shined exciting light on this avenue. In this concise review, we will briefly…
We have previously discussed the design of a neutral atom quantum computer with an on-demand interaction [E. Hosseini Lapasar, et al., J. Phys. Soc. Jpn. 80, 114003 (2011)]. In this contribution, we propose an experimental method to…
In these notes we present preliminary results on quantum-like algorithms where tensor product is replaced by geometric product. Such algorithms possess the essential properties typical of quantum computation (entanglement, parallelism) but…
The mapping of photonic states to collective excitations of atomic ensembles is a powerful tool which finds a useful application in the realization of quantum memories and quantum repeaters. In this work we show that cold atoms in optical…
A quantum emitter interacting with photons in a single optical-mode constitutes a one-dimensional atom. A coherent and efficiently coupled one-dimensional atom provides a large nonlinearity, enabling photonic quantum gates. Achieving a high…
We introduce Zernike polynomials as a novel degree of freedom for encoding quantum information in the spatial structure of photons. Building on their orthogonality and completeness over the unit disc, we develop a framework for generating,…
We use a categorical topological semantics to examine the Deutsch-Jozsa, hidden subgroup and single-shot Grover algorithms. This reveals important structures hidden by conventional algebraic presentations, and allows novel proofs of…
In this paper, we present a generalisation of the Phase Kick-Back technique, which is central to some of the classical algorithms in quantum computing, such as the Deutsch--Jozsa algorithm, Simon's algorithm or Grover's algorithm. We will…
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…
The JPEG algorithm compresses a digital image by filtering its high spatial-frequency components. Similarly, we introduce a quantum algorithm that uses the quantum Fourier transform to discard the high spatial-frequency qubits of an image,…
A long-standing aim of quantum information research is to understand what gives quantum computers their advantage. This requires separating problems that need genuinely quantum resources from those for which classical resources are enough.…
We investigate the creation of entanglement by the application of phases whose value depends on the state of a collection of qubits. First we give the necessary and sufficient conditions for a given set of phases to result in the creation…
Two-photon ionization of an alkali-metal atom in the presence of a uniform electric field is investigated using a standardized form of local frame transformation and generalized quantum defect theory. The relevant long-range quantum defect…
The Phase Estimation Algorithm (PEA) is an important quantum algorithm used independently or as a key subroutine in other quantum algorithms. Currently most implementations of the PEA are based on qubits, where the computational units in…
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…
An algorithm is proposed which transfers the quantum information of a wave function (analogue signal) into a register of qubits (digital signal) such that $n$ qubits describe the amplitudes and phases of $2^n$ points of a sufficiently…
We construct a quantum bit commitment scheme using a double-slit setup similar to Wheeler's delayed choice experiment. Bob sends photons toward the double-slit, and Alice commits by determining either the slit from which each photon emerges…
The present work points out that the Deutsch-Jozsa algorithm was the first formal description of a quantum decider. In particular, it is studied here the class of languages whose indicator functions allow the Deutsch-Jozsa algorithm to…
Four electron spin qubits in quantum dots are studied by means of an exchange interaction Hamiltonian. The time-independent Schr\"odinger equation is exactly analytically solved for the symmetric case, that is equal qubit frequencies and…
We report an experimental realization of one-way quantum computing on a two-photon four-qubit cluster state. This is accomplished by developing a two-photon cluster state source entangled both in polarization and spatial modes. With this…