Related papers: On Quantum Algorithms
A Quantum Computer is a new type of computer which can solve problems such as factoring and database search very efficiently. The usefulness of a quantum computer is limited by the effect of two different types of errors, decoherence and…
Shor's and Grover's famous quantum algorithms for factoring and searching show that quantum computers can solve certain computational problems significantly faster than any classical computer. We discuss here what quantum computers_cannot_…
Quantum computing promises to revolutionize several scientific and technological domains through fundamentally new ways of processing information. Among its most compelling applications is digital quantum simulation, where quantum computers…
Necessary and sufficient conditions are given for the construction of a hybrid quantum computer that operates on both continuous and discrete quantum variables. Such hybrid computers are shown to be more efficient than conventional quantum…
Entanglement of quantum variables is usually thought to be a prerequisite for obtaining quantum speed-ups of information processing tasks such as searching databases. This paper presents methods for quantum search that give a speed-up over…
In general, a quantum algorithm wants to avoid decoherence or perturbation, since such factors may cause errors in the algorithm. In this letter, we will supply the answer to the interesting question: can the factors seemingly harmful to a…
We introduce and review briefly the phenomenon of quantum annealing and analog computation. The role of quantum fluctuation (tunneling) in random systems with rugged (free) energy landscapes having macroscopic barriers are discussed to…
The design of new devices and experiments in science and engineering has historically relied on the intuitions of human experts. This credo, however, has changed. In many disciplines, computer-inspired design processes, also known as…
We describe an algorithm for using a quantum computer to calculate mean values of observables and the partition function of a quantum system. Our algorithm includes two sub-algorithms. The first sub-algorithm is for calculating, with…
Quantum computing has noteworthy speedup over classical computing by taking advantage of quantum parallelism, i.e., the superposition of states. In particular, quantum search is widely used in various computationally hard problems. Grover's…
An experiment is proposed to test the interference aspect of the Quantum Interference Computer approach
The advent of quantum computing has challenged classical conceptions of which problems are efficiently solvable in our physical world. This motivates the general study of how physical principles bound computational power. In this paper we…
We present a number of quantum computing patterns that build on top of fundamental algorithms, that can be applied to solving concrete, NP-hard problems. In particular, we introduce the concept of a quantum dictionary as a summation of…
We show how interferometry can be used to characterise certain aspects of general quantum processes, in particular, the coherence of completely positive maps. We derive a measure of coherent fidelity, maximum interference visibility and the…
Machine learning algorithms learn a desired input-output relation from examples in order to interpret new inputs. This is important for tasks such as image and speech recognition or strategy optimisation, with growing applications in the IT…
Using a quantumlike description for light propagation in nonhomogeneous optical fibers, quantum information processing can be implemented by optical means. Quantum-like bits (qulbits) are associated to light modes in the optical fiber and…
A quantum computer directly manipulates information stored in the state of quantum mechanical systems. The available operations have many attractive features but also underly severe restrictions, which complicate the design of quantum…
Biomarkers play a central role in medicine's gradual progress towards proactive, personalized precision diagnostics and interventions. However, finding biomarkers that provide very early indicators of a change in health status, for example…
Quantum computer algorithms can exploit the structure of random satisfiability problems. This paper extends a previous empirical evaluation of such an algorithm and gives an approximate asymptotic analysis accounting for both the average…
The use of superposition of states in quantum computation, known as quantum parallelism, has significant advantage in terms of speed over the classical computation. It can be understood from the early invented quantum algorithms such as…