相关论文: Quantum computation based on particle statistics
One of the fundamental theories of physics is that of quantum mechanics. Quantum mechanics tries to explain the inconsistencies in the behaviors of systems at the macro and micro scales. Quantum mechanics paved the way for quantum computing…
It is first pointed out that there is a common mathematical model for the universe and the quantum computer. The former is called the histories approach to quantum mechanics and the latter is called measurement based quantum computation.…
The complexity of quantum computation remains poorly understood. While physicists attempt to find ways to create quantum computers, we still do not have much evidence one way or the other as to how useful these machines will be. The tools…
A software product line models the variability of highly configurable systems. Complete exploration of all valid configurations (the configuration space) is infeasible as it grows exponentially with the number of features in the worst case.…
Quantum computing algorithms require that the quantum register be initially present in a superposition state. To achieve this, we consider the practical problem of creating a coherent superposition state of several qubits. Owing to…
The fastest quantum algorithms (for the solution of classical computational tasks) known so far are basically variations of the hidden subgroup problem with {$f(U[x])=f(x)$}. Following a discussion regarding which tasks might be solved…
Quantum computing is a new model of computation, based on quantum physics. Quantum computers can be exponentially faster than conventional computers for problems such as factoring. Besides full-scale quantum computers, more restricted…
Quantum computers promise significant speedups in solving problems intractable for conventional computers but, despite recent progress, remain limited in scaling and availability. Therefore, quantum software and hardware development heavily…
Quantum graphs are commonly used as models of complex quantum systems, for example molecules, networks of wires, and states of condensed matter. We consider quantum statistics for indistinguishable spinless particles on a graph,…
Quantum versions of random walks have diverse applications that are motivating experimental implementations as well as theoretical studies. However, the main impetus behind this interest is their use in quantum algorithms, which have always…
We illustrate the application of Quantum Computing techniques to the investigation of the thermodynamical properties of a simple system, made up of three quantum spins with frustrated pair interactions and affected by a hard sign problem…
We describe some applications of quantum information theory to the analysis of quantum limits on measurement sensitivity. A measurement of a weak force acting on a quantum system is a determination of a classical parameter appearing in the…
Quantum theory (QT) has been confirmed by numerous experiments, yet we still cannot fully grasp the meaning of the theory. As a consequence, the quantum world appears to us paradoxical. Here we shed new light on QT by having it follow from…
Quantum computers can execute algorithms that sometimes dramatically outperform classical computation. Undoubtedly the best-known example of this is Shor's discovery of an efficient quantum algorithm for factoring integers, whereas the same…
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…
As experiments continue to push the quantum-classical boundary using increasingly complex dynamical systems, the interpretation of experimental data becomes more and more challenging: when the observations are noisy, indirect, and limited,…
Statistical functions such as the moment-generating function, characteristic function, cumulant-generating function, and second characteristic function are cornerstone tools in classical statistics and probability theory. They provide a…
Quantum computers can in principle solve certain problems exponentially more quickly than their classical counterparts. We have not yet reached the advent of useful quantum computation, but when we do, it will affect nearly all scientific…
It is proposed to define "quantumness" of a system (micro or macroscopic, physical, biological, social, political) by starting with understanding that quantum mechanics is a statistical theory. It says us only about probability…
These notes are intended as an introduction to a study of applications of noncommutative calculus to quantum statistical Physics. Centered on noncommutative calculus we describe the physical concepts and mathematical structures appearing in…