Related papers: Lorentz Quantum Computer
The existence of universal quantum computers has been theoretically well established. However, building up a real quantum computer system not only relies on the theory of universality, but also needs methods to satisfy requirements on other…
We introduce a novel quantum algorithm for the lattice Boltzmann method (LBM) based on the one-step simplified LBM. The structure of the algorithm allows for more flexibility in modelling different physics in contrast to earlier quantum…
Fuelled by increasing computer power and algorithmic advances, machine learning techniques have become powerful tools for finding patterns in data. Since quantum systems produce counter-intuitive patterns believed not to be efficiently…
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_…
We report the experimental implementation of Grover's quantum search algorithm on a quantum computer with three quantum bits. The computer consists of molecules of $^{13}$C-labeled CHFBr$_2$, in which the three weakly coupled spin-1/2…
HodgeRank generalizes ranking algorithms, e.g. Google PageRank, to rank alternatives based on real-world (often incomplete) data using graphs and discrete exterior calculus. It analyzes multipartite interactions on high-dimensional networks…
Solving linear systems of equations is ubiquitous in all areas of science and engineering. With rapidly growing data sets, such a task can be intractable for classical computers, as the best known classical algorithms require a time…
Basic concepts of quantum theory of information, principles of quantum calculations and the possibility of creation on this basis unique on calculation power and functioning principle device, named quantum computer, are briefly reviewed.…
We review Grover's algorithm by means of a detailed geometrical interpretation and a worked out example. Some basic concepts of Quantum Mechanics and quantum circuits are also reviewed. This work is intended for non-specialists which have…
We consider a proper propositional quantum logic and show that it has multiple disjoint lattice models, only one of which is an orthomodular lattice (algebra) underlying Hilbert (quantum) space. We give an equivalent proof for the classical…
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 computers leverage the unique advantages of quantum mechanics to achieve acceleration over classical computers for certain problems. Currently, various quantum simulators provide powerful tools for researchers, but simulating…
An enduring challenge in computer science is reducing the runtime required to solve computational problems. Quantum computing has attracted significant attention due to its potential to deliver asymptotically faster solutions to certain…
We simulate the nonlinear chaotic dynamics of Lorenz-type models for a classical two-dimensional thermal convection flow with 3 and 8 degrees of freedom by a hybrid quantum--classical reservoir computing model. The high-dimensional quantum…
The Hilbert space formalism of quantum mechanics is reviewed with emphasis on applications to quantum computing. Standard interferomeric techniques are used to construct a physical device capable of universal quantum computation. Some…
A new model of quantum computation is considered, in which the connections between gates are programmed by the state of a quantum register. This new model of computation is shown to be more powerful than the usual quantum computation, e. g.…
We discuss the performance of the Search and Fourier Transform algorithms on a hybrid computer constituted of classical and quantum processors working together. We show that this semi-quantum computer would be an improvement over a pure…
With the advent of quantum computers, many quantum computing algorithms are being developed. Solving linear systems is one of the most fundamental problems in almost all science and engineering. The Harrow-Hassidim-Lloyd algorithm, a…
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…
Quantum computation using electron spins in three coupled dot with different size is proposed. By using the energy selectivity of both photon assisted tunneling and spin rotation of electrons, logic gates are realized by static and…