Related papers: Examples of quantum integrals
We consider two different ways to encode quantum information, by parallel or anti-parallel pairs of spins. We find that there is more information in the anti-parallel ones. This purely quantum mechanical effect is due to entanglement, not…
We describe quantum theories for massless (p,q)-forms living on Kaehler spaces. In particular we consider four different types of quantum theories: two types involve gauge symmetries and two types are simpler theories without gauge…
We propose a method of compiling that permits to identify quantum circuits able to simulate arbitrary $n$-qubit unitary operations via the adjustment of angles in single-qubit gates therein. The method of compiling itself extends older…
We briefly discuss the current state, and future computational implications, of quantum type theory.
Determining the quantum circuit complexity of a unitary operation is an important problem in quantum computation. By using the mathematical techniques of Riemannian geometry, we investigate the efficient quantum circuits in quantum…
The hypothesis of quantum self-interference is not directly observable, but has at least three necessary implications. First, a quantum entity must have no less than two open paths. Second, the size of the interval between any two…
In this paper, we introduce a new type of $ pq $-calculus. The $ pq $-derivative and $ pq $-integration are investigated and various properties of these concepts are given. The fundamental theorem of $ pq $-calculus and formulas of $ pq…
Superconducting quantum circuit is a promising system for building quantum computer. With this system we demonstrate the universal quantum computations, including the preparing of initial states, the single-qubit operations, the two-qubit…
The agenda of quantum algorithmic information theory, ordered `top-down,' is the quantum halting amplitude, followed by the quantum algorithmic information content, which in turn requires the theory of quantum computation. The fundamental…
The term quantum neural computing indicates a unity in the functioning of the brain. It assumes that the neural structures perform classical processing and that the virtual particles associated with the dynamical states of the structures…
In this paper, first we explain what are the `quantum displacements'. We establish a group of bases, which contains the coupled bases coupling a ququart and a bipartite qubit systems. By these bases, we can realize the quantum…
We define syntax and semantics of quantum circuits, allowing measurement gates and classical channels. We define circuit-based quantum algorithms and prove that, semantically, any such algorithm is equivalent to a single measurement that…
In this introductory review, we focus on applications of quantum computation to problems of interest in physics and chemistry. We describe quantum simulation algorithms that have been developed for electronic-structure problems,…
A new method for computing sums on a quantum computer is introduced. This technique uses the quantum Fourier transform and reduces the number of qubits necessary for addition by removing the need for temporary carry bits. This approach also…
In this paper we give a self contained introduction to the conceptional and mathematical foundations of quantum information theory. In the first part we introduce the basic notions like entanglement, channels, teleportation etc. and their…
Quantum Computing is a new and exciting field at the intersection of mathematics, computer science and physics. It concerns a utilization of quantum mechanics to improve the efficiency of computation. Here we present a gentle introduction…
Quantized integrable systems can be made to perform universal quantum computation by the application of a global time-varying control. The action-angle variables of the integrable system function as qubits or qudits, which can be coupled…
From the philosopher's perspective, the interest in quantum computation stems primarily from the way that it combines fundamental concepts from two distinct sciences: physics (especially quantum mechanics) and computer science, each long a…
We discuss a model for quantum computing with initially mixed states. Although such a computer is known to be less powerful than a quantum computer operating with pure (entangled) states, it may efficiently solve some problems for which no…
By repeated trials, one can determine the fairness of a classical coin with a confidence which grows with the number of trials. A quantum coin can be in a superposition of heads and tails and its state is most generally a density matrix.…