Related papers: Back to the seminal Deutsch algorithm
Quantum computing is usually associated with discrete quantum states and physical quantities possessing discrete eigenvalue spectrum. However, quantum computing in general is any computation accomplished by the exploitation of quantum…
The driving force in the pursuit for quantum computation is the exciting possibility that quantum algorithms can be more efficient than their classical analogues. Research on the subject has unraveled several aspects of how that can happen.…
The Deutsch-Jozsa algorithm is a generalization of the Deutsch algorithm which was the first algorithm written. We present schemes to implement the Deutsch algorithm and the Deutsch-Jozsa algorithm via cavity QED.
Quantum computers require quantum logic, something fundamentally different to classical Boolean logic. This difference leads to a greater efficiency of quantum computation over its classical counter-part. In this review we explain the basic…
The canonical Schmidt decomposition of quantum states is discussed and its implementation to the Quantum Computation Simulator is outlined. In particular, the semiorder relation in the space of quantum states induced by the lexicographic…
Quantum computing is poised to redefine the algorithmic foundations of communication systems. While quantum superposition and entanglement enable quadratic or exponential speedups for specific problems, identifying use cases where these…
Machine learning is a fascinating and exciting field within computer science. Recently, this excitement has been transferred to the quantum information realm. Currently, all proposals for the quantum version of machine learning utilize the…
Numerical calculus algorithms which estimate derivatives and integrals from data series acquired either via measurements or by sampling functions are essential in scientific computing. To date, a few quantum algorithms have been developed…
Quantum computers promise to surpass the most powerful classical supercomputers when it comes to solving many critically important practical problems, such as pharmaceutical and fertilizer design, supply chain and traffic optimization, or…
Recently the theory of communication developed by Shannon has been extended to the quantum realm by exploiting the rules of quantum theory. This latter stems on complex vector spaces. However complex (as well as real) numbers are just…
Quantum computers use the quantum interference of different computational paths to enhance correct outcomes and suppress erroneous outcomes of computations. A common pattern underpinning quantum algorithms can be identified when quantum…
We propose a genetic-algorithm-based method to find the unitary transformations for any desired quantum computation. We formulate a simple genetic algorithm by introducing the "genetic parameter vector" of the unitary transformations to be…
There are quantum solutions for computational problems that make use of interference at some stage in the algorithm. These stages can be mapped into the physical setting of a single particle travelling through a many-armed interferometer.…
After some historical remarks concerning Schroedinger's discovery of wave mechanics, we present a unified formalism for the mathematical description of classical and quantum-mechanical systems, utilizing elements of the theory of operator…
Demonstrating quantum advantage has been a pressing challenge in the field. Most claimed quantum speedups rely on a subroutine in which classical information can be accessed in a coherent quantum manner, which imposes a crucial constraint…
It is von Neumann who opened the window for today's Information epoch. He defined quantum entropy including Shannon's information more than 20 years ahead of Shannon, and he introduced a concept what computation means mathematically. In…
We consider an example of a quantum algorithm from the point of view of the de Broglie-Bohm formulation of quantum mechanics. For concreteness we look at two particular implementations: one using spin-1/2 particles as described by a simple…
Quantum machine learning seeks to exploit the underlying nature of a quantum computer to enhance machine learning techniques. A particular framework uses the quantum property of superposition to store sets of parameters, thereby creating an…
One advantage of quantum algorithms over classical computation is the possibility to spread out, process, analyse and extract information in multipartite configurations in coherent superpositions of classical states. This will be discussed…
The present work points out that the Deutsch-Jozsa algorithm was the first formal description of a quantum decider. In particular, it is studied here the class of languages whose indicator functions allow the Deutsch-Jozsa algorithm to…