Related papers: Kochen-Specker Algorithms for Qunits
Quantum algorithms use the principles of quantum mechanics, as for example quantum superposition, in order to solve particular problems outperforming standard computation. They are developed for cryptography, searching, optimisation,…
Vector set orthogonal normalization and matrix QR decomposition are fundamental problems in matrix analysis with important applications in many fields. We know that Gram-Schmidt process is a widely used method to solve these two problems.…
Kent's conclusion that ``non-contextual hidden variable theories cannot be excluded by theoretical arguments of the Kochen-Specker type once the imprecision in real world experiments is taken into account'' [Phys. Rev. Lett. 83, 3755…
The Kochen-Specker theorem is a basic and fundamental 50 year old non-existence result affecting the foundations of quantum mechanix, strongly implying the lack of any meaningful notion of "quantum realism", and typically leading to…
In the paper is discussed complete probabilistic description of quantum systems with application to multiqubit quantum computations. In simplest case it is a set of probabilities of transitions to some fixed set of states. The probabilities…
Kochen-Specker theorem rules out the non-contextual assignment of values to physical magnitudes. Here we enrich the usual orthomodular structure of quantum mechanical propositions with modal operators. This enlargement allows to refer…
Partial Boolean algebra underlies the quantum logic as an important tool for quantum contextuality. We propose the notion atom graphs to reveal the graph structure of partial Boolean algebra for finite dimensional quantum systems by proving…
The Traveling Salesman Problem (TSP) is a classical NP-hard problem that plays a crucial role in combinatorial optimization. In this paper, we are interested in the quantum search framework for the TSP because it has robust theoretical…
We propose quantum algorithms, purely quantum in nature, for calculating the determinant and inverse of an $(N-1)\times (N-1)$ matrix (depth is $O(N^2\log N)$) which is a simple modification of the algorithm for calculating the determinant…
Klyachko and coworkers consider an orthogonality graph in the form of a pentagram, and in this way derive a Kochen-Specker inequality for spin 1 systems. In some low-dimensional situations Hilbert spaces are naturally organised, by a…
The Schr\"odinger cat states, constructed from Glauber coherent states and applied for description of qubits, are generalized to the kaleidoscope of coherent states related with regular n-polygon symmetry and the roots of unity. The cases…
We investigate unitary and state $t$-designs from a computational complexity perspective. First, we address the problems of computing frame potentials that characterize (approximate) $t$-designs. We present a quantum algorithm for computing…
In this paper a generalization of the Gram-Schmidt Algorithm is presented. Actually we provide an algorithm to construct a set of equiangular vectors with a given angle $\theta\in(0,\arccos(\frac{-1}{n-1}))$ using a set of input independent…
A central result in the foundations of quantum mechanics is the Kochen-Specker theorem. In short, it states that quantum mechanics cannot be reconciled with classical models that are noncontextual for ideal measurements. The first explicit…
The main aim of this paper is to provide a method which allows finding limiting shapes of symbolic generic initial systems of higher-dimensional subvarieties of P^n. M. Mustata and S. Mayes established a connection between volumes of…
Just as any state of a single qubit or 2-level system can be obtained from any other state by a rotation operator parametrized by three real Euler angles, we show how any state of an n-qubit or 2^n-level system can be obtained from any…
We present a description of finite dimensional quantum entanglement, based on a study of the space of all convex decompositions of a given density matrix. On this space we construct a system of real polynomial equations describing separable…
A fully optical method to perform any quantum computation with optical waveguide modes is proposed by supplying the prescriptions for a universal set of quantum gates. The proposal for quantum computation is based on implementing a quantum…
Quantum Signal Processing (QSP) is a technique that can be used to implement a polynomial transformation $P(x)$ applied to the eigenvalues of a unitary $U$, essentially implementing the operation $P(U)$, provided that $P$ satisfies some…
We recast Grover's generalised search algorithm in a geometric language even when the states are not approximately orthogonal. We provide a possible search algorithm based on an arbitrary unitary transformation which can speed up the steps…