Search Results: 1 - 10 of 100 matches for " "
All listed articles are free for downloading (OA Articles)
Page 1 /100
Display every page Item
Theory of the Quantum Speed Up  [PDF]
Giuseppe Castagnoli,David Ritz Finkelstein
Physics , 2000, DOI: 10.1098/rspa.2001.0797
Abstract: Insofar as quantum computation is faster than classical, it appears to be irreversible. In all quantum algorithms found so far the speed-up depends on the extra-dynamical irreversible projection representing quantum measurement. Quantum measurement performs a computation that dynamical computation cannot accomplish as efficiently.
Illusion of quantum speed-up  [PDF]
Antoni Wojcik,Ravindra W. Chhajlany
Physics , 2005,
Abstract: Quantum computers are believed to surpass the classical ones. Moreover, it is claimed that this belief reaches the level of a mathematically proven fact within the oracle model of computation. Here we impair the whole class of the so-called rigorist proofs of quantum speed-up obtained within this model.
Speed-up and entanglement in quantum searching  [PDF]
Samuel L. Braunstein,Arun K. Pati
Physics , 2000,
Abstract: We investigate the issue of speed-up and the necessity of entanglement in Grover's quantum search algorithm. We find that in a pure state implementation of Grover's algorithm entanglement is present even though the initial and target states are product states. In pseudo-pure state implementations, the separability of the states involved defines an entanglement boundary in terms of a bound on the purity parameter. Using this bound we investigate the necessity of entanglement in quantum searching for these pseudo-pure state implementations. If every active molecule involved in the ensemble is `charged for' then in existing machines speed-up without entanglement is not possible.
On the role of entanglement in quantum computational speed-up  [PDF]
Richard Jozsa,Noah Linden
Physics , 2002, DOI: 10.1098/rspa.2002.1097
Abstract: For any quantum algorithm operating on pure states we prove that the presence of multi-partite entanglement, with a number of parties that increases unboundedly with input size, is necessary if the quantum algorithm is to offer an exponential speed-up over classical computation. Furthermore we prove that the algorithm can be classically efficiently simulated to within a prescribed tolerance \eta even if a suitably small amount of global entanglement (depending on \eta) is present. We explicitly identify the occurrence of increasing multi-partite entanglement in Shor's algorithm. Our results do not apply to quantum algorithms operating on mixed states in general and we discuss the suggestion that an exponential computational speed-up might be possible with mixed states in the total absence of entanglement. Finally, despite the essential role of entanglement for pure state algorithms, we argue that it is nevertheless misleading to view entanglement as a key resource for quantum computational power.
Quantum Speed-up for Approximating Partition Functions  [PDF]
Pawel Wocjan,Chen-Fu Chiang,Anura Abeyesinghe,Daniel Nagaj
Physics , 2008, DOI: 10.1103/PhysRevA.80.022340
Abstract: We achieve a quantum speed-up of fully polynomial randomized approximation schemes (FPRAS) for estimating partition functions that combine simulated annealing with the Monte-Carlo Markov Chain method and use non-adaptive cooling schedules. The improvement in time complexity is twofold: a quadratic reduction with respect to the spectral gap of the underlying Markov chains and a quadratic reduction with respect to the parameter characterizing the desired accuracy of the estimate output by the FPRAS. Both reductions are intimately related and cannot be achieved separately. First, we use Grover's fixed point search, quantum walks and phase estimation to efficiently prepare approximate coherent encodings of stationary distributions of the Markov chains. The speed-up we obtain in this way is due to the quadratic relation between the spectral and phase gaps of classical and quantum walks. Second, we generalize the method of quantum counting, showing how to estimate expected values of quantum observables. Using this method instead of classical sampling, we obtain the speed-up with respect to accuracy.
Speed-up via Quantum Sampling  [PDF]
Pawel Wocjan,Anura Abeyesinghe
Physics , 2008, DOI: 10.1103/PhysRevA.78.042336
Abstract: The Markov Chain Monte Carlo method is at the heart of efficient approximation schemes for a wide range of problems in combinatorial enumeration and statistical physics. It is therefore very natural and important to determine whether quantum computers can speed-up classical mixing processes based on Markov chains. To this end, we present a new quantum algorithm, making it possible to prepare a quantum sample, i.e., a coherent version of the stationary distribution of a reversible Markov chain. Our algorithm has a significantly better running time than that of a previous algorithm based on adiabatic state generation. We also show that our methods provide a speed-up over a recently proposed method for obtaining ground states of (classical) Hamiltonians.
The quantum speed up as advanced knowledge of the solution  [PDF]
Giuseppe Castagnoli
Physics , 2008, DOI: 10.1007/s10773-008-9859-y
Abstract: With reference to a search in a database of size N, Grover states: "What is the reason that one would expect that a quantum mechanical scheme could accomplish the search in O(square root of N) steps? It would be insightful to have a simple two line argument for this without having to describe the details of the search algorithm". The answer provided in this work is: "because any quantum algorithm takes the time taken by a classical algorithm that knows in advance 50% of the information that specifies the solution of the problem". This empirical fact, unnoticed so far, holds for both quadratic and exponential speed ups and is theoretically justified in three steps: (i) once the physical representation is extended to the production of the problem on the part of the oracle and to the final measurement of the computer register, quantum computation is reduction on the solution of the problem under a relation representing problem-solution interdependence, (ii) the speed up is explained by a simple consideration of time symmetry, it is the gain of information about the solution due to backdating, to before running the algorithm, a time-symmetric part of the reduction on the solution; this advanced knowledge of the solution reduces the size of the solution space to be explored by the algorithm, (iii) if I is the information acquired by measuring the content of the computer register at the end of the algorithm, the quantum algorithm takes the time taken by a classical algorithm that knows in advance 50% of I, which brings us to the initial statement.
Can Quantum Communication Speed Up Distributed Computation?  [PDF]
Michael Elkin,Hartmut Klauck,Danupon Nanongkai,Gopal Pandurangan
Computer Science , 2012,
Abstract: The focus of this paper is on {\em quantum distributed} computation, where we investigate whether quantum communication can help in {\em speeding up} distributed network algorithms. Our main result is that for certain fundamental network problems such as minimum spanning tree, minimum cut, and shortest paths, quantum communication {\em does not} help in substantially speeding up distributed algorithms for these problems compared to the classical setting. In order to obtain this result, we extend the technique of Das Sarma et al. [SICOMP 2012] to obtain a uniform approach to prove non-trivial lower bounds for quantum distributed algorithms for several graph optimization (both exact and approximate versions) as well as verification problems, some of which are new even in the classical setting, e.g. tight randomized lower bounds for Hamiltonian cycle and spanning tree verification, answering an open problem of Das Sarma et al., and a lower bound in terms of the weight aspect ratio, matching the upper bounds of Elkin [STOC 2004]. Our approach introduces the {\em Server model} and {\em Quantum Simulation Theorem} which together provide a connection between distributed algorithms and communication complexity. The Server model is the standard two-party communication complexity model augmented with additional power; yet, most of the hardness in the two-party model is carried over to this new model. The Quantum Simulation Theorem carries this hardness further to quantum distributed computing. Our techniques, except the proof of the hardness in the Server model, require very little knowledge in quantum computing, and this can help overcoming a usual impediment in proving bounds on quantum distributed algorithms.
Quantum Computers Speed Up Classical with Probability Zero  [PDF]
Yuri Ozhigov
Physics , 1998,
Abstract: Let $f$ denote length preserving function on words. A classical algorithm can be considered as $T$ iterated applications of black box representing $f$, beginning with input word $x$ of length $n$. It is proved that if $T=O(2^{n/(7+e)}), e >0$, and $f$ is chosen randomly then with probability 1 every quantum computer requires not less than $T$ evaluations of $f$ to obtain the result of classical computation. It means that the set of classical algorithms admitting quantum speeding up has probability measure zero. The second result is that for arbitrary classical time complexity $T$ and $f$ chosen randomly with probability 1 every quantum simulation of classical computation requires at least $\Omega (\sqrt {T})$ evaluations of $f$.
Understanding the Quantum Computational Speed-up via De-quantisation
Alastair A. Abbott,Cristian S. Calude
Electronic Proceedings in Theoretical Computer Science , 2010, DOI: 10.4204/eptcs.26.1
Abstract: While it seems possible that quantum computers may allow for algorithms offering a computational speed-up over classical algorithms for some problems, the issue is poorly understood. We explore this computational speed-up by investigating the ability to de-quantise quantum algorithms into classical simulations of the algorithms which are as efficient in both time and space as the original quantum algorithms. The process of de-quantisation helps formulate conditions to determine if a quantum algorithm provides a real speed-up over classical algorithms. These conditions can be used to develop new quantum algorithms more effectively (by avoiding features that could allow the algorithm to be efficiently classically simulated), as well as providing the potential to create new classical algorithms (by using features which have proved valuable for quantum algorithms). Results on many different methods of de-quantisations are presented, as well as a general formal definition of de-quantisation. De-quantisations employing higher-dimensional classical bits, as well as those using matrix-simulations, put emphasis on entanglement in quantum algorithms; a key result is that any algorithm in which the entanglement is bounded is de-quantisable. These methods are contrasted with the stabiliser formalism de-quantisations due to the Gottesman-Knill Theorem, as well as those which take advantage of the topology of the circuit for a quantum algorithm. The benefits of the different methods are contrasted, and the importance of a range of techniques is emphasised. We further discuss some features of quantum algorithms which current de-quantisation methods do not cover.
Page 1 /100
Display every page Item

Copyright © 2008-2017 Open Access Library. All rights reserved.