Search results for "Quantum computer"
showing 10 items of 211 documents
Multimode entanglement in reconfigurable graph states using optical frequency combs
2017
Multimode entanglement is an essential resource for quantum information processing and quantum metrology. However, multimode entangled states are generally constructed by targeting a specific graph configuration. This yields to a fixed experimental setup that therefore exhibits reduced versatility and scalability. Here we demonstrate an optical on-demand, reconfigurable multimode entangled state, using an intrinsically multimode quantum resource and a homodyne detection apparatus. Without altering either the initial squeezing source or experimental architecture, we realize the construction of thirteen cluster states of various sizes and connectivities as well as the implementation of a secr…
Ultracold atoms in optical lattices
2007
This article focuses on the characteristics and properties ultracold atoms in optical lattices.
Quantifying, characterizing, and controlling information flow in ultracold atomic gases
2011
We study quantum information flow in a model comprising of an impurity qubit immersed in a Bose-Einstein condensed reservoir. We demonstrate how information flux between the qubit and the condensate can be manipulated by engineering the ultracold reservoir within experimentally realistic limits. We place a particular emphasis on non-Markovian dynamics, characterized by a reversed flow of information from the background gas to the qubit and identify a controllable crossover between Markovian and non-Markovian dynamics in the parameter space of the model.
Trapped Rydberg ions: A new platform for quantum information processing
2020
Abstract In this chapter, we present an overview of experiments with trapped Rydberg ions and outline the advantages and challenges of developing applications of this new platform for quantum computing, sensing, and simulation. Trapped Rydberg ions feature several important properties, unique in their combination: they are tightly bound in a harmonic potential of a Paul trap, in which their internal and external degrees of freedom can be controlled in a precise fashion. High fidelity state preparation of both internal and motional states of the ions has been demonstrated, and the internal states have been employed to store and manipulate qubit information. Furthermore, strong dipolar intera…
Array of planar Penning traps as a nuclear magnetic resonance molecule for quantum computation
2005
An array of planar Penning traps, holding single electrons, can realize an artificial molecule suitable for NMR-like quantum information processing. The effective spin-spin coupling is accomplished by applying a magnetic field gradient, combined to the Coulomb interaction acting between the charged particles. The system lends itself to scalability, since the same substrate can easily accommodate an arbitrary number of traps. Moreover, the coupling strength is tunable and under experimental control. Our theoretical predictions take into account a realistic setting, within the reach of current technology.
Reordering Method and Hierarchies for Quantum and Classical Ordered Binary Decision Diagrams
2017
We consider Quantum OBDD model. It is restricted version of read-once Quantum Branching Programs, with respect to “width” complexity. It is known that maximal complexity gap between deterministic and quantum model is exponential. But there are few examples of such functions. We present method (called “reordering”), which allows to build Boolean function g from Boolean Function f, such that if for f we have gap between quantum and deterministic OBDD complexity for natural order of variables, then we have almost the same gap for function g, but for any order. Using it we construct the total function REQ which deterministic OBDD complexity is \(2^{\varOmega (n/log n)}\) and present quantum OBD…
Superiority Of One-Way And Realtime Quantum Machines
2012
In automata theory, quantum computation has been widely examined for finite state machines, known as quantum finite automata (QFAs), and less attention has been given to QFAs augmented with counters or stacks. In this paper, we focus on such generalizations of QFAs where the input head operates in one-way or realtime mode, and present some new results regarding their superiority over their classical counterparts. Our first result is about the nondeterministic acceptance mode: Each quantum model architecturally intermediate between realtime finite state automaton and one-way pushdown automaton (one-way finite automaton, realtime and one-way finite automata with one-counter, and realtime push…
Very Narrow Quantum OBDDs and Width Hierarchies for Classical OBDDs
2014
In the paper we investigate a model for computing of Boolean functions – Ordered Binary Decision Diagrams (OBDDs), which is a restricted version of Branching Programs. We present several results on the comparative complexity for several variants of OBDD models. We present some results on the comparative complexity of classical and quantum OBDDs. We consider a partial function depending on a parameter k such that for any k > 0 this function is computed by an exact quantum OBDD of width 2, but any classical OBDD (deterministic or stable bounded-error probabilistic) needs width 2 k + 1. We consider quantum and classical nondeterminism. We show that quantum nondeterminism can be more efficient …
Languages Recognizable by Quantum Finite Automata
2006
There are several nonequivalent definitions of quantum finite automata. Nearly all of them recognize only regular languages but not all regular languages. On the other hand, for all these definitions there is a result showing that there is a language l such that the size of the quantum automaton recognizing L is essentially smaller than the size of the minimal deterministic automaton recognizing L. For most of the definitions of quantum finite automata the problem to describe the class of the languages recognizable by the quantum automata is still open. The partial results are surveyed in this paper. Moreover, for the most popular definition of the QFA, the class of languages recognizable b…
Quantum Finite State Transducers
2001
We introduce quantum finite state transducers (qfst), and study the class of relations which they compute. It turns out that they share many features with probabilistic finite state transducers, especially regarding undecidability of emptiness (at least for low probability of success). However, like their 'little brothers', the quantum finite automata, the power of qfst is incomparable to that of their probabilistic counterpart. This we show by discussing a number of characteristic examples.