Related papers: Generating the Kochen-Specker Sets with 36, 38 and…
We describe a simple quantum algorithm for preparing $K$ copies of an $N$-dimensional quantum state whose amplitudes are given by a quantum oracle. Our result extends a previous work of Grover, who showed how to prepare one copy in time…
A quantum kaleidoscope is defined as a set of observables, or states, consisting of many different subsets that provide closely related proofs of the Bell-Kochen-Specker (BKS) and Bell nonlocality theorems. The kaleidoscopes prove the BKS…
Despite the rich literature on quantum algorithms, there is a surprisingly small amount of coverage of their concrete logical design and implementation. Most resource estimation is done at the level of complexity analysis, but actual…
Since the enlightening proofs of quantum contextuality first established by Kochen and Specker, and also by Bell, various simplified proofs have been constructed to exclude the non-contextual hidden variable theory of our nature at the…
The Kochen-Specker no-go theorem established that hidden-variable theories in quantum mechanics necessarily admit contextuality. This theorem is formally stated in terms of the partial Boolean algebra structure of projectors on a Hilbert…
The novel experimental realization of three-state optical quantum systems is presented. We use the polarization state of biphotons,propagating in single frequency- and spatial mode, to generate an arbitrary qutrits. In particular the…
A set of graphs are called cospectral if their adjacency matrices have the same characteristic polynomial. In this paper we introduce a simple method for constructing infinite families of cospectral regular graphs. The construction is valid…
Let S be a smooth cubic surface defined over a field K. As observed by Segre and Manin, there is a secant and tangent process on S that generates new K-rational points from old. It is natural to ask for the size of a minimal generating set…
PARITY is the problem of determining the parity of a string $f$ of $n$ bits given access to an oracle that responds to a query $x\in\{0,1,...,n-1\}$ with the $x^{\rm th}$ bit of the string, $f(x)$. Classically, $n$ queries are required to…
Two types of inequalities, Kochen-Specker inequalities and noncontextuality inequalities, are both used to demonstrate the incompatibility between the noncontextual hidden variable model and quantum mechanics. It has been thought that…
We propose a kind of reverse Kochen-Specker theorem that amounts to generating orthomodular lattices (OMLs) with exactly one state that do not admit properties of the Hilbert space. We apply MMP algorithms to obtain smallest OMLs with 35…
The paper considers the problem of finding the largest possible set P(n), a subset of the set N of the natural numbers, with the property that a number is in P(n) if and only if it is a sum of n distinct naturals all in P(n) or none in…
The Kochen-Specker (KS) theorem is a cornerstone result in quantum foundations, establishing that quantum correlations in Hilbert spaces of dimension $d \geq 3$ cannot be explained by (consistent) hidden variable theories that assign a…
A set of $n$ pure quantum states is called antidististinguishable if there exists an $n$-outcome measurement that never outputs the outcome `$k$' on the $k$-th quantum state. We describe sets of quantum states for which any subset of three…
For a two-particle two-state system, sets of compatible propositions exist for which quantum mechanics and noncontextual hidden-variable theories make conflicting predictions for every individual system whatever its quantum state. This…
We introduce and formalize a notion of "a priori knowledge" about a quantum system, and show some properties about this form of knowledge. Finally, we show that the Kochen-Specker theorem follows directly from this study. This version is a…
A new method for compiling quantum algorithms is proposed and tested for a three qubit system. The proposed method is to decompose a a unitary matrix U, into a product of simpler U j via a neural network. These U j can then be decomposed…
While conversing with chatbots, humans typically tend to ask many questions, a significant portion of which can be answered by referring to large-scale knowledge graphs (KG). While Question Answering (QA) and dialog systems have been…
A new quantum algorithm is proposed to solve Satisfiability(SAT) problems by taking advantage of non-unitary transformation in ground state quantum computer. The energy gap scale of the ground state quantum computer is analyzed for 3-bit…
The essential operations of a quantum computer can be accomplished using solely optical elements, with different polarization or spatial modes representing the individual qubits. We present a simple all-optical implementation of Grover's…