相关论文: A Quantum Gate as a Physical Model of an Universal…

This is continuation of the approach to performing quantum algorithms using geometric structures which was presented by Aerts and Czachor. We solve the Simon's problem which, next to the Shor's alghorithm, is a representative of a quantum…

The field of quantum algorithms aims to find ways to speed up the solution of computational problems by using a quantum computer. A key milestone in this field will be when a universal quantum computer performs a computational task that is…

We propose a definition of quantum computable functions as mappings between superpositions of natural numbers to probability distributions of natural numbers. Each function is obtained as a limit of an infinite computation of a quantum…

We describe how one may go about performing quantum computation with arbitrary "quantum stuff", as long as it has some basic physical properties. Imagine a long strip of stuff, equipped with regularly spaced wires to provide input settings…

Adiabatic limit is the presumption of the adiabatic geometric quantum computation and of the adiabatic quantum algorithm. But in reality, the variation speed of the Hamiltonian is finite. Here we develop a general formulation of adiabatic…

We prove that quantum computation is polynomially equivalent to classical probabilistic computation with an oracle for estimating the value of simple sums, quadratically signed weight enumerators. The problem of estimating these sums can be…

The consistent histories formulation of the quantum theory of a closed system with pure initial state defines an infinite number of incompatible consistent sets, each of which gives a possible description of the physics. We investigate the…

Many quantum algorithms can be analyzed in a query model to compute Boolean functions where input is given by a black box. As in the classical version of decision trees, different kinds of quantum query algorithms are possible: exact,…

In classical computation, a problem can be solved in multiple steps where calculated results of each step can be copied and used repeatedly. While in quantum computation, it is difficult to realize a similar multi-step computation process…

This article outlines our point of view regarding the applicability, state-of-the-art, and potential of quantum computing for problems in finance. We provide an introduction to quantum computing as well as a survey on problem classes in…

Variational quantum algorithms dominate contemporary gate-based quantum enhanced optimisation, eigenvalue estimation and machine learning. Here we establish the quantum computational universality of variational quantum computation by…

This note is intended to foster a discussion about the extent to which typical problems arising in quantum information theory are algorithmically decidable (in principle rather than in practice). Various problems in the context of…

Most problems in uncertainty quantification, despite its ubiquitousness in scientific computing, applied mathematics and data science, remain formidable on a classical computer. For uncertainties that arise in partial differential equations…

Quantum computing promises the ability to compute properties of quantum systems exponentially faster than classical computers. Quantum advantage is achieved when a practical problem is solved more efficiently on a quantum computer than on a…

A scenario for realization of a quantum computer is proposed consisting of spatially distributed q-bits fabricated in a host structure where nuclear spin-spin coupling is mediated by laser pulse controlled electron-nuclear transferred…

Which gates are universal for quantum computation? Although it is well known that certain gates on two-level quantum systems (qubits), such as the controlled-not (CNOT), are universal when assisted by arbitrary one-qubit gates, it has only…

We propose a scheme for quantum computation in optical lattices. The qubits are encoded in the spacial wavefunction of the atoms such that spin decoherence does not influence the computation. Quantum operations are steered by shaking the…

Today, people are looking forward to get an awesome computational power. This kind of desire can be answered by quantum computing. By adopting quantum mechanics theory, it can generate a very fast computation result. As known, quantum…

Manin, Feynman, and Deutsch have viewed quantum computing as a kind of universal physical simulation procedure. Much of the writing about quantum logic circuits and quantum Turing machines has shown how these machines can simulate an…

Quantum walks, the quantum mechanical counterpart of classical random walks, is an advanced tool for building quantum algorithms that has been recently shown to constitute a universal model of quantum computation. Quantum walks is now a…