A Family of Indecomposable Positive Linear Maps based on Entangled Quantum States

We introduce a new family of indecomposable positive linear maps based on entangled quantum states. Central to our construction is the notion of an unextendible product basis. The construction lets us create indecomposable positive linear maps in matrix algebras of arbitrary high dimension.Comment: 16 pages LaTex: updated and a derivation of a lower bound on epsilon is added and calculated for one of the examples. Submitted to Lin. Alg. and Its App

Adiabatic and Hamiltonian computing on a 2D lattice with simple 2-qubit interactions

We show how to perform universal Hamiltonian and adiabatic computing using a time-independent Hamiltonian on a 2D grid describing a system of hopping particles which string together and interact to perform the computation. In this construction, the movement of one particle is controlled by the presence or absence of other particles, an effective quantum field effect transistor that allows the construction of controlled-NOT and controlled-rotation gates. The construction translates into a model for universal quantum computation with time-independent 2-qubit ZZ and XX+YY interactions on an (almost) planar grid. The effective Hamiltonian is arrived at by a single use of first-order perturbation theory avoiding the use of perturbation gadgets. The dynamics and spectral properties of the effective Hamiltonian can be fully determined as it corresponds to a particular realization of a mapping between a quantum circuit and a Hamiltonian called the space-time circuit-to-Hamiltonian construction. Because of the simple interactions required, and because no higher-order perturbation gadgets are employed, our construction is potentially realizable using superconducting or other solid-state qubits.Comment: 33 pages, 5 figure

The Bounded Storage Model in The Presence of a Quantum Adversary

An extractor is a function E that is used to extract randomness. Given an imperfect random source X and a uniform seed Y, the output E(X,Y) is close to uniform. We study properties of such functions in the presence of prior quantum information about X, with a particular focus on cryptographic applications. We prove that certain extractors are suitable for key expansion in the bounded storage model where the adversary has a limited amount of quantum memory. For extractors with one-bit output we show that the extracted bit is essentially equally secure as in the case where the adversary has classical resources. We prove the security of certain constructions that output multiple bits in the bounded storage model.Comment: 13 pages Latex, v3: discussion of independent randomizers adde

Could Grover's quantum algorithm help in searching an actual database?

I investigate whether it would technologically and economically make sense to build database search engines based on Grover's quantum search algorithm. The answer is not fully conclusive but in my judgement rather negative.Comment: 7 pages, LaTe

Adiabatic Quantum Simulators

In his famous 1981 talk, Feynman proposed that unlike classical computers, which would presumably experience an exponential slowdown when simulating quantum phenomena, a universal quantum simulator would not. An ideal quantum simulator would be controllable, and built using existing technology. In some cases, moving away from gate-model-based implementations of quantum computing may offer a more feasible solution for particular experimental implementations. Here we consider an adiabatic quantum simulator which simulates the ground state properties of sparse Hamiltonians consisting of one- and two-local interaction terms, using sparse Hamiltonians with at most three-local interactions. Properties of such Hamiltonians can be well approximated with Hamiltonians containing only two-local terms. The register holding the simulated ground state is brought adiabatically into interaction with a probe qubit, followed by a single diabatic gate operation on the probe which then undergoes free evolution until measured. This allows one to recover e.g. the ground state energy of the Hamiltonian being simulated. Given a ground state, this scheme can be used to verify the QMA-complete problem LOCAL HAMILTONIAN, and is therefore likely more powerful than classical computing.Comment: 9 pages, 1 figur

Encoding a Qubit into a Cavity Mode in Circuit-QED using Phase Estimation

Gottesman, Kitaev and Preskill have formulated a way of encoding a qubit into an oscillator such that the qubit is protected against small shifts (translations) in phase space. The idea underlying this encoding is that error processes of low rate can be expanded into small shift errors. The qubit space is defined as an eigenspace of two mutually commuting displacement operators $S_p$ and $S_q$ which act as large shifts/translations in phase space. We propose and analyze the approximate creation of these qubit states by coupling the oscillator to a sequence of ancilla qubits. This preparation of the states uses the idea of phase estimation where the phase of the displacement operator, say $S_p$, is approximately determined. We consider several possible forms of phase estimation. We analyze the performance of repeated and adapative phase estimation as the simplest and experimentally most viable schemes given a realistic upper-limit on the number of photons in the oscillator. We propose a detailed physical implementation of this protocol using the dispersive coupling between a transmon ancilla qubit and a cavity mode in circuit-QED. We provide an estimate that in a current experimental set-up one can prepare a good code state from a squeezed vacuum state using $8$ rounds of adapative phase estimation, lasting in total about $4 \mu$ sec., with $94\%$ (heralded) chance of success.Comment: 24 pages, 15 figures. Some minor improvements to text and figures. Some of the numerical data has been replaced by more accurate simulations. The improved simulation shows that the code performs better than originally anticipate