相关论文: Complex Rational Numbers in Quantum Mechanics
In this paper we introduce an enclosure of the numerical range of a class of rational operator functions. In contrast to the numerical range the presented enclosure can be computed exactly in the infinite dimensional case as well as in the…
We propose an extension of the framework for discussing the computational complexity of problems involving uncountably many objects, such as real numbers, sets and functions, that can be represented only through approximation. The key idea…
Two possible realizations of the formal neuron are considered as quantum system. The first type complies with classical system. The second type vastly increases the possible problems.
It is shown that rational points over finite fields of moduli spaces of stable quiver representations are counted by polynomials with integer coefficients. These polynomials are constructed recursively using an identity in the Hall algebra…
We introduce a notion of nuclear numerical range defined as the set of expectation values of a given operator $A$ among normalized pure states, which belong to the nucleus of an auxiliary operator $Z$. This notion proves to be applicable to…
The quantum integrable systems associated with the quantum loop algebras $\mathrm U_q(\mathcal L(\mathfrak{sl}_{\, l + 1}))$ are considered. The factorized form of the transfer operators related to the infinite dimensional evaluation…
Realistic quantum mechanics based on complex probability theory is shown to have a frequency interpretation, to coexist with Bell's theorem, to be linear, to include wavefunctions which are expansions in eigenfunctions of Hermitian…
A quantum circuit is a computational unit that transforms an input quantum state to an output one. A natural way to reason about its behavior is to compute explicitly the unitary matrix implemented by it. However, when the number of qubits…
We present a number of quantum computing patterns that build on top of fundamental algorithms, that can be applied to solving concrete, NP-hard problems. In particular, we introduce the concept of a quantum dictionary as a summation of…
A proposal for a scalable, solid-state implementation of a quantum computer is presented. Qubits are fluorine nuclear spins in a solid crystal of fluorapatite [Ca_5 F(PO_4)_3] with resonant frequencies separated by a large field gradient.…
The q-fermion numbers emerging from the q-fermion oscillator algebra are used to reproduce the q-fermionic Stirling and Bell numbers. New recurrence relations for the expansion coefficients in the 'anti-normal ordering' of the q-fermion…
This paper addresses the question why quantum mechanics is formulated in a unitary Hilbert space, i.e. in a manifestly complex setting. Investigating the linear dynamics of real quantum theory in a finite-dimensional Euclidean Hilbert space…
This work is based on the field of reference frames based on quantum representations of real and complex numbers described in other work. Here frame domains are expanded to include space and time lattices. Strings of qukits are described as…
This article traces a brief history of the use of single electron spins to compute. In classical computing schemes, a binary bit is represented by the spin polarization of a single electron confined in a quantum dot. If a weak magnetic…
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…
Quantum mechanical operators and quantum fields are interpreted as realizations of timespace manifolds. Such causal manifolds are parametrized by the classes of the positive unitary operations in all complex operations, i.e. by the…
We discuss how to simulate simple quantum logic operations with a large number of qubits. These simulations are needed for experimental testing of scalable solid-state quantum computers. Quantum logic for remote qubits is simulated in a…
This paper initiates a systematic study of quantum functions, which are (partial) functions defined in terms of quantum mechanical computations. Of all quantum functions, we focus on resource-bounded quantum functions whose inputs are…
It is shown that the statistical conception of quantum mechanics is dynamical but not probabilistic, i.e. the statistical description in quantum mechanics is founded on dynamics. A use of the probability theory, when it takes place, is…
We discuss the distribution of the quark number over the gauge fields for QCD at nonzero quark chemical potential. As the quark number operator is non-hermitian, the distribution is over the complex plane. Moreover, because of the fermion…