Related papers: The "quantum" Turan problem for operator systems
Let $V$ be the set of $n\times n$ complex or real general matrices, Hermitian matrices, symmetric matrices, positive definite (resp. semi-definite) matrices, diagonal matrices, or upper triangular matrices. Fix $k\in \mathbb{Z}\setminus…
We explore the applicability of quantum annealing to the approximation task of curve fitting. To this end, we consider a function that shall approximate a given set of data points and is written as a finite linear combination of…
We show the application of permutation-invariant quantum circuits to the clique problem. The experiment asks to label a clique through identification of the nodes in a larger subgraph. The permutation-invariant quantum circuit outperforms a…
Simulation of time dynamical physical problems has been a challenge for classical computers due to their time-complexity. To demonstrate the dominance of quantum computers over classical computers in this regime, here we simulate a…
We study quantum cloning machines (QCM) that act on an unknown N-level quantum state and make M copies. We give a formula for the maximum of the fidelity of cloning and exhibit the unitary transformations that realize this optimal fidelity.…
For k>=1, we consider the graph dynamical system known as a k-reversible process. In such process, each vertex in the graph has one of two possible states at each discrete time. Each vertex changes its state between the present time and the…
We supplement the Lorentz transformation $L(v)$ with a new ``Tunneling" transformation $T(v)$. Application of this new operation to elementary quantum mechanics offers a novel, intuitive insight into the nature of quantum tunneling; in…
The pure state space of Quantum Mechanics is investigated as Hermitian Symmetric Kaehler manifold. The classical principles of Quantum Mechanics (Quantum Superposition Principle, Heisenberg Uncertainty Principle, Quantum Probability…
We discuss the dynamical quantum systems which turn out to be bi-unitary with respect to the same alternative Hermitian structures in a infinite-dimensional complex Hilbert space. We give a necessary and sufficient condition so that the…
The question of whether given density operators for subsystems of a multipartite quantum system are compatible to one common total density operator is known as the quantum marginal problem. We briefly review the solution of a subclass of…
This study investigates pseudo-Hermitian quantum mechanics, where the Hamiltonian satisfies a modified Hermiticity condition. We extend the uncertainty relation for such systems, demonstrating its equivalence to the standard Hermitian case…
It is a classical result that, if a maximal symmetric operator $T$ in a Krein space $\mathcal{H}=\mathcal{H}^-[\oplus]\mathcal{H}^+$ has the property $\mathcal{H}^-\subseteq\mathcal{D}_T$, then the imaginary part of its eigenvalue $\lambda$…
Quantum computers promise to efficiently solve important problems that are intractable on a conventional computer. Quantum computational algorithms have the potential to be an exciting new way of studying quantum cosmology. In quantum…
The theorem known from Pauli equation about operators that anticommute with Dirac's $K$-operator is generalized to the Dirac equation. By means of this theorem the operator is constructed which governs the hidden symmetry in relativistic…
The divide-and-conquer framework, used extensively in classical algorithm design, recursively breaks a problem of size $n$ into smaller subproblems (say, $a$ copies of size $n/b$ each), along with some auxiliary work of cost…
Quantum computing represents a paradigm shift for computation requiring an entirely new computer architecture. However, there is much that can be learned from traditional classical computer engineering. In this paper, we describe the…
The behavior of fermionic systems depends on the geometry of the system and the symmetry class of the Hamiltonian and observables. Almost commuting matrices arise from band-projected position observables in such systems. One expects the…
A motivation is given for expressing classical mechanics in terms of diagonal projection matrices and diagonal density matrices. Then quantum mechanics is seen to be a simple generalization in which one replaces the diagonal real matrices…
Quantum computations usually take place under the control of the classical world. We introduce a Classically-controlled Quantum Turing Machine (CQTM) which is a Turing Machine (TM) with a quantum tape for acting on quantum data, and a…
We study the complexity of a classic problem in computational topology, the homology problem: given a description of some space $X$ and an integer $k$, decide if $X$ contains a $k$-dimensional hole. The setting and statement of the homology…