Universal quantum computation using optical coherent states is studied. A teleportation scheme for a coherent-state qubit is developed and applied to gate operations. This scheme is shown to be robust to detection inefficiency.
Previously a new scheme of quantum information processing based on spin coherent states of two component Bose-Einstein condensates was proposed (Byrnes {it et al.} Phys. Rev. A 85, 40306(R)). In this paper we give a more detailed exposition of the sc
heme, expanding on several aspects that were not discussed in full previously. The basic concept of the scheme is that spin coherent states are used instead of qubits to encode qubit information, and manipulated using collective spin operators. The scheme goes beyond the continuous variable regime such that the full space of the Bloch sphere is used. We construct a general framework for quantum algorithms to be executed using multiple spin coherent states, which are individually controlled. We illustrate the scheme by applications to quantum information protocols, and discuss possible experimental implementations. Decoherence effects are analyzed under both general conditions and for the experimental implementation proposed.
We investigate several aspects of realizing quantum computation using entangled polar molecules in pendular states. Quantum algorithms typically start from a product state |00...0> and we show that up to a negligible error, the ground states of polar
molecule arrays can be considered as the unentangled qubit basis state |00...0>. This state can be prepared by simply allowing the system to reach thermal equilibrium at low temperature (<1 mK). We also evaluate entanglement, characterized by the concurrence of pendular state qubits in dipole arrays as governed by the external electric field, dipole-dipole coupling and number N of molecules in the array. In the parameter regime that we consider for quantum computing, we find that qubit entanglement is modest, typically no greater than 0.0001, confirming the negligible entanglement in the ground state. We discuss methods for realizing quantum computation in the gate model, measurement based model, instantaneous quantum polynomial time circuits and the adiabatic model using polar molecules in pendular states.
The calculation of excited state energies of electronic structure Hamiltonians has many important applications, such as the calculation of optical spectra and reaction rates. While low-depth quantum algorithms, such as the variational quantum eigenva
lue solver (VQE), have been used to determine ground state energies, methods for calculating excited states currently involve the implementation of high-depth controlled-unitaries or a large number of additional samples. Here we show how overlap estimation can be used to deflate eigenstates once they are found, enabling the calculation of excited state energies and their degeneracies. We propose an implementation that requires the same number of qubits as VQE and at most twice the circuit depth. Our method is robust to control errors, is compatible with error-mitigation strategies and can be implemented on near-term quantum computers.
We propose and experimentally demonstrate non-destructive and noiseless removal (filtering) of vacuum states from an arbitrary set of coherent states of continuous variable systems. Errors i.e. vacuum states in the quantum information are diagnosed t
hrough a weak measurement, and on that basis, probabilistically filtered out. We consider three different filters based on on/off detection phase stabilized and phase randomized homodyne detection. We find that on/off etection, optimal in the ideal theoretical setting, is superior to the homodyne strategy in a practical setting.
We describe a generalization of the cluster-state model of quantum computation to continuous-variable systems, along with a proposal for an optical implementation using squeezed-light sources, linear optics, and homodyne detection. For universal quan
tum computation, a nonlinear element is required. This can be satisfied by adding to the toolbox any single-mode non-Gaussian measurement, while the initial cluster state itself remains Gaussian. Homodyne detection alone suffices to perform an arbitrary multi-mode Gaussian transformation via the cluster state. We also propose an experiment to demonstrate cluster-based error reduction when implementing Gaussian operations.