Search results for "Quantum algorithm"
showing 10 items of 103 documents
Phase transition of light on complex quantum networks
2012
Recent advances in quantum optics and atomic physics allow for an unprecedented level of control over light-matter interactions, which can be exploited to investigate new physical phenomena. In this work we are interested in the role played by the topology of quantum networks describing coupled optical cavities and local atomic degrees of freedom. In particular, using a mean-field approximation, we study the phase diagram of the Jaynes-Cummings-Hubbard model on complex networks topologies, and we characterize the transition between a Mott-like phase of localized polaritons and a superfluid phase. We found that, for complex topologies, the phase diagram is non-trivial and well defined in the…
Recent Developments in Quantum Algorithms and Complexity
2014
We survey several recent developments in quantum algorithms and complexity: Reichardt’s characterization of quantum query algorithms via span programs [15]; New bounds on the number of queries that are necessary for simulating a quantum algorithm that makes a very small number of queries [2]; Exact quantum algorithms with superlinear advantage over the best classical algorithm [4].
Ultrametric Vs. Quantum Query Algorithms
2014
Ultrametric algorithms are similar to probabilistic algorithms but they describe the degree of indeterminism by p-adic numbers instead of real numbers. This paper introduces the notion of ultrametric query algorithms and shows an example of advantages of ultrametric query algorithms over deterministic, probabilistic and quantum query algorithms.
Quantum query algorithms for certain functions and general algorithm construction techniques
2007
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 concentrate on quantum query algorithm designing tasks. The main aim of research was to find new efficient algorithms and develop general algorithm designing techniques. We present several exact quantum query algorithms for certain problems that are better than classical counterparts. Next we introduce algorithm transformation methods that allow significant enlarging of sets of exactly computable functions. Finally, we propose quantum algorithm designing methods. G…
Quantum versus classical query complexity of relation
2011
This paper investigates the computability of mathematical relations in a quantum query model. The important task in complexity theory is to find examples with a large gap between classical and quantum algorithm complexity of the same computational problem. We present new results in quantum query algorithm design that allow achieving a large separation between classical and quantum query complexity of a specific relation. We demonstrate an example where quantum query algorithm for a finite relation needs more than two times fewer queries than the best possible classical analogue. We also show that relation can be extended to infinite family of relations with an input of general size N.
Holonomic Quantum Computation
2008
In this brief review we describe the idea of holonomic quantum computation. The idea of geometric phase and holonomy is introduced in a general way and we provide few examples that should help the reader understand the issues involved.
Multidimensional quantum walks: Diabolical points, optical wave-like propagation, and multipartite entanglement
2013
Quantum walks (QWs) are important for quantum information science, but are becoming also interesting for other fields of research as this simple quantum diffusion model finds analogues in diverse physical systems, optical ones in particular. The experimental capabilities regarding QWs have remarkably increased along recent years and several aspects of QWs are now open to experimental research, multidimensional QWs in particular [1].
Quantum correlations in generalized spin star system
2006
The problem of detecting quantum signatures in the correlations formed in dynamical evolution of quantum bipartite systems receives a lot of attention in current literature. Generally speaking, the occurrence of correlations between two observables of a system does not necessarily reflect nonclassical behaviour. In this paper, the exact dynamics of a pair of uncoupled spins 1/2 interacting with a common spin 1/2 bath is investigated. Starting from a separable initial condition, the ability of the system to develop purely quantum correlations is brought to light. Physical interpretation of the concurrence function as well as a suggestion on how to measure it are given.
An Operator-Based Exact Treatment of Open Quantum Systems
2005
"Quantum mechanics must be regarded as open systems. On one hand, this is due to the fact that, like in classical physics, any realistic system is subjected to a coupling to an uncontrollable environment which influences it in a non-negligible way. The theory of open quantum systems thus plays a major role in many applications of quantum physics since perfect isolation of quantum system is not possible and since a complete microscopic description or control of the environment degrees of freedom is not feasible or only partially so" [1]. Practical considerations therefore force one to seek for a simpler, effectively probabilistic description in terms of an open system. There is a close physi…
High precision quantum query algorithm for computing AND-based boolean functions
2010
Quantum algorithms can be analyzed in a query model to compute Boolean functions. Function input is provided in a black box, and the aim is to compute the function value using as few queries to the black box as possible. The complexity of the algorithm is measured by the number of queries on the worst-case input. In this paper we consider computing AND Boolean function. First, we present a quantum algorithm for AND of two bits. Our algorithm uses one quantum query and correct result is obtained with a probability p=4/5, that improves previous results. The main result is generalization of our approach to design efficient quantum algorithms for computing composite function AND(f1,f2) where fi…