相关论文: Cartoon Computation: Quantum-like computing withou…
We describe the first experimental realization of the Deutsch-Jozsa quantum algorithm to evaluate the properties of a 2-bit boolean function in the framework of one-way quantum computation. For this purpose a novel two-photon six-qubit…
Simplest quantum teleportation algorithms can be represented in geometric terms in spaces of dimensions 3 (for real state-vectors) and 4 (for complex state-vectors). The geometric representation is based on geometric-algebra coding, a…
We present a method of using a nuclear magnetic resonance computer to solve the Deutsch-Jozsa problem in which: (1) the number of molecules in the NMR sample is irrelevant to the number of qubits available to an NMR quantum computer, and…
Systems of linear equations are used to model a wide array of problems in all fields of science and engineering. Recently, it has been shown that quantum computers could solve linear systems exponentially faster than classical computers,…
We propose a method for quantum algorithm design assisted by machine learning. The method uses a quantum-classical hybrid simulator, where a "quantum student" is being taught by a "classical teacher." In other words, in our method, the…
We show how it is possible to realize quantum computations on a system in which most of the parameters are practically unknown. We illustrate our results with a novel implementation of a quantum computer by means of bosonic atoms in an…
The Deustch-Jozsa problem is one of the most basic ways to demonstrate the power of quantum computation. Consider a Boolean function f : {0,1}^n to {0,1} and suppose we have a black-box to compute f. The Deutsch-Jozsa problem is to…
Our computers today, from sophisticated servers to small smartphones, operate based on the same computing model, which requires running a sequence of discrete instructions, specified as an algorithm. This sequential computing paradigm has…
Quantum Chemistry and Physics have been pinpointed as killer applications for quantum computers, and quantum algorithms have been designed to solve the Schr\"odinger equation with the wavefunction formalism. It is yet limited to small…
For a practical quantum computer to operate, it will be essential to properly manage decoherence. One important technique for doing this is the use of "decoherence-free subspaces" (DFSs), which have recently been demonstrated. Here we…
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…
We provide a systematic approach to quantum mechanics from an information-theoretic perspective using the language of tensor networks. Our formulation needs only a single kind of object, so-called positive *-tensors. Physical models…
The computational efficiency of quantum mechanics can be defined in terms of the qubit circuit model, which is characterized by a few simple properties: each computational gate is a reversible transformation in a connected matrix group;…
We propose an implementation of a quantum computer to solve Deutsch's problem, which requires exponential time on a classical computer but only linear time with quantum parallelism. By using a dual-rail qubit representation as a simple form…
This paper demonstrates the use of entanglement resources in quantum speedup by presenting an algorithm which is the generalization of an algorithm proposed by Goswami and Panigrahi [arXiv:1706.09489 (2017)]. We generalize the algorithm and…
The matrix functions can be defined by Cauchy's integral formula and can be approximated by the linear combination of inverses of shifted matrices using a quadrature formula. In this paper, we show a concrete construction of a framework to…
The commonly used circuit model of quantum computing leaves out the problems of imprecision in the initial state preparation, particle statistics (indistinguishability of particles belonging to the same quantum state), and error correction…
This thesis consists of two parts. The first part is about how quantum theory can be recovered from first principles, while the second part is about the application of diagrammatic reasoning, specifically the ZX-calculus, to practical…
A model of quantum computing is presented, based on properties of connections with a prescribed monodromy group on holomorphic vector bundles over bases with nontrivial topology. Such connections with required properties appear in the…
The main features of quantum computing are described in the framework of spin resonance methods. Stress is put on the fact that quantum computing is in itself nothing but a re-interpretation (fruitful indeed) of well-known concepts. The…